Multi-Armed Bandits

Open Problem: Model Selection for Contextual Bandits COLT 2020 Optimal $δ$-Correct Best-Arm Selection for Heavy-Tailed Distributions ALT 2020 Optimal Best-arm Identification in Linear Bandits NeurIPS 2020 Optimistic Policy Optimization with Bandit Feedback ICML 2020 Parameterized Indexed Value Function for Efficient Exploration in Reinforcement Learning AAAI 2020 Randomized Exploration for Non-Stationary Stochastic Linear Bandits UAI 2020 Regret Analysis of Bandit Problems with Causal Background Knowledge UAI 2020 Regret Bound for Safe Gaussian Process Bandit Optimization L4DC 2020 Regret Minimisation in Multi-Armed Bandits Using Bounded Arm Memory AAAI 2020 Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Bound ICML 2020 Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits NeurIPS 2020 Safe Linear Stochastic Bandits AAAI 2020 Selfish Robustness and Equilibria in Multi-Player Bandits COLT 2020 Simultaneously Learning Stochastic and Adversarial Episodic MDPs with Known Transition NeurIPS 2020 Smooth Contextual Bandits: Bridging the Parametric and Non-differentiable Regret Regimes COLT 2020 Spectral bandits JMLR 2020 Stage-wise Conservative Linear Bandits NeurIPS 2020 Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits NeurIPS 2020 Stochastic Bandits with Delay-Dependent Payoffs AISTATS 2020 Stochastic Linear Contextual Bandits with Diverse Contexts AISTATS 2020 Stochastic Online Learning with Probabilistic Graph Feedback AAAI 2020 Sub-sampling for Efficient Non-Parametric Bandit Exploration NeurIPS 2020 Taking a hint: How to leverage loss predictors in contextual bandits? COLT 2020 The Influence of Shape Constraints on the Thresholding Bandit Problem COLT 2020 Thompson Sampling for Unsupervised Sequential Selection ACML 2020