Exchangeability and randomness for infinite and finite sequences
Vladimir Vovk

TL;DR
This paper explores the relationship between exchangeability and randomness in sequences, highlighting their equivalence in infinite sequences but emphasizing their differences in finite sequences, which impacts statistical modeling.
Contribution
It clarifies the distinction between exchangeability and randomness for finite sequences, an area less understood compared to infinite sequences.
Findings
Exchangeability and randomness are nearly equivalent for infinite sequences.
Differences between the assumptions become significant in finite sequences.
Implications for nonparametric statistics and machine learning models.
Abstract
Randomness (in the sense of being generated in an IID fashion) and exchangeability are standard assumptions in nonparametric statistics and machine learning, and relations between them have been a popular topic of research. This short paper draws the reader's attention to the fact that, while for infinite sequences of observations the two assumptions are almost indistinguishable, the difference between them becomes very significant for finite sequences of a given length.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models · Statistical Methods and Inference · Computability, Logic, AI Algorithms
