Online Algorithms

Efficient Online Learning via Randomized Rounding NeurIPS 2011 Fast Trajectory Correction for Nonholonomic Mobile Robots using Affine Transformations RSS 2011 Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization AISTATS 2011 From Bandits to Experts: On the Value of Side-Observations NeurIPS 2011 Improved Algorithms for Linear Stochastic Bandits NeurIPS 2011 Improved Regret Guarantees for Online Smooth Convex Optimization with Bandit Feedback AISTATS 2011 Internal Regret with Partial Monitoring: Calibration-Based Optimal Algorithms JMLR 2011 Learning Eigenvectors for Free NeurIPS 2011 Linear Submodular Bandits and their Application to Diversified Retrieval NeurIPS 2011 Maximum Likelihood vs. Sequential Normalized Maximum Likelihood in On-line Density Estimation COLT 2011 Models of Cooperative Teaching and Learning JMLR 2011 Monotone multi-armed bandit allocations COLT 2011 Multi-armed bandits on implicit metric spaces NeurIPS 2011 Multi-Bandit Best Arm Identification NeurIPS 2011 Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction NeurIPS 2011 Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm JMLR 2011 Online Learning of Structured Predictors with Multiple Kernels AISTATS 2011 Online Learning: Stochastic, Constrained, and Smoothed Adversaries NeurIPS 2011 On the Universality of Online Mirror Descent NeurIPS 2011 Predicting Dynamic Difficulty NeurIPS 2011 Prediction strategies without loss NeurIPS 2011 Sparsity Regret Bounds for Individual Sequences in Online Linear Regression COLT 2011 Stochastic convex optimization with bandit feedback NeurIPS 2011 A Fast Traversal Heuristic and Optimal Algorithm for Effective Environmental Coverage RSS 2010 A Potential-based Framework for Online Multi-class Learning with Partial Feedback AISTATS 2010