conftrace_
← Learning Types
Machine Learning › Learning Types ›

Online Learning

1,084 papers

Papers per year

1
23
36
87
38
'05
'10
'15
'20
'25

Papers

Committing Bandits NIPS 2011
From Bandits to Experts: On the Value of Side-Observations NIPS 2011
Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction NIPS 2011
Nonlinear Online Classification Algorithm with Probability Margin ACML 2011
Contextual Bandit Algorithms with Supervised Learning Guarantees AISTATS 2011
Confidence Weighted Mean Reversion Strategy for On-Line Portfolio Selection AISTATS 2011
Online Learning of Structured Predictors with Multiple Kernels AISTATS 2011
Online Learning of Multiple Tasks and Their Relationships AISTATS 2011
Regret Bounds for the Adaptive Control of Linear Quadratic Systems COLT 2011
Blackwell Approachability and No-Regret Learning are Equivalent COLT 2011
Bandits, Query Learning, and the Haystack Dimension COLT 2011
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
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization COLT 2011
A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences COLT 2011
Robust approachability and regret minimization in games with partial monitoring COLT 2011
Online Learning: Beyond Regret COLT 2011
Agnostic KWIK learning and efficient approximate reinforcement learning COLT 2011
Does an Efficient Calibrated Forecasting Strategy Exist? COLT 2011
Bounds on Individual Risk for Log-loss Predictors COLT 2011
A simple multi-armed bandit algorithm with optimal variation-bounded regret COLT 2011
Missing Information Impediments to Learnability COLT 2011
Trading off Mistakes and Don't-Know Predictions NIPS 2010
Online Learning in The Manifold of Low-Rank Matrices NIPS 2010