Online Algorithms

Stochastic Multi-armed Bandits in Constant Space AISTATS 2018 Streaming kernel regression with provably adaptive mean, variance, and regularization JMLR 2018 The Everlasting Database: Statistical Validity at a Fair Price NeurIPS 2018 The Externalities of Exploration and How Data Diversity Helps Exploitation COLT 2018 The Promise and Perils of Myopia in Dynamic Pricing With Censored Information IJCAI 2018 Thompson Sampling for Combinatorial Semi-Bandits ICML 2018 Three steps is all you need: fast, accurate, automatic scaling decisions for distributed streaming dataflows OSDI 2018 TopRank: A practical algorithm for online stochastic ranking NeurIPS 2018 UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic Bandits IJCAI 2018 Universal Growth in Production Economies NeurIPS 2018 Weakly Consistent Optimal Pricing Algorithms in Repeated Posted-Price Auctions with Strategic Buyer ICML 2018 Affine-Invariant Online Optimization and the Low-rank Experts Problem NeurIPS 2017 A framework for Multi-A(rmed)/B(andit) Testing with Online FDR Control NeurIPS 2017 A KL-LUCB algorithm for Large-Scale Crowdsourcing NeurIPS 2017 Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning COLT 2017 An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback JMLR 2017 Approximation Vector Machines for Large-scale Online Learning JMLR 2017 Balancing information exposure in social networks NeurIPS 2017 Bandits Dueling on Partially Ordered Sets NeurIPS 2017 Bandits with Movement Costs and Adaptive Pricing COLT 2017 Collecting Telemetry Data Privately NeurIPS 2017 Conservative Contextual Linear Bandits NeurIPS 2017 Consistent k-Clustering ICML 2017 Context Attentive Bandits: Contextual Bandit with Restricted Context IJCAI 2017 Contextual Bandits with Latent Confounders: An NMF Approach AISTATS 2017