Stochastically Constrained Best Arm Identification with Thompson Sampling
Not on the map. Why?
Abstract (arXiv)
We consider the problem of the best arm identification in the presence of stochastic constraints, where there is a finite number of arms associated with multiple performance measures. The goal is to identify the arm that optimizes the objective measure subject to constraints on the remaining measures. We will explore the popular idea of Thompson sampling (TS) as a means to solve it. To the best of our knowledge, it is the first attempt to extend TS to this problem. We will design a TS-based sampling algorithm, establish its asymptotic optimality in the rate of posterior convergence, and demonstrate its superior performance using numerical examples.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 27 references that are in the map. First posted on arXiv 7 Jan 2025.
Builds on
5 of 27 references.
References · 5
- 2016Simple Bayesian Algorithms for Best Arm Identificationcited by 117
- 2013Thompson Sampling for Complex Bandit Problemscited by 43
- 2017Combinatorial Semi-Bandits with Knapsackscited by 23
- 2022Convergence Rate Analysis for Optimal Computing Budget Allocation Algorithmscited by 5
- 2023Improving the Knowledge Gradient Algorithmcited by 2
Built on by
Not cited yet.