Online Algorithms

Trading-Off Static and Dynamic Regret in Online Least-Squares and Beyond AAAI 2020 Tsallis-INF for Decoupled Exploration and Exploitation in Multi-armed Bandits COLT 2020 X-Armed Bandits: Optimizing Quantiles, CVaR and Other Risks ACML 2019 Adaptivity and Optimality: A Universal Algorithm for Online Convex Optimization UAI 2019 Adversarial Online Learning with noise ICML 2019 A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal and Parameter-free COLT 2019 An Online Algorithm for Smoothed Regression and LQR Control AISTATS 2019 An Optimal Algorithm for Stochastic and Adversarial Bandits AISTATS 2019 ANYTIME MINIBATCH: EXPLOITING STRAGGLERS IN ONLINE DISTRIBUTED OPTIMIZATION ICLR 2019 Bandit Principal Component Analysis COLT 2019 Bandits with Feedback Graphs and Switching Costs NeurIPS 2019 Batched Multi-armed Bandits Problem NeurIPS 2019 Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problem COLT 2019 Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously ICML 2019 Bootstrapping Upper Confidence Bound NeurIPS 2019 Bridging the gap between regret minimization and best arm identification, with application to A/B tests AISTATS 2019 Cautious Regret Minimization: Online Optimization with Long-Term Budget Constraints ICML 2019 Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation AAAI 2019 Cleaning up the neighborhood: A full classification for adversarial partial monitoring ALT 2019 Connections Between Mirror Descent, Thompson Sampling and the Information Ratio NeurIPS 2019 Conservative Exploration using Interleaving AISTATS 2019 Consistent Online Optimization: Convex and Submodular AISTATS 2019 Delay and Cooperation in Nonstochastic Bandits JMLR 2019 DESPOT-Alpha: Online POMDP Planning with Large State and Observation Spaces RSS 2019 Differentially Private Online Submodular Minimization AISTATS 2019