Unconstrained Metropolis–Hastings Sampling of Covariance Matrices
Markov chain Monte Carlo (MCMC), the predominant algorithm for fitting hierarchal models to data in a Bayesian setting, relies on the ability to sample from the full conditional distributions of unobserved parameters. Covariance or precision matrices offer a unique sampling challenge due to the cons...
Saved in:
Main Author: | Daniel Turek |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2025-01-01
|
Series: | Journal of Probability and Statistics |
Online Access: | http://dx.doi.org/10.1155/jpas/4744162 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Metropolis-Hastings (MH): Una Perspectiva Innovadora en la Inicialización de Poblaciones
by: Oscar Francisco Barba Toscano, et al.
Published: (2024-06-01) -
A Novel Robust Test to Compare Covariance Matrices in High-Dimensional Data
by: Hasan Bulut
Published: (2025-05-01) -
Improved Test for High-Dimensional Mean Vectors and Covariance Matrices Using Random Projection
by: Tung-Lung Wu
Published: (2025-06-01) -
An introduction to unconstrained optimisation /
by: McKeown, J. J.
Published: (1990) -
“The stars move still”: Haste and Delay in Marlowe’s Doctor Faustus
by: Tyler Dunston
Published: (2025-06-01)