← Learning Types
Machine Learning › Learning Types ›

Online Learning

1012 directly classified papers

Papers per year

Papers

BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits ICML 2016
Cost Sensitive Online Multiple Kernel Classification ACML 2016
Online Learning With Bayesian Classification Trees CVPR 2016
Budgeted Bandit Problems with Continuous Random Costs ACML 2015
Online Gradient Boosting NIPS 2015
Combinatorial Cascading Bandits NIPS 2015
Learning Theory and Algorithms for Forecasting Non-stationary Time Series NIPS 2015
Minimax Time Series Prediction NIPS 2015
Fighting Bandits with a New Kind of Smoothness NIPS 2015
The Pareto Regret Frontier for Bandits NIPS 2015
Predtron: A Family of Online Algorithms for General Prediction Problems NIPS 2015
Online Learning with Gaussian Payoffs and Side Observations NIPS 2015
Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring NIPS 2015
Smooth Interactive Submodular Set Cover NIPS 2015
Logarithmic Time Online Multiclass prediction NIPS 2015
Explore no more: Improved high-probability regret bounds for non-stochastic bandits NIPS 2015
Achieving All with No Parameters: AdaNormalHedge COLT 2015
A Chaining Algorithm for Online Nonparametric Regression COLT 2015
Contextual Dueling Bandits COLT 2015
On-Line Learning Algorithms for Path Experts with Non-Additive Losses COLT 2015
Label optimal regret bounds for online local learning COLT 2015
Online Learning with Feedback Graphs: Beyond Bandits COLT 2015
Adaptive Hashing for Fast Similarity Search ICCV 2015
Online Time Series Prediction with Missing Data ICML 2015
Qualitative Multi-Armed Bandits: A Quantile-Based Approach ICML 2015