← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Online Learning of Structured Predictors with Multiple Kernels AISTATS 2011
Models of Cooperative Teaching and Learning JMLR 2011
A Bayesian Approximation Method for Online Ranking JMLR 2011
A simple multi-armed bandit algorithm with optimal variation-bounded regret COLT 2011
Double Updating Online Learning JMLR 2011
Multi-Bandit Best Arm Identification NIPS 2011
Improved Algorithms for Linear Stochastic Bandits NIPS 2011
Online Learning: Stochastic, Constrained, and Smoothed Adversaries NIPS 2011
Committing Bandits NIPS 2011
Prediction strategies without loss NIPS 2011
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
Monotone multi-armed bandit allocations COLT 2011
Complexity-Based Approach to Calibration with Checking Rules COLT 2011
Adaptive Hedge NIPS 2011
Internal Regret with Partial Monitoring: Calibration-Based Optimal Algorithms JMLR 2011
Better Algorithms for Benign Bandits JMLR 2011
Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm JMLR 2011
From Bandits to Experts: On the Value of Side-Observations NIPS 2011
Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction NIPS 2011
Budgeted Optimization with Concurrent Stochastic-Duration Experiments NIPS 2011
Stochastic convex optimization with bandit feedback NIPS 2011
Confidence Weighted Mean Reversion Strategy for On-Line Portfolio Selection AISTATS 2011
Contextual Bandit Algorithms with Supervised Learning Guarantees AISTATS 2011