Algorithmic Randomness, Effective Disintegrations, and Rates of Convergence to the Truth
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917681601445888 |
|---|---|
| author | Huttegger, Simon M. Walsh, Sean Blando, Francesca Zaffora |
| author_facet | Huttegger, Simon M. Walsh, Sean Blando, Francesca Zaffora |
| contents | Lévy's Upward Theorem says that the conditional expectation of an integrable random variable converges with probability one to its true value with increasing information. In this paper, we use methods from effective probability theory to characterise the probability one set along which convergence to the truth occurs, and the rate at which the convergence occurs. We work within the setting of computable probability measures defined on computable Polish spaces and introduce a new general theory of effective disintegrations. We use this machinery to prove our main results, which (1) identify the points along which certain classes of effective random variables converge to the truth in terms of certain classes of algorithmically random points, and which further (2) identify when computable rates of convergence exist. Our convergence results significantly generalize earlier results within a unifying novel abstract framework, and there are no precursors of our results on computable rates of convergence. Finally, we make a case for the importance of our work for the foundations of Bayesian probability theory. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_19978 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Algorithmic Randomness, Effective Disintegrations, and Rates of Convergence to the Truth Huttegger, Simon M. Walsh, Sean Blando, Francesca Zaffora Logic Probability 03D32, 03A10, 03D78, 03F60, 60A10, 60B05, 60G48 Lévy's Upward Theorem says that the conditional expectation of an integrable random variable converges with probability one to its true value with increasing information. In this paper, we use methods from effective probability theory to characterise the probability one set along which convergence to the truth occurs, and the rate at which the convergence occurs. We work within the setting of computable probability measures defined on computable Polish spaces and introduce a new general theory of effective disintegrations. We use this machinery to prove our main results, which (1) identify the points along which certain classes of effective random variables converge to the truth in terms of certain classes of algorithmically random points, and which further (2) identify when computable rates of convergence exist. Our convergence results significantly generalize earlier results within a unifying novel abstract framework, and there are no precursors of our results on computable rates of convergence. Finally, we make a case for the importance of our work for the foundations of Bayesian probability theory. |
| title | Algorithmic Randomness, Effective Disintegrations, and Rates of Convergence to the Truth |
| topic | Logic Probability 03D32, 03A10, 03D78, 03F60, 60A10, 60B05, 60G48 |
| url | https://arxiv.org/abs/2403.19978 |