281
Views
0
CrossRef citations to date
0
Altmetric
Bayesian Computation

MCMC Algorithms for Posteriors on Matrix Spaces

ORCID Icon & ORCID Icon
Pages 721-738 | Received 06 Aug 2020, Accepted 17 Mar 2022, Published online: 10 May 2022
 

Abstract

We study Markov chain Monte Carlo (MCMC) algorithms for target distributions defined on matrix spaces. Such an important sampling problem has yet to be analytically explored. We carry out a major step in covering this gap by developing the proper theoretical framework that allows for the identification of ergodicity properties of typical MCMC algorithms, relevant in such a context. Beyond the standard Random-Walk Metropolis (RWM) and preconditioned Crank–Nicolson (pCN), a contribution of this article in the development of a novel algorithm, termed the “Mixed” pCN (MpCN). RWM and pCN are shown not to be geometrically ergodic for an important class of matrix distributions with heavy tails. In contrast, MpCN is robust across targets with different tail behavior and has very good empirical performance within the class of heavy-tailed distributions. Geometric ergodicity for MpCN is not fully proven in this work, as some remaining drift conditions are quite challenging to obtain owing to the complexity of the state space. We do, however, make a lot of progress toward a proof, and show in detail the last steps left for future work. We illustrate the computational performance of the various algorithms through numerical applications, including calibration on real data of a challenging model arising in financial statistics. Supplementary materials for this article are available online.

Supplementary Materials

R and C code for the analysis in Section 6 (code.zip).

Acknowledgments

We thank an anonymous referee and the Associate Editor for suggestions that have greatly improved the contents of this article.

Additional information

Funding

Alexandros Beskos acknowledges support from a Leverhulme Trust Prize grant number PLP-2014-263. Kengo Kamatani acknowledges support from JSPS KAKENHI grant numbers 16K00046, 20H04149 and JST CREST grant number JPMJCR14D7.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.