← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Improved Regret Guarantees for Online Smooth Convex Optimization with Bandit Feedback AISTATS 2011
Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization AISTATS 2011
Active Diagnosis under Persistent Noise with Unknown Noise Distribution: A Rank-Based Approach AISTATS 2011
Adaptive Bandits: Towards the best history-dependent strategy AISTATS 2011
Multi-armed bandits on implicit metric spaces NIPS 2011
Predicting Dynamic Difficulty NIPS 2011
On the Universality of Online Mirror Descent NIPS 2011
Contextual Bandits with Similarity Information COLT 2011
Fast Trajectory Correction for Nonholonomic Mobile Robots using Affine Transformations RSS 2011
A Fast Traversal Heuristic and Optimal Algorithm for Effective Environmental Coverage RSS 2010
Consistent data association in multi-robot systems with limited communications RSS 2010
New Adaptive Algorithms for Online Classification NIPS 2010
Online Learning: Random Averages, Combinatorial Parameters, and Learnability NIPS 2010
Guarantees for Approximate Incremental SVMs AISTATS 2010
Non-Stochastic Bandit Slate Problems NIPS 2010
Incremental Sparsification for Real-time Online Model Learning AISTATS 2010
Online Passive-Aggressive Algorithms on a Budget AISTATS 2010
A Potential-based Framework for Online Multi-class Learning with Partial Feedback AISTATS 2010
Optimal Web-Scale Tiering as a Flow Problem NIPS 2010
On-Line Sequential Bin Packing JMLR 2010
Regret Bounds and Minimax Policies under Partial Monitoring JMLR 2010
Repeated Games against Budgeted Adversaries NIPS 2010
Online Markov Decision Processes under Bandit Feedback NIPS 2010
Online Classification with Specificity Constraints NIPS 2010
Random Walk Approach to Regret Minimization NIPS 2010