Inference in high-dimensional graphical models
From MaRDI portal
Abstract: We provide a selected overview of methodology and theory for estimation and inference on the edge weights in high-dimensional directed and undirected Gaussian graphical models. For undirected graphical models, two main explicit constructions are provided: one based on a global method that maximizes the joint likelihood (the graphical Lasso) and one based on a local (nodewise) method that sequentially applies the Lasso to estimate the neighbourhood of each node. The proposed estimators lead to confidence intervals for edge weights and recovery of the edge structure. We evaluate their empirical performance in an extensive simulation study. The theoretical guarantees for the methods are achieved under a sparsity condition relative to the sample size and regularity conditions. For directed acyclic graphs, we apply similar ideas to construct confidence intervals for edge weights, when the directed acyclic graph is identifiable.
Cited in
(10)- Simultaneous inference for pairwise graphical models with generalized score matching
- scientific article; zbMATH DE number 7387568 (Why is no real title available?)
- Multilevel approximation of Gaussian random fields: covariance compression, estimation, and spatial prediction
- Testing Directed Acyclic Graph via Structural, Supervised and Generative Adversarial Learning
- AutoGFI: Streamlined Generalized Fiducial Inference for Modern Inference Problems in Models with Additive Errors
- When Composite Likelihood meets Stochastic Approximation
- Posterior contraction and uncertainty quantification for the multivariate spike-and-slab LASSO
- Statistical Inference for Networks of High-Dimensional Point Processes
- Precision Least Squares: Estimation and Inference in High-Dimensions
- Confidence Sets for Causal Orderings
This page was built for publication: Inference in high-dimensional graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224825)
