The paper claims a posterior-sampling algorithm achieves the optimal error exponent for fixed-budget linear best feasible arm identification, but the proof has scaling and direction errors.
Finite-time analysis of the multiarmed bandit problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget
The paper claims a posterior-sampling algorithm achieves the optimal error exponent for fixed-budget linear best feasible arm identification, but the proof has scaling and direction errors.