Multi-Armed Bandits

Pricing a Low-regret Seller ICML 2016 Refined Lower Bounds for Adversarial Bandits NeurIPS 2016 Regret of Queueing Bandits NeurIPS 2016 Scalable Discrete Sampling as a Multi-Armed Bandit Problem ICML 2016 The Multi-fidelity Multi-armed Bandit NeurIPS 2016 Threshold Bandits, With and Without Censored Feedback NeurIPS 2016 Tracking the Best Expert in Non-stationary Stochastic Environments NeurIPS 2016 Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits NeurIPS 2015 Bandit Convex Optimization: \sqrtT Regret in One Dimension COLT 2015 Bandits with Unobserved Confounders: A Causal Approach NeurIPS 2015 Budgeted Bandit Problems with Continuous Random Costs ACML 2015 Cheap Bandits ICML 2015 Combinatorial Bandits Revisited NeurIPS 2015 Combinatorial Cascading Bandits NeurIPS 2015 Contextual Dueling Bandits COLT 2015 Convergence Analysis of Prediction Markets via Randomized Subspace Descent NeurIPS 2015 Copeland Dueling Bandits NeurIPS 2015 Cornering Stationary and Restless Mixing Bandits with Remix-UCB NeurIPS 2015 Counterfactual Risk Minimization: Learning from Logged Bandit Feedback ICML 2015 Efficient Learning in Large-Scale Combinatorial Semi-Bandits ICML 2015 Efficient Thompson Sampling for Online Matrix-Factorization Recommendation NeurIPS 2015 Explore no more: Improved high-probability regret bounds for non-stochastic bandits NeurIPS 2015 Fighting Bandits with a New Kind of Smoothness NeurIPS 2015 Linear Multi-Resource Allocation with Semi-Bandit Feedback NeurIPS 2015 On Identifying Good Options under Combinatorially Structured Feedback in Finite Noisy Environments ICML 2015