← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Fast rates for prediction with limited expert advice NIPS 2021
Understanding Bandits with Graph Feedback NIPS 2021
Differentially Private Multi-Armed Bandits in the Shuffle Model NIPS 2021
Dueling Bandits with Adversarial Sleeping NIPS 2021
No-substitution k-means Clustering with Adversarial Order ALT 2021
An Efficient Algorithm for Cooperative Semi-Bandits ALT 2021
Last Round Convergence and No-Dynamic Regret in Asymmetric Repeated Games ALT 2021
Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds ALT 2021
Learning Equilibria in Matching Markets from Bandit Feedback NIPS 2021
Fast Pure Exploration via Frank-Wolfe NIPS 2021
Improved Regret Bounds for Tracking Experts with Memory NIPS 2021
ROI Maximization in Stochastic Online Decision-Making NIPS 2021
Conic Blackwell Algorithm: Parameter-Free Convex-Concave Saddle-Point Solving NIPS 2021
Online learning in MDPs with linear function approximation and bandit feedback. NIPS 2021
A unified framework for bandit multiple testing NIPS 2021
Scheduling jobs with stochastic holding costs NIPS 2021
AutoBandit: A Meta Bandit Online Learning System IJCAI 2021
The Limits of Optimal Pricing in the Dark NIPS 2021
Optimal Gradient-based Algorithms for Non-concave Bandit Optimization NIPS 2021
Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback ALT 2021
Learning with Comparison Feedback: Online Estimation of Sample Statistics ALT 2021
Online Learning of Facility Locations ALT 2021
Non-uniform Consistency of Online Learning with Random Sampling ALT 2021
Deterministic Finite-Memory Bias Estimation COLT 2021
Online Learning from Optimal Actions COLT 2021