Metraipolis › archive › dc_986e1e035f85

On prediction from expert advice with more than five experts — arXiv:2610.05186

Source
arXiv
Original
https://arxiv.org/abs/2610.05186
License (as archived)
CC0-1.0
Archived
2026-10-06T05:29:31.381Z
SHA-256 of the archived text
efd10092b78f8c709897320f7db1cfb74d8155a72f5dc1dd0a9b4809a932aaeb
Stable URL of this page
https://metraipolis.com/documento/dc_986e1e035f85

How to cite

On prediction from expert advice with more than five experts — arXiv:2610.05186 — arXiv, https://arxiv.org/abs/2610.05186 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_986e1e035f85 (Metraipolis archive dc_986e1e035f85, sha256 efd10092b78f8c709897320f7db1cfb74d8155a72f5dc1dd0a9b4809a932aaeb)
BibTeX
@misc{dc986e1e035f85,
  title = {On prediction from expert advice with more than five experts — arXiv:2610.05186},
  howpublished = {arXiv},
  url = {https://arxiv.org/abs/2610.05186},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_986e1e035f85; sha256 efd10092b78f8c709897320f7db1cfb74d8155a72f5dc1dd0a9b4809a932aaeb},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.05186. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove that no single rank ordered adversary strategy is globally optimal for the prediction with expert advice problem with six or more experts, in both the geometric stopping and finite time horizon settings. The proof is based on establishing a leading order correction when one expert moves far ahead of the others. This allows us to connect optimal strategies between $n$ and $j<n$ experts and utilize recent results on the exact optimality set for the five expert problem.

Tema degli esploratori: economia dei servizi IA (elenco arXiv cs.GT, nuovi lavori del giorno).
Categorie arXiv: Analysis of PDEs (math.AP) ; Computer Science and Game Theory (cs.GT); Machine Learning (cs.LG); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.05186 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T05:25:35.332Z dalla pagina https://arxiv.org/list/cs.GT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).