← Learning Types
Machine Learning › Learning Types ›

Online Learning

1012 directly classified papers

Papers per year

Papers

Minimax Policies for Combinatorial Prediction Games COLT 2011
Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments COLT 2011
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond COLT 2011
A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences COLT 2011
A Bayesian Approach to Concept Drift NIPS 2010
Online Learning in The Manifold of Low-Rank Matrices NIPS 2010
New Adaptive Algorithms for Online Classification 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
Throttling Poisson Processes NIPS 2010
Learning from Logged Implicit Exploration Data NIPS 2010
Online Learning: Random Averages, Combinatorial Parameters, and Learnability NIPS 2010
Nonparametric Density Estimation for Stochastic Optimization with an Observable State Variable NIPS 2010
Batch Bayesian Optimization via Simulation Matching NIPS 2010
Learning via Gaussian Herding NIPS 2010
Bayesian Online Learning for Multi-label and Multi-variate Performance Measures AISTATS 2010
Exploiting Feature Covariance in High-Dimensional Online Learning AISTATS 2010
Trading off Mistakes and Don't-Know Predictions NIPS 2010
Decision Tree for Dynamic and Uncertain Data Streams ACML 2010
Accurate Ensembles for Data Streams: Combining Restricted Hoeffding Trees using Stacking ACML 2010
Incremental Sparsification for Real-time Online Model Learning AISTATS 2010
Guarantees for Approximate Incremental SVMs AISTATS 2010
A Potential-based Framework for Online Multi-class Learning with Partial Feedback AISTATS 2010
Online Passive-Aggressive Algorithms on a Budget AISTATS 2010