other
fact
neutral
For the d-expert problem, the minimax alternating regret is Θ(log d), independent of the horizon T
for the $d$-expert problem, we show that the minimax alternating regret is $Θ(\log d)$, independent of the horizon $T$
Machine Learning (Statistics)29 Aug 2026