Online Algorithms

Non-Stochastic Bandit Slate Problems NeurIPS 2010 Online Classification with Specificity Constraints NeurIPS 2010 Online Learning: Random Averages, Combinatorial Parameters, and Learnability NeurIPS 2010 Online Markov Decision Processes under Bandit Feedback NeurIPS 2010 Optimal Web-Scale Tiering as a Flow Problem NeurIPS 2010 Parametric Bandits: The Generalized Linear Case NeurIPS 2010 Random Walk Approach to Regret Minimization NeurIPS 2010 Repeated Games against Budgeted Adversaries NeurIPS 2010 A Parameter-free Hedging Algorithm NeurIPS 2009 Beyond Convexity: Online Submodular Minimization NeurIPS 2009 Bounded Kernel-Based Online Learning JMLR 2009 On Learning Rotations NeurIPS 2009 Online Learning of Assignments NeurIPS 2009 Online Learning with Samples Drawn from Non-identical Distributions JMLR 2009 On Stochastic and Worst-case Models for Investing NeurIPS 2009 Slow Learners are Fast NeurIPS 2009 Streaming k-means approximation NeurIPS 2009 Tracking Dynamic Sources of Malicious Activity at Internet Scale NeurIPS 2009 Algorithms for Infinitely Many-Armed Bandits NeurIPS 2008 Mind the Duality Gap: Logarithmic regret algorithms for online optimization NeurIPS 2008 Mortal Multi-Armed Bandits NeurIPS 2008 Online Models for Content Optimization NeurIPS 2008 Online Prediction on Large Diameter Graphs NeurIPS 2008 Sparse Online Learning via Truncated Gradient NeurIPS 2008 Adaptive Online Gradient Descent NeurIPS 2007