The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses

  • Vladimir V. V’yugin
Conference paper

DOI: 10.1007/978-3-642-04414-4_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5809)
Cite this paper as:
V’yugin V.V. (2009) The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses. In: Gavaldà R., Lugosi G., Zeugmann T., Zilles S. (eds) Algorithmic Learning Theory. ALT 2009. Lecture Notes in Computer Science, vol 5809. Springer, Berlin, Heidelberg

Abstract

In this paper the sequential prediction problem with expert advice is considered for the case when the losses of experts suffered at each step can be unbounded. We present some modification of Kalai and Vempala algorithm of following the perturbed leader where weights depend on past losses of the experts. New notions of a volume and a scaled fluctuation of a game are introduced. We present an algorithm protected from unrestrictedly large one-step losses. This algorithm has the optimal performance in the case when the scaled fluctuations of one-step losses of experts of the pool tend to zero.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Vladimir V. V’yugin
    • 1
  1. 1.Institute for Information Transmission ProblemsRussian Academy of SciencesMoscow GSP-4Russia

Personalised recommendations