no code implementations • 13 Jun 2023 • Shaoang Li, Lan Zhang, Junhao Wang, Xiang-Yang Li
We establish the tight worst-case regret lower bound of $\Omega \left( (TB)^{\alpha} K^{1-\alpha}\right), \alpha = 2^{B} / (2^{B+1}-1)$ for any algorithm with a time horizon $T$, number of arms $K$, and number of passes $B$.
