Skip to content
conftrace_

stochastic bandit

114 papers

Papers

Categorized Bandits NeurIPS 2019 Concentration of risk measures: A Wasserstein distance approach NeurIPS 2019 Data Poisoning Attacks on Stochastic Bandits ICML 2019 Exploring k out of Top ρ Fraction of Arms in Stochastic Bandits AISTATS 2019 Personalizing Many Decisions with High-Dimensional Covariates NeurIPS 2019 Perturbed-History Exploration in Stochastic Linear Bandits UAI 2019 Phase Transitions and Cyclic Phenomena in Bandits with Switching Constraints NeurIPS 2019 Problem-dependent Regret Bounds for Online Learning with Feedback Graphs UAI 2019 Adversarial Attacks on Stochastic Bandits NeurIPS 2018 A General Approach to Multi-Armed Bandits Under Risk Criteria COLT 2018 Information Directed Sampling and Bandits with Heteroscedastic Noise COLT 2018 Profile-Based Bandit with Unknown Profiles JMLR 2018 Refining the Confidence Level for Optimistic Bandit Strategies JMLR 2018 Reinforcement Learning Algorithm Selection ICLR 2018 An Improved Parametrization and Analysis of the EXP3++ Algorithm for Stochastic and Adversarial Bandits COLT 2017 A Scale Free Algorithm for Stochastic Bandits with Bounded Kurtosis NeurIPS 2017 Minimal Exploration in Structured Stochastic Bandits NeurIPS 2017 Towards Instance Optimal Bounds for Best Arm Identification COLT 2017 An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits COLT 2016 Anytime optimal algorithms in stochastic multi-armed bandits ICML 2016 Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm ICML 2016 Online Stochastic Linear Optimization under One-bit Feedback ICML 2016 Pareto Front Identification from Stochastic Bandit Feedback AISTATS 2016 The Multi-fidelity Multi-armed Bandit NeurIPS 2016 Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem COLT 2016