← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle NIPS 2021
Online Selection Problems against Constrained Adversary ICML 2021
Problem Dependent View on Structured Thresholding Bandit Problems ICML 2021
Federated Linear Contextual Bandits NIPS 2021
Data-driven Competitive Algorithms for Online Knapsack and Set Cover AAAI 2021
Lazy OCO: Online Convex Optimization on a Switching Budget COLT 2021
Mirror Descent and the Information Ratio COLT 2021
Optimal Dynamic Regret in Exp-Concave Online Learning COLT 2021
Achieving Near Instance-Optimality and Minimax-Optimality in Stochastic and Adversarial Linear Bandits Simultaneously ICML 2021
Disposable Linear Bandits for Online Recommendations AAAI 2021
Online Optimal Control with Affine Constraints AAAI 2021
Online Market Equilibrium with Application to Fair Division NIPS 2021
Robust Pure Exploration in Linear Bandits with Limited Budget ICML 2021
Identification of the Generalized Condorcet Winner in Multi-dueling Bandits NIPS 2021
Quantum Exploration Algorithms for Multi-Armed Bandits AAAI 2021
Mixability made efficient: Fast online multiclass logistic regression NIPS 2021
Training a Single Bandit Arm AISTATS 2021
Fair Algorithms for Multi-Agent Multi-Armed Bandits NIPS 2021
Increasing Iterate Averaging for Solving Saddle-Point Problems AAAI 2021
Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits ICML 2021
An Efficient Pessimistic-Optimistic Algorithm for Stochastic Linear Bandits with General Constraints NIPS 2021
Learning Augmented Methods for Matching: Improving Invasive Species Management and Urban Mobility AAAI 2021
Combinatorial semi-bandit in the non-stationary environment UAI 2021
Variance-dependent best arm identification UAI 2021
Beyond $log^2(T)$ regret for decentralized bandits in matching markets ICML 2021