online learning

Double Updating Online Learning JMLR 2011 Efficient Online Learning via Randomized Rounding NeurIPS 2011 From Bandits to Experts: On the Value of Side-Observations NeurIPS 2011 Internal Regret with Partial Monitoring: Calibration-Based Optimal Algorithms JMLR 2011 Learning Eigenvectors for Free NeurIPS 2011 Learning Probabilistic Non-Linear Latent Variable Models for Tracking Complex Activities NeurIPS 2011 Linear Submodular Bandits and their Application to Diversified Retrieval NeurIPS 2011 Minimax Algorithm for Learning Rotations COLT 2011 Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments COLT 2011 Missing Information Impediments to Learnability COLT 2011 Multi-armed bandits on implicit metric spaces NeurIPS 2011 Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction NeurIPS 2011 Nonlinear Online Classification Algorithm with Probability Margin ACML 2011 Online Learning: Beyond Regret COLT 2011 Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm JMLR 2011 Online Learning of Multiple Tasks and Their Relationships AISTATS 2011 Online Learning of Structured Predictors with Multiple Kernels AISTATS 2011 Online Learning: Stochastic, Constrained, and Smoothed Adversaries NeurIPS 2011 Online Submodular Set Cover, Ranking, and Repeated Active Learning NeurIPS 2011 Online Variational Inference for the Hierarchical Dirichlet Process AISTATS 2011 On the Universality of Online Mirror Descent NeurIPS 2011 Predicting Dynamic Difficulty NeurIPS 2011 Prediction strategies without loss NeurIPS 2011 Regret Bounds for the Adaptive Control of Linear Quadratic Systems COLT 2011 Robust approachability and regret minimization in games with partial monitoring COLT 2011