conftrace_

online algorithm

445 papers

Explore in graph

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) online learning (1777) competitive ratio (74) stochastic optimization (1060) competitive analysis (53) learning-augmented algorithm (44) combinatorial optimization (1039) contextual bandit (381) regret minimization (315)

Papers

A Linear Time Active Learning Algorithm for Link Classification NIPS 2012
Bandit Theory meets Compressed Sensing for high dimensional Stochastic Linear Bandit AISTATS 2012
Stochastic Gradient Descent with Only One Projection NIPS 2012
Mirror Descent Meets Fixed Share (and feels no regret) NIPS 2012
Contextual Bandits with Similarity Information COLT 2011
Adaptive Bandits: Towards the best history-dependent strategy AISTATS 2011
Monotone multi-armed bandit allocations COLT 2011
Budgeted Optimization with Concurrent Stochastic-Duration Experiments NIPS 2011
A simple multi-armed bandit algorithm with optimal variation-bounded regret COLT 2011
Multi-Bandit Best Arm Identification NIPS 2011
On-Line Sequential Bin Packing JMLR 2010
Optimal Web-Scale Tiering as a Flow Problem NIPS 2010
Algorithms for Sparse Linear Classifiers in the Massive Data Setting JMLR 2008
An Online Algorithm for Maximizing Submodular Functions NIPS 2008
Algorithms for Infinitely Many-Armed Bandits NIPS 2008
Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs NIPS 2007
From External to Internal Regret JMLR 2007
Randomized PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension NIPS 2006
Path Kernels and Multiplicative Updates JMLR 2003
Efficient Algorithms for Universal Portfolios JMLR 2002