Online Algorithms

Prediction With Expert Advice For The Brier Game JMLR 2009 Slow Learners are Fast NeurIPS 2009 Tracking Dynamic Sources of Malicious Activity at Internet Scale NeurIPS 2009 Algorithms for Infinitely Many-Armed Bandits NeurIPS 2008 An Online Algorithm for Maximizing Submodular Functions NeurIPS 2008 Mind the Duality Gap: Logarithmic regret algorithms for online optimization NeurIPS 2008 Mortal Multi-Armed Bandits NeurIPS 2008 Online Learning of Complex Prediction Problems Using Simultaneous Projections JMLR 2008 Online Models for Content Optimization NeurIPS 2008 Online Optimization in X-Armed Bandits NeurIPS 2008 Online Prediction on Large Diameter Graphs NeurIPS 2008 On the Generalization Ability of Online Strongly Convex Programming Algorithms NeurIPS 2008 Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension JMLR 2008 Adaptive Online Gradient Descent NeurIPS 2007 Automatic Scheduling for Parallel Forward Dynamics Computation of Open Kinematic Chains RSS 2007 From External to Internal Regret JMLR 2007 Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs NeurIPS 2007 The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information NeurIPS 2007 The Price of Bandit Information for Online Optimization NeurIPS 2007 Handling Advertisements of Unknown Quality in Search Advertising NeurIPS 2006 No-regret Algorithms for Online Convex Programs NeurIPS 2006 Online Classification for Complex Problems Using Simultaneous Projections NeurIPS 2006 Online Clustering of Moving Hyperplanes NeurIPS 2006 Online Passive-Aggressive Algorithms JMLR 2006 Superior Guarantees for Sequential Prediction and Lossless Compression via Alphabet Decomposition JMLR 2006