Online Algorithms

Online and Distributed Bayesian Moment Matching for Parameter Learning in Sum-Product Networks AISTATS 2016 Online Collaborative Learning for Open-Vocabulary Visual Classifiers CVPR 2016 Online Convex Optimization with Unconstrained Domains and Losses NeurIPS 2016 Online Isotonic Regression COLT 2016 Online learning in repeated auctions COLT 2016 Online Learning to Rank with Feedback at the Top AISTATS 2016 Online PCA with Optimal Regret JMLR 2016 Online Pricing with Strategic and Patient Buyers NeurIPS 2016 Online Stochastic Linear Optimization under One-bit Feedback ICML 2016 Optimistic Bandit Convex Optimization NeurIPS 2016 Optimistic Gittins Indices NeurIPS 2016 Optimization as Estimation with Gaussian Processes in Bandit Settings AISTATS 2016 Pareto Front Identification from Stochastic Bandit Feedback AISTATS 2016 Phased Exploration with Greedy Exploitation in Stochastic Combinatorial Partial Monitoring Games NeurIPS 2016 Pricing a Low-regret Seller ICML 2016 Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent NeurIPS 2016 Random Forest for the Contextual Bandit Problem AISTATS 2016 Randomization and The Pernicious Effects of Limited Budgets on Auction Experiments AISTATS 2016 Refined Lower Bounds for Adversarial Bandits NeurIPS 2016 Regret Analysis of the Finite-Horizon Gittins Index Strategy for Multi-Armed Bandits COLT 2016 Regret of Queueing Bandits NeurIPS 2016 Revealing Graph Bandits for Maximizing Local Influence AISTATS 2016 Shifting Regret, Mirror Descent, and Matrices ICML 2016 Slicer: Auto-Sharding for Datacenter Applications OSDI 2016 The Multi-fidelity Multi-armed Bandit NeurIPS 2016