Li 2019 - Graphical Horseshoe Estimator - Overview

Summary

Li, Craig and Bhadra (2019) place horseshoe priors on the off-diagonal entries of a Gaussian precision matrix (diagonal flat, positive definite) and give a full block Gibbs sampler. Theory: a smaller Kullback-Leibler risk upper bound than priors with bounded density at zero when is sparse (Thm 3.2), and a posterior mean within of least squares for large entries, unlike the Bayesian graphical lasso (Thm 4.1). Simulations (, ) show the smallest Stein loss and Frobenius error in most settings, with low false-positive rates.

Overview

Question. Estimate a sparse precision matrix (Gaussian graphical model, GGM) in high dimension with small error in non-zero entries and good adaptation to sparsity.

Contribution. Prior, sampler, KL-risk and bias theory, simulation comparison to graphical lasso (GL), graphical SCAD (GSCAD) and Bayesian graphical lasso (BGL), human gene expression network (CEU, 100 genes, 60 people).

Motivating PyMC examples

https://redam94.github.io/pymc-challenges/examples.html: E19 - Learning a graph: Bayesian Gaussian graphical models (Sachs et al. 2005 flow cytometry, 11 phosphoproteins; marginal vs partial correlation, LKJCholeskyCov, “why a horseshoe on the precision matrix leaves the positive-definite cone”, Bayesian neighbourhood selection with a node-wise horseshoe, AND/OR rules). See also Bayesian Gaussian Graphical Models - G-Wishart and Neighbourhood Selection.

Source Map

Examples

Working Gibbs-sampler code and a small check: Li 2019 - Graphical Horseshoe Model and Gibbs Sampler.

Connections

See Also

Li 2019 - Graphical Horseshoe Estimator