← Learning Types
Machine Learning › Learning Types ›

Online Learning

1012 directly classified papers

Papers per year

Papers

Regret Minimization for Branching Experts COLT 2013
Approachability, fast and slow COLT 2013
Learning a set of directions COLT 2013
Prediction by random-walk perturbation COLT 2013
Information Complexity in Bandit Subset Selection COLT 2013
How to Hedge an Option Against an Adversary: Black-Scholes Pricing is Minimax Optimal NIPS 2013
Adaptive Submodular Maximization in Bandit Setting NIPS 2013
Beating Bandits in Gradually Evolving Worlds COLT 2013
Online Learning for Time Series Prediction COLT 2013
Estimation of Extreme Values and Associated Level Sets of a Regression Function via Selective Sampling COLT 2013
The price of bandit information in multiclass online classification COLT 2013
Optimization, Learning, and Games with Predictable Sequences NIPS 2013
Robust Data-Driven Dynamic Programming NIPS 2013
Memoized Online Variational Inference for Dirichlet Process Mixture Models NIPS 2013
(Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings NIPS 2013
Bayesian optimization explains human active search NIPS 2013
From Bandits to Experts: A Tale of Domination and Independence NIPS 2013
Online Learning with Switching Costs and Other Adaptive Adversaries NIPS 2013
Online PCA for Contaminated Data NIPS 2013
Online Robust PCA via Stochastic Optimization NIPS 2013
Online Learning of Nonparametric Mixture Models via Sequential Variational Approximation NIPS 2013
Dimension-Free Exponentiated Gradient NIPS 2013
The Pareto Regret Frontier NIPS 2013
Online learning in episodic Markovian decision processes by relative entropy policy search NIPS 2013
Online Learning of Dynamic Parameters in Social Networks NIPS 2013