← Learning Types
Machine Learning › Learning Types ›

Online Learning

1012 directly classified papers

Papers per year

Papers

Beyond Logarithmic Bounds in Online Learning AISTATS 2012
On Multilabel Classification and Ranking with Partial Feedback NIPS 2012
Distributed Non-Stochastic Experts NIPS 2012
Imitation Learning by Coaching NIPS 2012
No-Regret Algorithms for Unconstrained Online Convex Optimization NIPS 2012
Relax and Randomize : From Value to Algorithms NIPS 2012
Bandit Algorithms boost Brain Computer Interfaces for motor-task selection of a brain-controlled button NIPS 2012
A Marginalized Particle Gaussian Process Regression NIPS 2012
Adaptive Learning of Smoothing Functions: Application to Electricity Load Forecasting NIPS 2012
Multi-armed Bandit Problems with History AISTATS 2012
Open Problem: Better Bounds for Online Logistic Regression COLT 2012
Near-Optimal Algorithms for Online Matrix Prediction COLT 2012
Consistency of Nearest Neighbor Classification under Selective Sampling COLT 2012
Online L1-Dictionary Learning with Application to Novel Document Detection NIPS 2012
Online allocation and homogeneous partitioning for piecewise constant mean-approximation NIPS 2012
Online Clustering with Experts AISTATS 2012
Exchangeability Characterizes Optimality of Sequential Normalized Maximum Likelihood and Bayesian Prediction with Jeffreys Prior AISTATS 2012
Online Rank Aggregation ACML 2012
Confidence Weighted Mean Reversion Strategy for On-Line Portfolio Selection AISTATS 2011
Agnostic KWIK learning and efficient approximate reinforcement learning COLT 2011
Contextual Bandit Algorithms with Supervised Learning Guarantees AISTATS 2011
Budgeted Optimization with Concurrent Stochastic-Duration Experiments NIPS 2011
Online Submodular Set Cover, Ranking, and Repeated Active Learning NIPS 2011
Multi-Bandit Best Arm Identification NIPS 2011
Missing Information Impediments to Learnability COLT 2011