Online Learning

Online Algorithms for Sum-Product Networks with Continuous Variables PGM 2016 Online Learning With Bayesian Classification Trees CVPR 2016 Online Learning with Feedback Graphs Without the Graphs ICML 2016 Online PCA with Optimal Regret JMLR 2016 Online Pricing with Strategic and Patient Buyers NeurIPS 2016 On the Influence of Momentum Acceleration on Online Learning JMLR 2016 Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent NeurIPS 2016 REX: A Development Platform and Online Learning Approach for Runtime Emergent Software Systems OSDI 2016 Starting Small - Learning with Adaptive Sample Sizes ICML 2016 The Knowledge Gradient for Sequential Decision Making with Stochastic Binary Feedbacks ICML 2016 Threshold Bandits, With and Without Censored Feedback NeurIPS 2016 Tracking the Best Expert in Non-stationary Stochastic Environments NeurIPS 2016 Accelerated Online Low Rank Tensor Learning for Multivariate Spatiotemporal Streams ICML 2015 A Chaining Algorithm for Online Nonparametric Regression COLT 2015 Achieving All with No Parameters: AdaNormalHedge COLT 2015 Adaptive Hashing for Fast Similarity Search ICCV 2015 Adaptive Low-Complexity Sequential Inference for Dirichlet Process Mixture Models NeurIPS 2015 Adaptive Online Learning NeurIPS 2015 An Online Learning Algorithm for Bilinear Models ICML 2015 Budgeted Bandit Problems with Continuous Random Costs ACML 2015 Combinatorial Cascading Bandits NeurIPS 2015 Contextual Dueling Bandits COLT 2015 Copeland Dueling Bandits NeurIPS 2015 Entropy evaluation based on confidence intervals of frequency estimates : Application to the learning of decision trees ICML 2015 Explore no more: Improved high-probability regret bounds for non-stochastic bandits NeurIPS 2015