2000 character limit reached
On the asymptotic optimality of the comb strategy for prediction with expert advice (1902.02368v2)
Published 6 Feb 2019 in math.PR, cs.LG, and math.OC
Abstract: For the problem of prediction with expert advice in the adversarial setting with geometric stopping, we compute the exact leading order expansion for the long time behavior of the value function. Then, we use this expansion to prove that as conjectured in Gravin et al. [12], the comb strategies are indeed asymptotically optimal for the adversary in the case of 4 experts.