ML Anthology

Prequential Randomness

Vladimir Vovk, Alexander Shen
ALT 2008 pp. 154-168
doi:10.1007/978-3-540-87987-9_16 /alt/2008/vovk2008alt-prequential/

Abstract

This paper studies Dawid’s prequential framework from the point of view of the algorithmic theory of randomness. The main result is that two natural notions of randomness coincide. One notion is the prequential version of the measure-theoretic definition due to Martin-Löf, and the other is the prequential version of the game-theoretic definition due to Schnorr and Levin. This is another manifestation of the close relation between the two main paradigms of randomness.

PDF ALT Semantic Scholar

Cite

Text

Vovk and Shen. "Prequential Randomness." International Conference on Algorithmic Learning Theory, 2008. doi:10.1007/978-3-540-87987-9_16

Markdown

[Vovk and Shen. "Prequential Randomness." International Conference on Algorithmic Learning Theory, 2008.](https://mlanthology.org/alt/2008/vovk2008alt-prequential/) doi:10.1007/978-3-540-87987-9_16

BibTeX

@inproceedings{vovk2008alt-prequential,
  title     = {{Prequential Randomness}},
  author    = {Vovk, Vladimir and Shen, Alexander},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2008},
  pages     = {154-168},
  doi       = {10.1007/978-3-540-87987-9_16},
  url       = {https://mlanthology.org/alt/2008/vovk2008alt-prequential/}
}