A new hierarchical distribution on arbitrary sparse precision matrices
By: Gianluca Mastrantonio, Pierfrancesco Alaimo Di Loro, Marco Mingione
Potential Business Impact:
Helps computers find hidden patterns in data.
We introduce a general strategy for defining distributions over the space of sparse symmetric positive definite matrices. Our method utilizes the Cholesky factorization of the precision matrix, imposing sparsity through constraints on its elements while preserving their independence and avoiding the numerical evaluation of normalization constants. In particular, we develop the S-Bartlett as a modified Bartlett decomposition, recovering the standard Wishart as a particular case. By incorporating a Spike-and-Slab prior to model graph sparsity, our approach facilitates Bayesian estimation through a tailored MCMC routine based on a Dual Averaging Hamiltonian Monte Carlo update. This framework extends naturally to the Generalized Linear Model setting, enabling applications to non-Gaussian outcomes via latent Gaussian variables. We test and compare the proposed S-Bartelett prior with the G-Wishart both on simulated and real data. Results highlight that the S-Bartlett prior offers a flexible alternative for estimating sparse precision matrices, with potential applications across diverse fields.
Similar Papers
Sparsifying transform priors in Gaussian graphical models
Methodology
Finds hidden connections in complex data faster.
Scalable Bayesian inference on high-dimensional multivariate linear regression
Methodology
Finds hidden patterns in complex data.
Robust Sparse Precision Matrix Estimation and its Application
Methodology
Finds hidden patterns in messy data better.