conftrace_

online algorithm

445 papers

Explore in graph

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) online learning (1777) competitive ratio (74) stochastic optimization (1060) competitive analysis (53) learning-augmented algorithm (44) combinatorial optimization (1039) contextual bandit (381) regret minimization (315)

Papers

AUC Optimization with a Reject Option AAAI 2020
Stochastic Coordinate Minimization with Progressive Precision for Stochastic Convex Optimization ICML 2020
Optimal Non-parametric Learning in Repeated Contextual Auctions with Strategic Buyer ICML 2020
Deep Neural Network Approximated Dynamic Programming for Combinatorial Optimization AAAI 2020
Secretary and Online Matching Problems with Machine Learned Advice NIPS 2020
Prophets, Secretaries, and Maximizing the Probability of Choosing the Best AISTATS 2020
Online Algorithms for Multi-shop Ski Rental with Machine Learned Advice NIPS 2020
Sliding Window Algorithms for k-Clustering Problems NIPS 2020
On Regret with Multiple Best Arms NIPS 2020
Simple and Fast Algorithm for Binary Integer and Online Linear Programming NIPS 2020
Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits NIPS 2020
Contextual Games: Multi-Agent Learning with Side Information NIPS 2020
Sequential no-Substitution k-Median-Clustering AISTATS 2020
Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms NIPS 2020
Online Revenue Maximization for Server Pricing IJCAI 2020
Prophet Inequalities for Bayesian Persuasion IJCAI 2020
Bandits for BMO Functions ICML 2020
My Fair Bandit: Distributed Learning of Max-Min Fairness with Multi-player Bandits ICML 2020
The Adaptive Complexity of Maximizing a Gross Substitutes Valuation NIPS 2020
The Primal-Dual method for Learning Augmented Algorithms NIPS 2020
A Low Complexity Algorithm with O(√T) Regret and O(1) Constraint Violations for Online Convex Optimization with Long Term Constraints JMLR 2020
Online Learning in Changing Environments IJCAI 2020
Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds NIPS 2020
Adversarial Blocking Bandits NIPS 2020
Customizing ML Predictions for Online Algorithms ICML 2020