online algorithm

Fundamental Limits of Online and Distributed Algorithms for Statistical Learning and Estimation NeurIPS 2014 Multiarmed Bandits With Limited Expert Advice COLT 2014 Online Passive-Aggressive Algorithms for Non-Negative Matrix Factorization and Completion AISTATS 2014 Open Problem: Shifting Experts on Easy Data COLT 2014 Repeated Contextual Auctions with Strategic Buyers NeurIPS 2014 Dimension-Free Exponentiated Gradient NeurIPS 2013 Learning a set of directions COLT 2013 Learning Policies for Contextual Submodular Prediction ICML 2013 Online Learning for Time Series Prediction COLT 2013 Random Spanning Trees and the Prediction of Weighted Graphs JMLR 2013 Stable Coactive Learning via Perturbation ICML 2013 A Linear Time Active Learning Algorithm for Link Classification NeurIPS 2012 Bandit Theory meets Compressed Sensing for high dimensional Stochastic Linear Bandit AISTATS 2012 Mirror Descent Meets Fixed Share (and feels no regret) NeurIPS 2012 Stochastic Gradient Descent with Only One Projection NeurIPS 2012 Adaptive Bandits: Towards the best history-dependent strategy AISTATS 2011 A simple multi-armed bandit algorithm with optimal variation-bounded regret COLT 2011 Budgeted Optimization with Concurrent Stochastic-Duration Experiments NeurIPS 2011 Contextual Bandits with Similarity Information COLT 2011 Monotone multi-armed bandit allocations COLT 2011 Multi-Bandit Best Arm Identification NeurIPS 2011 On-Line Sequential Bin Packing JMLR 2010 Optimal Web-Scale Tiering as a Flow Problem NeurIPS 2010 Algorithms for Infinitely Many-Armed Bandits NeurIPS 2008 Algorithms for Sparse Linear Classifiers in the Massive Data Setting JMLR 2008