conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

806 papers

Papers per year

6
24
87
21
'10
'15
'20
'25

Papers

The Best of Both Worlds: Stochastic and Adversarial Bandits COLT 2012
Open Problem: Better Bounds for Online Logistic Regression COLT 2012
Linear Submodular Bandits and their Application to Diversified Retrieval NIPS 2011
Learning Eigenvectors for Free NIPS 2011
Efficient Online Learning via Randomized Rounding NIPS 2011
Adaptive Hedge NIPS 2011
Multi-armed bandits on implicit metric spaces NIPS 2011
Predicting Dynamic Difficulty NIPS 2011
Committing Bandits NIPS 2011
Improved Algorithms for Linear Stochastic 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
Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization AISTATS 2011
A Reduction of Imitation Learning and Structured Prediction to No-Regret Online Learning AISTATS 2011
Improved Regret Guarantees for Online Smooth Convex Optimization with Bandit Feedback AISTATS 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
Complexity-Based Approach to Calibration with Checking Rules COLT 2011
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond COLT 2011
Sparsity Regret Bounds for Individual Sequences in Online Linear Regression COLT 2011
Contextual Bandits with Similarity Information COLT 2011
A simple multi-armed bandit algorithm with optimal variation-bounded regret COLT 2011
Repeated Games against Budgeted Adversaries NIPS 2010
New Adaptive Algorithms for Online Classification NIPS 2010