Adaptive Online Prediction by Following the Perturbed Leader

Abstract

When applying aggregating strategies to Prediction with Expert Advice, the learning rate must be adaptively tuned. The natural choice of sqrt(complexity/current loss) renders the analysis of Weighted Majority derivatives quite complicated. In particular, for arbitrary weights there have been no results proven so far. The analysis of the alternative "Follow the Perturbed Leader" (FPL) algorithm from Kalai & Vempala (2003) (based on Hannan's algorithm) is easier. We derive loss bounds for adaptive learning rate and both finite expert classes with uniform weights and countable expert classes with arbitrary weights. For the former setup, our loss bounds match the best known results so far, while for the latter our results are new.

25 pages

References in corpus (1)

• Master Algorithms for Active Experts Problems based on Increasing Loss Values

Cited by in corpus (7)

• Second-order Quantile Methods for Experts and Combinatorial Games
• Universal Learning of Repeated Matrix Games
• Defensive forecasting for optimal prediction with expert advice
• Online Learning in Case of Unbounded Losses Using the Follow Perturbed Leader Algorithm
• FPL Analysis for Adaptive Bandits
• Master Algorithms for Active Experts Problems based on Increasing Loss Values
• A New Understanding of Prediction Markets Via No-Regret Learning