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
-
Target tracking algorithm for wireless sensor networks based on particle swarm optimization and metropolis-hasting sampling particle filter
by: Peng JIANG, et al.
Published: (2013-11-01) -
Metropolis-Hastings (MH): Una Perspectiva Innovadora en la Inicialización de Poblaciones
by: Oscar Francisco Barba Toscano, et al.
Published: (2024-06-01) -
Limiting Spectral Distribution of Large-Dimensional Sample Covariance Matrices Generated by the Periodic Autoregressive Model
by: Jin Zou, et al.
Published: (2021-01-01) -
Application of regularized covariance matrices in logistic regression and portfolio optimization
by: Fang Sun, et al.
Published: (2025-07-01) -
Estimation of Fuzzy Measures Using Covariance Matrices in Gaussian Mixtures
by: Nishchal K. Verma
Published: (2012-01-01)