multi-armed bandit

Optimal Algorithms for Stochastic Multi-Armed Bandits with Heavy Tailed Rewards NeurIPS 2020 OSOM: A simultaneously optimal algorithm for multi-armed and linear contextual bandits AISTATS 2020 Path Planning Problems with Side Observations—When Colonels Play Hide-and-Seek AAAI 2020 Preselection Bandits ICML 2020 Regret Analysis of Bandit Problems with Causal Background Knowledge UAI 2020 Regret Bound for Safe Gaussian Process Bandit Optimization L4DC 2020 Regret in Online Recommendation Systems NeurIPS 2020 Regret Minimisation in Multi-Armed Bandits Using Bounded Arm Memory AAAI 2020 Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits NeurIPS 2020 Robust Outlier Arm Identification ICML 2020 Robust Stochastic Bandit Algorithms under Probabilistic Unbounded Adversarial Attack AAAI 2020 Selfish Robustness and Equilibria in Multi-Player Bandits COLT 2020 Solving Bernoulli Rank-One Bandits with Unimodal Thompson Sampling ALT 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 arm-dependent delays ICML 2020 Stochastic Bandits with Delay-Dependent Payoffs AISTATS 2020 Stochastic Online Learning with Probabilistic Graph Feedback AAAI 2020 Sub-sampling for Efficient Non-Parametric Bandit Exploration NeurIPS 2020 The Influence of Shape Constraints on the Thresholding Bandit Problem COLT 2020 The True Sample Complexity of Identifying Good Arms AISTATS 2020 Thompson Sampling for Linearly Constrained Bandits AISTATS 2020 Thompson Sampling for Unsupervised Sequential Selection ACML 2020 Thresholding Bandit Problem with Both Duels and Pulls AISTATS 2020