← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

Online Learning under Delayed Feedback ICML 2013
Optimization, Learning, and Games with Predictable Sequences NIPS 2013
Confusion-Based Online Learning and a Passive-Aggressive Scheme NIPS 2012
SpeedBoost: Anytime Prediction with Uniform Near-Optimality AISTATS 2012
Autonomous Exploration For Navigating In MDPs COLT 2012
Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits AISTATS 2012
Bandit Theory meets Compressed Sensing for high dimensional Stochastic Linear Bandit AISTATS 2012
Open Problem: Better Bounds for Online Logistic Regression COLT 2012
The Best of Both Worlds: Stochastic and Adversarial Bandits COLT 2012
Towards Minimax Policies for Online Linear Optimization with Bandit Feedback COLT 2012
Near-Optimal Algorithms for Online Matrix Prediction COLT 2012
Online Optimization with Gradual Variations COLT 2012
Unified Algorithms for Online Learning and Competitive Analysis COLT 2012
A Stochastic Bandit Algorithm for Scratch Games ACML 2012
Imitation Learning by Coaching NIPS 2012
A Linear Time Active Learning Algorithm for Link Classification NIPS 2012
Online Regret Bounds for Undiscounted Continuous Reinforcement Learning NIPS 2012
Beyond Logarithmic Bounds in Online Learning AISTATS 2012
Online L1-Dictionary Learning with Application to Novel Document Detection NIPS 2012
Risk-Aversion in Multi-armed Bandits NIPS 2012
No-Regret Algorithms for Unconstrained Online Convex Optimization NIPS 2012
Distributed Non-Stochastic Experts NIPS 2012
On Multilabel Classification and Ranking with Partial Feedback NIPS 2012
Relax and Randomize : From Value to Algorithms NIPS 2012
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond COLT 2011