Saved in:
Bibliographic Details
Main Authors: Kuo, Kun-Lin, Wang, Yuchung J.
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2410.09559
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914970551189504
author Kuo, Kun-Lin
Wang, Yuchung J.
author_facet Kuo, Kun-Lin
Wang, Yuchung J.
contents The Gibbs sampler (GS) is a crucial algorithm for approximating complex calculations, and it is justified by Markov chain theory, the alternating projection theorem, and $I$-projection, separately. We explore the equivalence between these three operators. Partially collapsed Gibbs sampler (PCGS) and pseudo-Gibbs sampler (PGS) are two generalizations of GS. For PCGS, the associated Markov chain is heterogeneous with varying state spaces, and we propose the iterative conditional replacement algorithm (ICR) to prove its convergence. In addition, ICR can approximate the multiple stationary distributions modeled by a PGS. Our approach highlights the benefit of using one operator for one conditional distribution, rather than lumping all the conditionals into one operator. Because no Markov chain theory is required, this approach simplifies the understanding of convergence.
format Preprint
id arxiv_https___arxiv_org_abs_2410_09559
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle The Gibbs sampler revisited from the perspective of conditional modeling
Kuo, Kun-Lin
Wang, Yuchung J.
Computation
The Gibbs sampler (GS) is a crucial algorithm for approximating complex calculations, and it is justified by Markov chain theory, the alternating projection theorem, and $I$-projection, separately. We explore the equivalence between these three operators. Partially collapsed Gibbs sampler (PCGS) and pseudo-Gibbs sampler (PGS) are two generalizations of GS. For PCGS, the associated Markov chain is heterogeneous with varying state spaces, and we propose the iterative conditional replacement algorithm (ICR) to prove its convergence. In addition, ICR can approximate the multiple stationary distributions modeled by a PGS. Our approach highlights the benefit of using one operator for one conditional distribution, rather than lumping all the conditionals into one operator. Because no Markov chain theory is required, this approach simplifies the understanding of convergence.
title The Gibbs sampler revisited from the perspective of conditional modeling
topic Computation
url https://arxiv.org/abs/2410.09559