← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret COLT 2013
Multiple Identifications in Multi-Armed Bandits ICML 2013
Dynamical Models and tracking regret in online convex programming ICML 2013
Generic Exploration and K-armed Voting Bandits ICML 2013
Almost Optimal Exploration in Multi-Armed Bandits ICML 2013
Learning Policies for Contextual Submodular Prediction ICML 2013
Online Learning under Delayed Feedback ICML 2013
Fast Scheduling of Multi-Robot Teams with Temporospatial Constraints RSS 2013
Lower Bounds and Selectivity of Weak-Consistent Policies in Stochastic Multi-Armed Bandit Problem JMLR 2013
Ranked Bandits in Metric Spaces: Learning Diverse Rankings over Large Document Collections JMLR 2013
One-Pass AUC Optimization ICML 2013
Bounded regret in stochastic multi-armed bandits COLT 2013
Prediction by random-walk perturbation COLT 2013
On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization COLT 2013
Distributed Exploration in Multi-Armed Bandits NIPS 2013
Computing the Stationary Distribution Locally NIPS 2013
Achievability of Asymptotic Minimax Regret in Online and Batch Prediction ACML 2013
Online Coverage by a Tethered Autonomous Mobile Robot in Planar Unknown Environments RSS 2013
Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits AISTATS 2012
Manifold Identification in Dual Averaging for Regularized Stochastic Online Learning JMLR 2012
Beyond Logarithmic Bounds in Online Learning AISTATS 2012
Exchangeability Characterizes Optimality of Sequential Normalized Maximum Likelihood and Bayesian Prediction with Jeffreys Prior AISTATS 2012
No Internal Regret via Neighborhood Watch AISTATS 2012
Confusion-Based Online Learning and a Passive-Aggressive Scheme NIPS 2012
No-Regret Algorithms for Unconstrained Online Convex Optimization NIPS 2012