Online Algorithms

Consistent data association in multi-robot systems with limited communications RSS 2010 Guarantees for Approximate Incremental SVMs AISTATS 2010 Incremental Sparsification for Real-time Online Model Learning AISTATS 2010 New Adaptive Algorithms for Online Classification NeurIPS 2010 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 Online Passive-Aggressive Algorithms on a Budget AISTATS 2010 On-Line Sequential Bin Packing JMLR 2010 Optimal Web-Scale Tiering as a Flow Problem NeurIPS 2010 Random Walk Approach to Regret Minimization NeurIPS 2010 Regret Bounds and Minimax Policies under Partial Monitoring JMLR 2010 Repeated Games against Budgeted Adversaries NeurIPS 2010 Adapting to the Shifting Intent of Search Queries NeurIPS 2009 A Parameter-free Hedging Algorithm NeurIPS 2009 Beyond Convexity: Online Submodular Minimization NeurIPS 2009 CarpeDiem: Optimizing the Viterbi Algorithm and Applications to Supervised Sequential Learning JMLR 2009 DUOL: A Double Updating Approach for Online Learning NeurIPS 2009 Learning Linear Ranking Functions for Beam Search with Application to Planning JMLR 2009 Learning Permutations with Exponential Weights JMLR 2009 On Learning Rotations NeurIPS 2009 Online Learning of Assignments NeurIPS 2009 Online Learning with Sample Path Constraints JMLR 2009 On Stochastic and Worst-case Models for Investing NeurIPS 2009