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.
No takes yet. Share an insight, caveat, or question.
Yuri Kalnishkan (2026) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: