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

Read full text Summarise with VIRAT
Authors: Yuri Kalnishkan
Cited by: 0
References: 17

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

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.

Fields of Study & Subjects

Advanced Bandit Algorithms Research Optimization and Search Problems Machine Learning and Algorithms

Publication details

Journal / source
Information and Computation
Volume
310
Pages
105447–105447
Publication date
28 March 2026
Language
EN