Innovated scalable efficient estimation in ultra-large Gaussian graphical models
From MaRDI portal
Abstract: Large-scale precision matrix estimation is of fundamental importance yet challenging in many contemporary applications for recovering Gaussian graphical models. In this paper, we suggest a new approach of innovated scalable efficient estimation (ISEE) for estimating large precision matrix. Motivated by the innovated transformation, we convert the original problem into that of large covariance matrix estimation. The suggested method combines the strengths of recent advances in high-dimensional sparse modeling and large covariance matrix estimation. Compared to existing approaches, our method is scalable and can deal with much larger precision matrices with simple tuning. Under mild regularity conditions, we establish that this procedure can recover the underlying graphical structure with significant probability and provide efficient estimation of link strengths. Both computational and theoretical advantages of the procedure are evidenced through simulation and real data examples.
Recommendations
- Innovated scalable efficient inference for ultra-large graphical models
- Quasi-Bayesian estimation of large Gaussian graphical models
- Asymptotic normality and optimalities in estimation of large Gaussian graphical models
- Innovated scalable dynamic learning for time-varying graphical models
- Bayesian estimation of large precision matrix based on Cholesky decomposition
Cited in
(30)- Tuning-free heterogeneous inference in massive networks
- Asymptotic normality and optimalities in estimation of large Gaussian graphical models
- Halfspace depths for scatter, concentration and shape matrices
- Reproducible learning in large-scale graphical models
- Uniform joint screening for ultra-high dimensional graphical models
- Innovated scalable dynamic learning for time-varying graphical models
- Innovated scalable efficient inference for ultra-large graphical models
- Ultrahigh dimensional precision matrix estimation via refitted cross validation
- Spectral analysis of high-dimensional time series
- Blessing of massive scale: spatial graphical model estimation with a total cardinality constraint approach
- RANK: Large-Scale Inference With Graphical Nonlinear Knockoffs
- Scalable inference for high-dimensional precision matrix
- L0-Regularized Learning for High-Dimensional Additive Hazards Regression
- TIGER: A tuning-insensitive approach for optimally estimating Gaussian graphical models
- Precision Matrix Estimation by Inverse Principal Orthogonal Decomposition
- Estimation of high-dimensional dynamic conditional precision matrices with an application to forecast combination
- High-dimensional rank-based graphical models for non-Gaussian functional data
- Cellwise outlier detection with false discovery rate control
- Nonparametric Functional Graphical Modeling Through Functional Additive Regression Operator
- Frequentist Model Averaging for Undirected Gaussian Graphical Models
- Communication-efficient estimation for distributed subset selection
- Large-Scale Two-Sample Comparison of Support Sets
- Ah-knockoff: false discovery rate control in high-dimensional additive hazards models
- High-dimensional graphical inference via partially penalised regression
- ARK: robust knockoffs inference with coupling
- Scalable network estimation with L₀ penalty
- QDA classification of high-dimensional data with rare and weak signals
- CARE: Large Precision Matrix Estimation for Compositional Data
- SOFARI: High-Dimensional Manifold-Based Inference
- Uniform knockoff filter for high-dimensional controlled graph recovery
This page was built for publication: Innovated scalable efficient estimation in ultra-large Gaussian graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342674)
