Online Algorithms

Online Roommate Allocation Problem IJCAI 2017 Online Summarization via Submodular and Convex Optimization CVPR 2017 Online to Offline Conversions, Universality and Adaptive Minibatch Sizes NeurIPS 2017 Open Problem: First-Order Regret Bounds for Contextual Bandits COLT 2017 Optimal and Adaptive Off-policy Evaluation in Contextual Bandits ICML 2017 Perishability of Data: Dynamic Pricing under Varying-Coefficient Models JMLR 2017 Playing Repeated Network Interdiction Games with Semi-Bandit Feedback IJCAI 2017 Position-based Multiple-play Bandit Problem with Unknown Position Bias NeurIPS 2017 Random Permutation Online Isotonic Regression NeurIPS 2017 Real-Time Bidding with Side Information NeurIPS 2017 Recognizing Top-Monotonic Preference Profiles in Polynomial Time IJCAI 2017 Regret Analysis for Continuous Dueling Bandit NeurIPS 2017 Revenue Optimization with Approximate Bid Predictions NeurIPS 2017 Rotting Bandits NeurIPS 2017 Scalable Generalized Linear Bandits: Online Computation and Hashing NeurIPS 2017 Softpressure: A Schedule-Driven Backpressure Algorithm for Coping with Network Congestion IJCAI 2017 Sparse Stochastic Bandits COLT 2017 Stochastic and Adversarial Online Learning without Hyperparameters NeurIPS 2017 Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach NeurIPS 2017 The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime COLT 2017 Thompson Sampling for the MNL-Bandit COLT 2017 Thresholding Bandits with Augmented UCB IJCAI 2017 Tight Bounds for Bandit Combinatorial Optimization COLT 2017 Training Deep Networks without Learning Rates Through Coin Betting NeurIPS 2017 Unsupervised Sequential Sensor Acquisition AISTATS 2017