← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

Optimal and Adaptive Algorithms for Online Boosting ICML 2015
Strongly Adaptive Online Learning ICML 2015
Second-Order Non-Stationary Online Learning for Regression JMLR 2015
Minimax Fixed-Design Linear Regression COLT 2015
Bandit Convex Optimization: \sqrtT Regret in One Dimension COLT 2015
A Chaining Algorithm for Online Nonparametric Regression COLT 2015
Online Learning with Feedback Graphs: Beyond Bandits COLT 2015
Non-Asymptotic Analysis of a New Bandit Algorithm for Semi-Bounded Rewards JMLR 2015
Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem COLT 2015
The Hedge Algorithm on a Continuum ICML 2015
Second-order Quantile Methods for Experts and Combinatorial Games COLT 2015
Copeland Dueling Bandits NIPS 2015
Online Ranking with Top-1 Feedback AISTATS 2015
Online F-Measure Optimization NIPS 2015
Online Rank Elicitation for Plackett-Luce: A Dueling Bandits Approach NIPS 2015
Online Learning for Adversaries with Memory: Price of Past Mistakes NIPS 2015
Exp-Concavity of Proper Composite Losses COLT 2015
On the Complexity of Bandit Linear Optimization COLT 2015
An Online Learning Algorithm for Bilinear Models ICML 2015
Bandits with Unobserved Confounders: A Causal Approach NIPS 2015
A Drifting-Games Analysis for Online Learning and Applications to Boosting NIPS 2014
Open Problem: Online Local Learning COLT 2014
Open Problem: Shifting Experts on Easy Data COLT 2014
Online and Stochastic Gradient Methods for Non-decomposable Loss Functions NIPS 2014
Open Problem: Efficient Online Sparse Regression COLT 2014