conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

1
16
59
225
69
'05
'10
'15
'20
'25

Papers

Online Submodular Minimization JMLR 2012
Prediction strategies without loss NIPS 2011
Linear Submodular Bandits and their Application to Diversified Retrieval NIPS 2011
Learning Eigenvectors for Free NIPS 2011
Budgeted Optimization with Concurrent Stochastic-Duration Experiments NIPS 2011
Efficient Online Learning via Randomized Rounding NIPS 2011
Adaptive Hedge NIPS 2011
Stochastic convex optimization with bandit feedback NIPS 2011
Online Learning: Stochastic, Constrained, and Smoothed Adversaries NIPS 2011
Multi-armed bandits on implicit metric spaces NIPS 2011
Predicting Dynamic Difficulty NIPS 2011
On the Universality of Online Mirror Descent NIPS 2011
Multi-Bandit Best Arm Identification 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
Contextual Bandit Algorithms with Supervised Learning Guarantees AISTATS 2011
Active Diagnosis under Persistent Noise with Unknown Noise Distribution: A Rank-Based Approach AISTATS 2011
Confidence Weighted Mean Reversion Strategy for On-Line Portfolio Selection AISTATS 2011
Online Learning of Structured Predictors with Multiple Kernels AISTATS 2011
Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization AISTATS 2011
Adaptive Bandits: Towards the best history-dependent strategy AISTATS 2011
Improved Regret Guarantees for Online Smooth Convex Optimization with Bandit Feedback AISTATS 2011
Complexity-Based Approach to Calibration with Checking Rules COLT 2011