Contraction of Markovian Operators in Orlicz Spaces and Error Bounds for Markov Chain Monte Carlo
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908667717091328 |
|---|---|
| author | Esposito, Amedeo Roberto Mondelli, Marco |
| author_facet | Esposito, Amedeo Roberto Mondelli, Marco |
| contents | We introduce a novel concept of convergence for Markovian processes within Orlicz spaces, extending beyond the conventional approach associated with $L_p$ spaces. After showing that Markovian operators are contractive in Orlicz spaces, our key technical contribution is an upper bound on their contraction coefficient, which admits a closed-form expression. The bound is tight in some settings, and it recovers well-known results, such as the connection between contraction and ergodicity, ultra-mixing and Doeblin's minorisation. Specialising our approach to $L_p$ spaces leads to a significant improvement upon classical Riesz-Thorin's interpolation methods.
Furthermore, by exploiting the flexibility offered by Orlicz spaces, we can tackle settings where the stationary distribution is heavy-tailed, a severely under-studied setup. The technical tools introduced lend themselves to providing novel bounds on the contraction coefficient (SDPI constant) of information-theoretic divergences. We thus provide a variety of examples in which we show an improvement over the state of the art. As an application of the framework put forward in the paper, we introduce tighter bounds on the mixing time of Markovian processes, better exponential concentration bounds for MCMC methods, and better lower bounds on the burn-in period. To conclude, we show how our results can be used to prove the concentration of measure phenomenon for a sequence of Markovian random variables. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_11200 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Contraction of Markovian Operators in Orlicz Spaces and Error Bounds for Markov Chain Monte Carlo Esposito, Amedeo Roberto Mondelli, Marco Information Theory Functional Analysis Probability We introduce a novel concept of convergence for Markovian processes within Orlicz spaces, extending beyond the conventional approach associated with $L_p$ spaces. After showing that Markovian operators are contractive in Orlicz spaces, our key technical contribution is an upper bound on their contraction coefficient, which admits a closed-form expression. The bound is tight in some settings, and it recovers well-known results, such as the connection between contraction and ergodicity, ultra-mixing and Doeblin's minorisation. Specialising our approach to $L_p$ spaces leads to a significant improvement upon classical Riesz-Thorin's interpolation methods. Furthermore, by exploiting the flexibility offered by Orlicz spaces, we can tackle settings where the stationary distribution is heavy-tailed, a severely under-studied setup. The technical tools introduced lend themselves to providing novel bounds on the contraction coefficient (SDPI constant) of information-theoretic divergences. We thus provide a variety of examples in which we show an improvement over the state of the art. As an application of the framework put forward in the paper, we introduce tighter bounds on the mixing time of Markovian processes, better exponential concentration bounds for MCMC methods, and better lower bounds on the burn-in period. To conclude, we show how our results can be used to prove the concentration of measure phenomenon for a sequence of Markovian random variables. |
| title | Contraction of Markovian Operators in Orlicz Spaces and Error Bounds for Markov Chain Monte Carlo |
| topic | Information Theory Functional Analysis Probability |
| url | https://arxiv.org/abs/2402.11200 |