← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Causal Bandits with Unknown Graph Structure NIPS 2021
Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions NIPS 2021
Identification of the Generalized Condorcet Winner in Multi-dueling Bandits NIPS 2021
Minimax Optimal Quantile and Semi-Adversarial Regret via Root-Logarithmic Regularizers NIPS 2021
Generalized Linear Bandits with Local Differential Privacy NIPS 2021
The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle NIPS 2021
Federated Linear Contextual Bandits NIPS 2021
Online Market Equilibrium with Application to Fair Division NIPS 2021
Faster Algorithms and Constant Lower Bounds for the Worst-Case Expected Error NIPS 2021
Logarithmic Regret from Sublinear Hints NIPS 2021
No-regret Online Learning over Riemannian Manifolds NIPS 2021
Towards Best-of-All-Worlds Online Learning with Feedback Graphs NIPS 2021
Online Convex Optimization with Continuous Switching Constraint NIPS 2021
Margin-Independent Online Multiclass Learning via Convex Geometry NIPS 2021
Batched Thompson Sampling NIPS 2021
A Regression Approach to Learning-Augmented Online Algorithms NIPS 2021
Corralling Stochastic Bandit Algorithms AISTATS 2021
Smooth Bandit Optimization: Generalization to Holder Space AISTATS 2021
Online Knapsack with Frequency Predictions NIPS 2021
One More Step Towards Reality: Cooperative Bandits with Imperfect Communication NIPS 2021
Dueling Bandits with Team Comparisons NIPS 2021
Robust Learning of Optimal Auctions NIPS 2021
Optimal Algorithms for Stochastic Contextual Preference Bandits NIPS 2021
$\texttt{LeadCache}$: Regret-Optimal Caching in Networks NIPS 2021
Contextual Recommendations and Low-Regret Cutting-Plane Algorithms NIPS 2021