Online Algorithms

Online Ranking with Top-1 Feedback AISTATS 2015 Online Sketching Hashing CVPR 2015 On the Complexity of Bandit Linear Optimization COLT 2015 Optimal and Adaptive Algorithms for Online Boosting ICML 2015 Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem COLT 2015 Revenue Optimization against Strategic Buyers NeurIPS 2015 Second-Order Non-Stationary Online Learning for Regression JMLR 2015 Second-order Quantile Methods for Experts and Combinatorial Games COLT 2015 Stochastic Online Greedy Learning with Semi-bandit Feedbacks NeurIPS 2015 Strongly Adaptive Online Learning ICML 2015 The Hedge Algorithm on a Continuum ICML 2015 A Boosting Framework on Grounds of Online Learning NeurIPS 2014 A Drifting-Games Analysis for Online Learning and Applications to Boosting NeurIPS 2014 A second-order bound with excess losses COLT 2014 A UCB-Like Strategy of Collaborative Filtering ACML 2014 Bandit Convex Optimization: Towards Tight Bounds NeurIPS 2014 Boosting with Online Binary Learners for the Multiclass Bandit Problem ICML 2014 Bounded Regret for Finite-Armed Structured Bandits NeurIPS 2014 Discovering, Learning and Exploiting Relevance NeurIPS 2014 Dual online inference for latent Dirichlet allocation ACML 2014 Efficient learning by implicit exploration in bandit problems with side observations NeurIPS 2014 Efficient Partial Monitoring with Prior Information NeurIPS 2014 Exploiting easy data in online optimization NeurIPS 2014 Extreme bandits NeurIPS 2014 Follow the Leader with Dropout Perturbations COLT 2014