Unbiased Markov chain quasi-Monte Carlo for Gibbs samplers
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910681015517184 |
|---|---|
| author | Du, Jiarui He, Zhijian |
| author_facet | Du, Jiarui He, Zhijian |
| contents | In statistical analysis, Monte Carlo (MC) stands as a classical numerical integration method. When encountering challenging sample problem, Markov chain Monte Carlo (MCMC) is a commonly employed method. However, the MCMC estimator is biased after a fixed number of iterations. Unbiased MCMC, an advancement achieved through coupling techniques, addresses this bias issue in MCMC. It allows us to run many short chains in parallel. Quasi-Monte Carlo (QMC), known for its high order of convergence, is an alternative of MC. By incorporating the idea of QMC into MCMC, Markov chain quasi-Monte Carlo (MCQMC) effectively reduces the variance of MCMC, especially in Gibbs samplers. This work presents a novel approach that integrates unbiased MCMC with MCQMC, called as an unbiased MCQMC method. This method renders unbiased estimators while improving the rate of convergence significantly. Numerical experiments demonstrate that for Gibbs sampling, unbiased MCQMC with a sample size of $N$ yields a faster root mean square error (RMSE) rate than the \(O(N^{-1/2})\) rate of unbiased MCMC, toward an RMSE rate of \(O(N^{-1})\) for low-dimensional problems. Surprisingly, in a challenging problem of 1049-dimensional Pólya Gamma Gibbs sampler, the RMSE can still be reduced by several times for moderate sample sizes. In the setting of parallelization, unbiased MCQMC also performs better than unbiased MCMC, even running with short chains. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_04407 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Unbiased Markov chain quasi-Monte Carlo for Gibbs samplers Du, Jiarui He, Zhijian Numerical Analysis In statistical analysis, Monte Carlo (MC) stands as a classical numerical integration method. When encountering challenging sample problem, Markov chain Monte Carlo (MCMC) is a commonly employed method. However, the MCMC estimator is biased after a fixed number of iterations. Unbiased MCMC, an advancement achieved through coupling techniques, addresses this bias issue in MCMC. It allows us to run many short chains in parallel. Quasi-Monte Carlo (QMC), known for its high order of convergence, is an alternative of MC. By incorporating the idea of QMC into MCMC, Markov chain quasi-Monte Carlo (MCQMC) effectively reduces the variance of MCMC, especially in Gibbs samplers. This work presents a novel approach that integrates unbiased MCMC with MCQMC, called as an unbiased MCQMC method. This method renders unbiased estimators while improving the rate of convergence significantly. Numerical experiments demonstrate that for Gibbs sampling, unbiased MCQMC with a sample size of $N$ yields a faster root mean square error (RMSE) rate than the \(O(N^{-1/2})\) rate of unbiased MCMC, toward an RMSE rate of \(O(N^{-1})\) for low-dimensional problems. Surprisingly, in a challenging problem of 1049-dimensional Pólya Gamma Gibbs sampler, the RMSE can still be reduced by several times for moderate sample sizes. In the setting of parallelization, unbiased MCQMC also performs better than unbiased MCMC, even running with short chains. |
| title | Unbiased Markov chain quasi-Monte Carlo for Gibbs samplers |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2403.04407 |