← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

Contextual Combinatorial Cascading Bandits ICML 2016
On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models JMLR 2016
No-Regret Algorithms for Heavy-Tailed Linear Bandits ICML 2016
BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits ICML 2016
Following the Leader and Fast Rates in Linear Prediction: Curved Constraint Sets and Other Regularities NIPS 2016
Regret of Queueing Bandits NIPS 2016
An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits COLT 2016
Open Problem: Parameter-Free and Scale-Free Online Algorithms COLT 2016
Online Learning and Blackwell Approachability in Quitting Games COLT 2016
Online Collaborative Learning for Open-Vocabulary Visual Classifiers CVPR 2016
Coin Betting and Parameter-Free Online Learning NIPS 2016
Combining Adversarial Guarantees and Stochastic Fast Rates in Online Learning NIPS 2016
The Forget-me-not Process NIPS 2016
Tracking the Best Expert in Non-stationary Stochastic Environments NIPS 2016
An optimal algorithm for the Thresholding Bandit Problem ICML 2016
Online Sparse Linear Regression COLT 2016
Multi-Player Bandits – a Musical Chairs Approach ICML 2016
REX: A Development Platform and Online Learning Approach for Runtime Emergent Software Systems OSDI 2016
Online Learning with Feedback Graphs Without the Graphs ICML 2016
Optimal Best Arm Identification with Fixed Confidence COLT 2016
Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm ICML 2016
Online Learning with Adversarial Delays NIPS 2015
Label optimal regret bounds for online local learning COLT 2015
Online Sketching Hashing CVPR 2015
Global Multi-armed Bandits with Hölder Continuity AISTATS 2015