2000 character limit reached
Experimental Evidence for Asymptotic Non-Optimality of Comb Adversary Strategy
Published 3 Dec 2019 in cs.GT and cs.LG | (1912.01548v1)
Abstract: For the problem of prediction with expert advice in the adversarial setting with finite stopping time, we give strong computer evidence that the comb strategy for $k=5$ experts is not asymptotically optimal, thereby giving strong evidence against a conjecture of Gravin, Peres, and Sivan.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.