Preprint
Aug 2026
The Price of Decentralization in Top-$K$ Arm Identification
Change-of-measure lower bounds show that shared-reward identification is optimal up to one universal logarithmic factor, and that the entire statistical price of removing communication is a multiplicative $\rho^2$ in sample complexity.
Larissa Xu, Jasmine Nguyen, William Chang
· 0 citations