Network exploration via the adaptive LASSO and SCAD penalties

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 $L_1$ 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.

Published in at http://dx.doi.org/10.1214/08-AOAS215 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (19)

• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• Rejoinder to "Least angle regression" by Efron et al
• Least Angle Regression
• Discussion of "Least angle regression" by Efron et al
• Discussion of "Least angle regression" by Efron et al
• High-dimensional graphs and variable selection with the Lasso
• Nonconcave penalized likelihood with a diverging number of parameters
• One-step sparse estimates in nonconcave penalized likelihood models
• Sparse permutation invariant covariance estimation
• High-dimensional classification using features annealed independence rules
• Sparsistency and rates of convergence in large covariance matrix estimation
• Variable selection using MM algorithms
• Network exploration via the adaptive LASSO and SCAD penalties
• Sparse estimation of large covariance matrices via a nested Lasso penalty

Cited by in corpus (31)

• Covariance regularization by thresholding
• Sparsistency and rates of convergence in large covariance matrix estimation
• Network exploration via the adaptive LASSO and SCAD penalties
• A sparse conditional Gaussian graphical model for analysis of genetical genomics data
• Covariance Estimation: The GLM and Regularization Perspectives
• Estimating time-varying networks
• Covariance and precision matrix estimation for high-dimensional time series
• The sparse Laplacian shrinkage estimator for high-dimensional regression
• Scaling It Up: Stochastic Search Structure Learning in Graphical Models
• Fast and Adaptive Sparse Precision Matrix Estimation in High Dimensions
• Gemini: Graph estimation with matrix variate normal instances
• Statistical Significance of Clustering using Soft Thresholding
• Change-point detection in high-dimensional covariance structure
• L0 Sparse Inverse Covariance Estimation
• Regularized estimation of linear functionals of precision matrices for high-dimensional time series
• Introduction to correlation networks: Interdisciplinary approaches beyond thresholding
• Constructing networks by filtering correlation matrices: A null model approach
• Sparse Graph Learning Under Laplacian-Related Constraints
• Shrinking characteristics of precision matrix estimators
• Certifiably Optimal Sparse Inverse Covariance Estimation
• Joint estimation of sparse multivariate regression and conditional graphical models
• Robust and Efficient Network Reconstruction in Complex System via Adaptive Signal Lasso
• Concentration of a sparse Bayesian model with Horseshoe prior in estimating high-dimensional precision matrix
• Estimation of dynamic networks for high-dimensional nonstationary time series
• On Hodges' Superefficiency and Merits of Oracle Property in Model Selection
• Tensor Graphical Model: Non-convex Optimization and Statistical Inference
• NExUS: Bayesian simultaneous network estimation across unequal sample sizes
• Estimation of the genetic Gaussian network using GWAS summary data
• Partial Correlation Graphical LASSO
• A Bayesian Graphical Approach for Large-Scale Portfolio Management with Fewer Historical Data
• A positive-definiteness-assured block Gibbs sampler for Bayesian graphical models with shrinkage priors