Experimental Evidence for Asymptotic Non-Optimality of Comb Adversary Strategy
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Dec 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 0; 2026: 2.
4 papers.
- 2022Efficient and Optimal Fixed-Time Regret with Two Expertscited by 5
- 2024Numerical solution of a PDE arising from prediction with expert advicecited by 2
- 2026An explicit solution of the five-expert prediction PDE and the exact optimality set of COMBcited by 1
- 2026Prediction with Expert Advice: Anytime Regret with Many Experts Matches the Fixed-Time Constantcited by 1
- 2026Prediction with Expert Advice: Anytime Regret with Many Experts Matches the Fixed-Time Constant23 Sep 2026
- 2026An explicit solution of the five-expert prediction PDE and the exact optimality set of COMB14 Sep 2026
- 2024Numerical solution of a PDE arising from prediction with expert advice9 Jun 2024
- 2022Efficient and Optimal Fixed-Time Regret with Two Experts15 Mar 2022