conftrace_

competitive ratio

74 papers

Explore in graph

Co-occurring keywords

online algorithm (445) learning-augmented algorithm (44) competitive analysis (53) regret bound (1926) online convex optimization (165) switching cost (34) randomized algorithm (112) machine learning prediction (17) prediction error (56) multi-armed bandit (1098)

Papers

Learning-Augmented Algorithms for Online TSP on the Line AAAI 2023
Mixing Predictions for Online Metric Algorithms ICML 2023
Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary ICML 2023
Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees ICML 2023
Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems ALT 2023
Best of Both Worlds in Online Control: Competitive Ratio and Policy Regret L4DC 2023
Online Ad Allocation with Predictions NIPS 2023
Multi-agent Online Scheduling: MMS Allocations for Indivisible Items ICML 2023
Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits IJCAI 2023
Random Cuts are Optimal for Explainable k-Medians NIPS 2023
Chasing Convex Bodies and Functions with Black-Box Advice COLT 2022
Online Algorithms for the Santa Claus Problem NIPS 2022
Online Learning with Knapsacks: the Best of Both Worlds ICML 2022
Learning-Augmented Algorithms for Online Steiner Tree AAAI 2022
Parsimonious Learning-Augmented Caching ICML 2022
Secretary Matching with Vertex Arrivals and No Rejections AAAI 2022
Online Search with Best-Price and Query-Based Predictions AAAI 2022
Decentralized Online Convex Optimization in Networked Systems ICML 2022
Smoothed Adversarial Linear Contextual Bandits with Knapsacks ICML 2022
Simple and Optimal Greedy Online Contention Resolution Schemes NIPS 2022
Universal and Tight Online Algorithms for Generalized-Mean Welfare AAAI 2022
Online Page Migration with ML Advice AISTATS 2022
(Optimal) Online Bipartite Matching with Degree Information NIPS 2022
Online Knapsack with Frequency Predictions NIPS 2021
Online Selection Problems against Constrained Adversary ICML 2021