conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

806 papers

Papers per year

6
24
87
21
'10
'15
'20
'25

Papers

Minimizing Dynamic Regret and Adaptive Regret Simultaneously AISTATS 2020
Contextual Online False Discovery Rate Control AISTATS 2020
Stochastic Bandits with Delay-Dependent Payoffs AISTATS 2020
OSOM: A simultaneously optimal algorithm for multi-armed and linear contextual bandits AISTATS 2020
Old Dog Learns New Tricks: Randomized UCB for Bandit Problems AISTATS 2020
Online Learning Using Only Peer Prediction AISTATS 2020
Improved Regret Bounds for Projection-free Bandit Convex Optimization AISTATS 2020
Online Learning with Continuous Variations: Dynamic Regret and Reductions AISTATS 2020
An Optimal Algorithm for Bandit Convex Optimization with Strongly-Convex and Smooth Loss AISTATS 2020
Stochastic Linear Contextual Bandits with Diverse Contexts AISTATS 2020
A PTAS for the Bayesian Thresholding Bandit Problem AISTATS 2020
Online Convex Optimization with Perturbed Constraints: Optimal Rates against Stronger Benchmarks AISTATS 2020
Laplacian-Regularized Graph Bandits: Algorithms and Theoretical Analysis AISTATS 2020
A Novel Confidence-Based Algorithm for Structured Bandits AISTATS 2020
An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays AISTATS 2020
A Reduction from Reinforcement Learning to No-Regret Online Learning AISTATS 2020
Optimal $δ$-Correct Best-Arm Selection for Heavy-Tailed Distributions ALT 2020
Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without COLT 2020
The Influence of Shape Constraints on the Thresholding Bandit Problem COLT 2020
Efficient improper learning for online logistic regression COLT 2020
A Closer Look at Small-loss Bounds for Bandits with Graph Feedback COLT 2020
Fast Rates for Online Prediction with Abstention COLT 2020
Online Learning with Imperfect Hints ICML 2020
Online Learning with Dependent Stochastic Feedback Graphs ICML 2020
Real-Time Optimisation for Online Learning in Auctions ICML 2020