Network exploration via the adaptive LASSO and SCAD penalties
From MaRDI portal
Publication:2270657
Abstract: Graphical models are frequently used to explore networks, such as genetic networks, among a set of variables. This is usually carried out via exploring the sparsity of the precision matrix of the variables under consideration. Penalized likelihood methods are often used in such explorations. Yet, positive-definiteness constraints of precision matrices make the optimization problem challenging. We introduce nonconcave penalties and the adaptive LASSO penalty to attenuate the bias problem in the network estimation. Through the local linear approximation to the nonconcave penalty functions, the problem of precision matrix estimation is recast as a sequence of penalized likelihood problems with a weighted penalty and solved using the efficient algorithm of Friedman et al. [Biostatistics 9 (2008) 432--441]. Our estimation schemes are applied to two real datasets. Simulation experiments and asymptotic theory are used to justify our proposed methods.
Recommendations
- Sparse inverse covariance estimation with the graphical lasso
- Model selection and estimation in the Gaussian graphical model
- On regularized estimation methods for precision and covariance matrix and statistical network inference
- High-dimensional graphs and variable selection with the Lasso
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
Cites work
- scientific article; zbMATH DE number 3954071 (Why is no real title available?)
- scientific article; zbMATH DE number 3673370 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Analysis of call centre arrival data using singular value decomposition
- Bioinformatics. The machine learning approach.
- Covariance matrix selection and estimation via penalised normal likelihood
- Determinant Maximization with Linear Matrix Inequality Constraints
- Efficient estimation of covariance selection models
- First-Order Methods for Sparse Covariance Selection
- Gradient directed regularization for sparse Gaussian concentration graphs, with applications to inference of genetic networks
- Heuristics of instability and stabilization in model selection
- High-dimensional classification using features annealed independence rules
- High-dimensional graphs and variable selection with the Lasso
- Introduction to Graphical Modelling
- Least angle regression. (With discussion)
- Model selection and estimation in the Gaussian graphical model
- Model selection for Gaussian concentration graphs
- Nonconcave penalized likelihood with a diverging number of parameters.
- Rejoinder: One-step sparse estimates in nonconcave penalized likelihood models
- Sparse estimation of large covariance matrices via a nested Lasso penalty
- Sparse graphical models for exploring gene expression data
- Sparse inverse covariance estimation with the graphical lasso
- Sparse permutation invariant covariance estimation
- Sparsistency and rates of convergence in large covariance matrix estimation
- The Adaptive Lasso and Its Oracle Properties
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variable selection using MM algorithms
Cited in
(only showing first 100 items - show all)- Confidence graphs for graphical model selection
- A Gaussian graphical model approach to climate networks
- A sparse conditional Gaussian graphical model for analysis of genetical genomics data
- Nonconcave penalized estimation in sparse vector autoregression model
- Group-wise shrinkage estimation in penalized model-based clustering
- D-trace estimation of a precision matrix with eigenvalue control
- Model selection with distributed SCAD penalty
- The sparse Laplacian shrinkage estimator for high-dimensional regression
- Post-regularization inference for time-varying nonparanormal graphical models
- Bayesian Structure Learning in Undirected Gaussian Graphical Models: Literature Review with Empirical Comparison
- D-trace estimation of a precision matrix using adaptive lasso penalties
- A Bayesian graphical approach for large-scale portfolio management with fewer historical data
- Joint Estimation of the Two-Level Gaussian Graphical Models Across Multiple Classes
- On High-Dimensional Constrained Maximum Likelihood Inference
- Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent
- Sparse Matrix Graphical Models
- Dynamic and robust Bayesian graphical models
- Statistical analysis of sparse approximate factor models
- A Normality Test for High-dimensional Data Based on the Nearest Neighbor Approach
- Scalable and efficient inference via CPE
- Locally associated graphical models and mixed convex exponential families
- The performance of covariance selection methods that consider decomposable models only
- Innovated scalable dynamic learning for time-varying graphical models
- Uniform joint screening for ultra-high dimensional graphical models
- Covariance regularization by thresholding
- Sparse graphical models via calibrated concave convex procedure with application to fMRI data
- Assessment of Covariance Selection Methods in High-Dimensional Gaussian Graphical Models
- Bayesian estimation of large precision matrix based on Cholesky decomposition
- Sparsistency and rates of convergence in large covariance matrix estimation
- Network-based penalized regression with application to genomic data
- Bayesian analysis of nonparanormal graphical models using rank-likelihood
- Comparing dependent undirected Gaussian networks
- Rates of convergence of the adaptive elastic net and the post-selection procedure in ultra-high dimensional sparse models
- Precision matrix estimation under data contamination with an application to minimum variance portfolio selection
- Sparse functional linear models via calibrated concave-convex procedure
- The Graphical Horseshoe Estimator for Inverse Covariance Matrices
- Conditional score matching for high-dimensional partial graphical models
- ROCKET: robust confidence intervals via Kendall's tau for transelliptical graphical models
- Estimating networks with jumps
- Adjusting for high-dimensional covariates in sparse precision matrix estimation by \(\ell_1\)-penalization
- Estimating time-varying networks
- Change-point detection in high-dimensional covariance structure
- High-Dimensional Gaussian Graphical Regression Models with Covariates
- Spectral clustering via sparse graph structure learning with application to proteomic signaling networks in cancer
- A focused information criterion for graphical models in fMRI connectivity with high-dimensional data
- Shrinkage tuning parameter selection in precision matrices estimation
- Joint Mean and Covariance Estimation with Unreplicated Matrix-Variate Data
- Covariance estimation: the GLM and regularization perspectives
- Nonparametric modeling of longitudinal covariance structure in functional mapping of quantitative trait loci
- Variational Bayesian inference for network autoregression models
- scientific article; zbMATH DE number 7626789 (Why is no real title available?)
- Bayesian estimation of sparse precision matrices in the presence of Gaussian measurement error
- Block-diagonal precision matrix regularization for ultra-high dimensional data
- Scaling it up: stochastic search structure learning in graphical models
- On Hodges' superefficiency and merits of oracle property in model selection
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Two-step sparse boosting for high-dimensional longitudinal data with varying coefficients
- Balanced estimation for high-dimensional measurement error models
- Variable selection for high‐dimensional generalized linear model with block‐missing data
- Elegant robustification of sparse partial least squares by robustness-inducing transformations
- An Additive Graphical Model for Discrete Data
- Estimation of a sparse and spiked covariance matrix
- Tuning-free heterogeneous inference in massive networks
- The cluster graphical Lasso for improved estimation of Gaussian graphical models
- Adjusted regularization in latent graphical models: application to multiple-neuron spike count data
- Adjusted regularization of cortical covariance
- Structure learning of exponential family graphical model with false discovery rate control
- Learning latent variable Gaussian graphical model for biomolecular network with low sample complexity
- Structural pursuit over multiple undirected graphs
- A network Lasso model for regression
- Discussion of: ``Multivariate dynamic modeling for Bayesian forecasting of business revenue
- Simultaneous inference for pairwise graphical models with generalized score matching
- Estimating scale-free networks via the exponentiation of minimax concave penalty
- An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation
- Selecting the tuning parameter in penalized Gaussian graphical models
- Fast algorithms for sparse inverse covariance estimation
- Regularised MANOVA for high-dimensional data
- Penalized model-based clustering with unconstrained covariance matrices
- Partial correlation matrix estimation using ridge penalty followed by thresholding and re-estimation
- A two-step method for estimating high-dimensional Gaussian graphical models
- Estimating sparse networks with hubs
- Gemini: graph estimation with matrix variate normal instances
- Model selection and estimation in the matrix normal graphical model
- Bayesian regularization for graphical models with unequal shrinkage
- A two-stage sequential conditional selection approach to sparse high-dimensional multivariate regression models
- High-dimensional generalized linear models incorporating graphical structure among predictors
- Innovated scalable efficient inference for ultra-large graphical models
- Two-way sparsity for time-varying networks with applications in genomics
- Adaptive estimation of covariance matrices via Cholesky decomposition
- Sparse inverse covariance matrix estimation via the \(\ell_0\)-norm with Tikhonov regularization
- Estimation of positive definite M-matrices and structure learning for attractive Gaussian Markov random fields
- Covariance and precision matrix estimation for high-dimensional time series
- A partial graphical model with a structural prior on the direct links between predictors and responses
- Sparse estimation of high-dimensional inverse covariance matrices with explicit eigenvalue constraints
- Estimation of joint directed acyclic graphs with Lasso family for gene networks
- Post-processing posteriors over precision matrices to produce sparse graph estimates
- A computationally fast alternative to cross-validation in penalized Gaussian graphical models
- Multiple and multilevel graphical models
- Dynamical modeling for non-Gaussian data with high-dimensional sparse ordinary differential equations
- Robust and sparse estimation of graphical models based on multivariate winsorization
This page was built for publication: Network exploration via the adaptive LASSO and SCAD penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2270657)
