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

Online Algorithms

806 papers

Papers per year

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

Papers

Connections Between Mirror Descent, Thompson Sampling and the Information Ratio NIPS 2019
Thresholding Bandit with Optimal Aggregate Regret NIPS 2019
Recovering Bandits NIPS 2019
Bandits with Feedback Graphs and Switching Costs NIPS 2019
Polynomial Cost of Adaptation for X-Armed Bandits NIPS 2019
Epsilon-Best-Arm Identification in Pay-Per-Reward Multi-Armed Bandits NIPS 2019
Efficient online learning with kernels for adversarial large scale problems NIPS 2019
Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation AAAI 2019
Online Learning from Data Streams with Varying Feature Spaces AAAI 2019
Dynamic Learning of Sequential Choice Bandit Problem under Marketing Fatigue AAAI 2019
Dueling Bandits with Qualitative Feedback AAAI 2019
Optimizing Discount and Reputation Trade-Offs in E-Commerce Systems: Characterization and Online Learning AAAI 2019
FIESTA: Fast IdEntification of State-of-The-Art models using adaptive bandit algorithms ACL 2019
Nearly Optimal Adaptive Procedure with Change Detection for Piecewise-Stationary Bandit AISTATS 2019
Lifelong Optimization with Low Regret AISTATS 2019
An Optimal Algorithm for Stochastic and Adversarial Bandits AISTATS 2019
Conservative Exploration using Interleaving AISTATS 2019
Learning to Optimize under Non-Stationarity AISTATS 2019
Online Multiclass Boosting with Bandit Feedback AISTATS 2019
No-regret algorithms for online $k$-submodular maximization AISTATS 2019
Top Feasible Arm Identification AISTATS 2019
Differentially Private Online Submodular Minimization AISTATS 2019
Exponential Weights on the Hypercube in Polynomial Time AISTATS 2019
Bridging the gap between regret minimization and best arm identification, with application to A/B tests AISTATS 2019
Consistent Online Optimization: Convex and Submodular AISTATS 2019