Extended Bayesian Information Criteria for Gaussian Graphical Models

Abstract

Gaussian graphical models with sparsity in the inverse covariance matrix are of significant interest in many modern applications. For the problem of recovering the graphical structure, information criteria provide useful optimization objectives for algorithms searching through sets of graphs or for selection of tuning parameters of other methods such as the graphical lasso, which is a likelihood penalization technique. In this paper we establish the consistency of an extended Bayesian information criterion for Gaussian graphical models in a scenario where both the number of variables p and the sample size n grow. Compared to earlier work on the regression case, our treatment allows for growth in the number of non-zero parameters in the true model, which is necessary in order to cover connected graphs. We demonstrate the performance of this criterion on simulated data when used in conjunction with the graphical lasso, and verify that the criterion indeed performs better than either cross-validation or the ordinary Bayesian information criterion when p and the number of non-zero parameters q both scale with n.

Cited by in corpus (44)

• A Tutorial on Regularized Partial Correlation Networks
• Exploratory graph analysis: a new approach for estimating the number of dimensions in psychological research
• The huge Package for High-dimensional Undirected Graph Estimation in R
• Estimating psychopathological networks: be careful what you wish for
• Estimating Psychological Networks and their Accuracy: A Tutorial Paper
• Bayesian Structure Learning in Sparse Gaussian Graphical Models
• BDgraph: An R Package for Bayesian Structure Learning in Graphical Models
• Time-evolving controllability of effective connectivity networks during seizure progression
• High-Dimensional Gaussian Graphical Model Selection: Walk Summability and Local Separation Criterion
• mgm: Estimating Time-Varying Mixed Graphical Models in High-Dimensional Data
• L0 Sparse Inverse Covariance Estimation
• Variational inference for sparse network reconstruction from count data
• Introduction to correlation networks: Interdisciplinary approaches beyond thresholding
• Learning Gaussian Graphical Models With Fractional Marginal Pseudo-likelihood
• Causal Inference Under Interference And Network Uncertainty
• KoPA: Automated Kronecker Product Approximation
• Estimating Differential Latent Variable Graphical Models with Applications to Brain Connectivity
• An information-theoretic approach to hypergraph psychometrics
• The Reduced PC-Algorithm: Improved Causal Structure Learning in Large Random Networks
• Bayesian Inference in Nonparanormal Graphical Models
• High-dimensional variable selection via low-dimensional adaptive learning
• Online Structural Change-point Detection of High-dimensional Streaming Data via Dynamic Sparse Subspace Learning
• Joint Estimation and Inference for Data Integration Problems based on Multiple Multi-layered Gaussian Graphical Models
• PANDA: AdaPtive Noisy Data Augmentation for Regularization of Undirected Graphical Models
• Structure Learning for Cyclic Linear Causal Models
• Markov Network Structure Learning via Ensemble-of-Forests Models
• Thresholded Graphical Lasso Adjusts for Latent Variables: Application to Functional Neural Connectivity
• Graph Coding for Model Selection and Anomaly Detection in Gaussian Graphical Models
• Partial Correlation Graphical LASSO
• Predictive Learning on Hidden Tree-Structured Ising Models
• Causal Structural Learning Via Local Graphs
• Quantile mixed graphical models with an application to mass public shootings in the United States
• Regression-Based Bayesian Estimation and Structure Learning for Nonparanormal Graphical Models
• Local Whittle estimation of high-dimensional long-run variance and precision matrices
• Family-wise error rate control in Gaussian graphical model selection via Distributionally Robust Optimization
• AdaPtive Noisy Data Augmentation (PANDA) for Simultaneous Construction of Multiple Graph Models
• ESCT3D: Efficient and Selectively Controllable Text-Driven 3D Content Generation with Gaussian Splatting
• Learning Bayesian Networks through Birkhoff Polytope: A Relaxation Method
• Graph Compression with Application to Model Selection
• Fully integrative data analysis of NMR metabolic fingerprints with comprehensive patient data: a case report based on the German Chronic Kidney Disease (GCKD) study
• Relevance Vector Machine with Weakly Informative Hyperprior and Extended Predictive Information Criterion
• Fast and Accurate Graph Learning for Huge Data via Minipatch Ensembles
• Learning from Forecast Errors: A New Approach to Forecast Combinations
• Disjunct Support Spike and Slab Priors for Variable Selection in Regression under Quasi-sparseness