conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

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

Papers

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
Monotone multi-armed bandit allocations COLT 2011
Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm JMLR 2011
A Bayesian Approximation Method for Online Ranking JMLR 2011
Models of Cooperative Teaching and Learning JMLR 2011
Better Algorithms for Benign Bandits JMLR 2011
Double Updating Online Learning JMLR 2011
Internal Regret with Partial Monitoring: Calibration-Based Optimal Algorithms JMLR 2011
Fast Trajectory Correction for Nonholonomic Mobile Robots using Affine Transformations RSS 2011
Repeated Games against Budgeted Adversaries NIPS 2010
New Adaptive Algorithms for Online Classification NIPS 2010
Non-Stochastic Bandit Slate Problems NIPS 2010
Optimal Web-Scale Tiering as a Flow Problem NIPS 2010
Online Markov Decision Processes under Bandit Feedback NIPS 2010
Online Classification with Specificity Constraints NIPS 2010
Random Walk Approach to Regret Minimization NIPS 2010
Online Learning: Random Averages, Combinatorial Parameters, and Learnability NIPS 2010
Incremental Sparsification for Real-time Online Model Learning AISTATS 2010
Guarantees for Approximate Incremental SVMs AISTATS 2010
A Potential-based Framework for Online Multi-class Learning with Partial Feedback AISTATS 2010
Online Passive-Aggressive Algorithms on a Budget AISTATS 2010
On-Line Sequential Bin Packing JMLR 2010
Regret Bounds and Minimax Policies under Partial Monitoring JMLR 2010