arbiter
JournalsAccount

Weak Aggregating Algorithm for prediction with expert advice and adversarial bandit frameworks

Yuri Kalnishkan

Information and Computation2026https://doi.org/10.1016/j.ic.2026.105447article
ABDC B
Weight
0.50

Abstract

This paper surveys the Weak Aggregating Algorithm for prediction with expert advice under bounded convex loss functions. It shows how bounds for various scenarios can be obtained and explicates the connection with the adversarial bandit framework. The paper is aimed at practitioners wishing to apply the algorithms in real-life situations.

Open via your library →

Cite this paper

https://doi.org/https://doi.org/10.1016/j.ic.2026.105447

Or copy a formatted citation

@article{yuri2026,
  title        = {{Weak Aggregating Algorithm for prediction with expert advice and adversarial bandit frameworks}},
  author       = {Yuri Kalnishkan},
  journal      = {Information and Computation},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1016/j.ic.2026.105447},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Weak Aggregating Algorithm for prediction with expert advice and adversarial bandit frameworks

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.