ML Anthology

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

Vladimir V. V'yugin
ALT 2009 pp. 38-52
doi:10.1007/978-3-642-04414-4_8 /alt/2009/vaposyugin2009alt-follow/

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.

PDF ALT Semantic Scholar

Cite

Text

V'yugin. "The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses." International Conference on Algorithmic Learning Theory, 2009. doi:10.1007/978-3-642-04414-4_8

Markdown

[V'yugin. "The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses." International Conference on Algorithmic Learning Theory, 2009.](https://mlanthology.org/alt/2009/vaposyugin2009alt-follow/) doi:10.1007/978-3-642-04414-4_8

BibTeX

@inproceedings{vaposyugin2009alt-follow,
  title     = {{The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses}},
  author    = {V'yugin, Vladimir V.},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2009},
  pages     = {38-52},
  doi       = {10.1007/978-3-642-04414-4_8},
  url       = {https://mlanthology.org/alt/2009/vaposyugin2009alt-follow/}
}