← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

Consistent Online Optimization: Convex and Submodular AISTATS 2019
Adversarial Online Learning with noise ICML 2019
Bridging the gap between regret minimization and best arm identification, with application to A/B tests AISTATS 2019
Exponential Weights on the Hypercube in Polynomial Time AISTATS 2019
Bootstrapping Upper Confidence Bound NIPS 2019
Thresholding Bandit with Optimal Aggregate Regret NIPS 2019
Reducing Exploration of Dying Arms in Mortal Bandits UAI 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
FIESTA: Fast IdEntification of State-of-The-Art models using adaptive bandit algorithms ACL 2019
Online Linear Optimization with Sparsity Constraints ALT 2019
Dueling Bandits with Qualitative Feedback AAAI 2019
Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation AAAI 2019
Leveraging Experience in Lazy Search RSS 2019
DESPOT-Alpha: Online POMDP Planning with Large State and Observation Spaces RSS 2019
Bandits with Feedback Graphs and Switching Costs NIPS 2019
Recovering Bandits NIPS 2019
Polynomial Cost of Adaptation for X-Armed Bandits NIPS 2019
Logarithmic Regret for Online Control NIPS 2019
Private Learning Implies Online Learning: An Efficient Reduction NIPS 2019
Efficient Adaptive Online Learning via Frequent Directions IJCAI 2018
Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity ICML 2018
Online Learning with Abstention ICML 2018
Let’s be Honest: An Optimal No-Regret Framework for Zero-Sum Games ICML 2018
Compiling Combinatorial Prediction Games ICML 2018