ML Anthology

The Weak Aggregating Algorithm and Weak Mixability

Yuri Kalnishkan, Michael V. Vyugin
COLT 2005 pp. 188-203
doi:10.1007/11503415_13 /colt/2005/kalnishkan2005colt-weak/

Abstract

This paper resolves the problem of predicting as well as the best expert up to an additive term o ( n ), where n is the length of a sequence of letters from a finite alphabet. For the bounded games the paper introduces the Weak Aggregating Algorithm that allows us to obtain additive terms of the form $C{\sqrt n}$ . A modification of the Weak Aggregating Algorithm that covers unbounded games is also described.

PDF COLT Semantic Scholar

Cite

Text

Kalnishkan and Vyugin. "The Weak Aggregating Algorithm and Weak Mixability." Annual Conference on Computational Learning Theory, 2005. doi:10.1007/11503415_13

Markdown

[Kalnishkan and Vyugin. "The Weak Aggregating Algorithm and Weak Mixability." Annual Conference on Computational Learning Theory, 2005.](https://mlanthology.org/colt/2005/kalnishkan2005colt-weak/) doi:10.1007/11503415_13

BibTeX

@inproceedings{kalnishkan2005colt-weak,
  title     = {{The Weak Aggregating Algorithm and Weak Mixability}},
  author    = {Kalnishkan, Yuri and Vyugin, Michael V.},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2005},
  pages     = {188-203},
  doi       = {10.1007/11503415_13},
  url       = {https://mlanthology.org/colt/2005/kalnishkan2005colt-weak/}
}