MCMC Algorithms for Posteriors on Matrix Spaces
MCMC Algorithms for Posteriors on Matrix Spaces
复制标题
矩阵空间上后验的 MCMC 算法
DOI:
10.1080/10618600.2022.2058953
复制
发表时间:
2022
影响因子:
2.4
通讯作者:
Kamatani Kengo
中科院分区:
文献类型:
--
作者:
Beskos Alexandros;Kamatani Kengo
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 shownnotto 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.
登录
查看更多内容
影响因子:
0.5
作者:
Daniel Rudolf;Mario Ullrich
通讯作者:
Daniel Rudolf;Mario Ullrich
影响因子:
0.5
作者:
A. Kulik;M. Scheutzow
通讯作者:
M. Scheutzow
影响因子:
1
作者:
G. Roberts;R. Tweedie
通讯作者:
G. Roberts;R. Tweedie
DOI:
--
发表时间:
1967
期刊:
影响因子:
--
作者:
J. Dickey
通讯作者:
J. Dickey
DOI:
10.1198/016214508000000724
发表时间:
2008-12-01
影响因子:
3.7
作者:
O'Malley, A. James;Zaslavsky, Alan M.
通讯作者:
Zaslavsky, Alan M.