High-dimensional graphs and variable selection with the Lasso
From MaRDI portal
Publication:2500458
Abstract: The pattern of zero entries in the inverse covariance matrix of a multivariate normal distribution corresponds to conditional independence restrictions between variables. Covariance selection aims at estimating those structural zeros from data. We show that neighborhood selection with the Lasso is a computationally attractive alternative to standard covariance selection for sparse high-dimensional graphs. Neighborhood selection estimates the conditional independence restrictions separately for each node in the graph and is hence equivalent to variable selection for Gaussian linear models. We show that the proposed neighborhood selection scheme is consistent for sparse high-dimensional graphs. Consistency hinges on the choice of the penalty parameter. The oracle value for optimal prediction does not lead to a consistent neighborhood estimate. Controlling instead the probability of falsely joining some distinct connectivity components of the graph, consistent estimation for sparse graphs is achieved (with exponential rates), even when the number of variables grows as the number of observations raised to an arbitrary power.
Recommendations
- Sparse inverse covariance estimation with the graphical lasso
- The sparsity and bias of the LASSO selection in high-dimensional linear regression
- Sparse covariance thresholding for high-dimensional variable selection
- A note on the Lasso for Gaussian graphical model selection
- Efficient estimation of covariance selection models
Cites work
- A Statistical View of Some Chemometrics Regression Tools
- Asymptotics for Lasso-type estimators.
- Atomic decomposition by basis pursuit
- Dependency networks for inference, collaborative filtering, and data visualization
- Functional aggregation for nonparametric regression.
- Gaussian Markov distributions over finite graphs
- scientific article; zbMATH DE number 469396 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Introduction to Graphical Modelling
- Least angle regression. (With discussion)
- Linear Model Selection by Cross-Validation
- Model selection for Gaussian concentration graphs
- Persistene in high-dimensional linear predictor-selection and the virtue of overparametrization
- Weak convergence and empirical processes. With applications to statistics
Cited in
(only showing first 100 items - show all)- Flexible covariance estimation in graphical Gaussian models
- Lasso-type recovery of sparse representations for high-dimensional data
- Relaxed Lasso
- SCAD-penalized regression in high-dimensional partially linear models
- High-dimensional additive modeling
- Sparsistency and rates of convergence in large covariance matrix estimation
- Estimating high-dimensional intervention effects from observational data
- Graph selection with GGMselect
- A general algorithm for covariance modeling of discrete data
- Selection by partitioning the solution paths
- Transfer Learning under High-dimensional Generalized Linear Models
- Nearly unbiased variable selection under minimax concave penalty
- Confidence intervals for high-dimensional inverse covariance estimation
- Latent variable graphical model selection via convex optimization
- Estimation of high-dimensional graphical models using regularized score matching
- A projection-based conditional dependence measure with applications to high-dimensional undirected graphical models
- Flexible and Interpretable Models for Survival Data
- Tuning-free heterogeneous inference in massive networks
- Sparse inverse covariance estimation with the graphical lasso
- Factor-Adjusted Regularized Model Selection
- Asymptotic normality and optimalities in estimation of large Gaussian graphical models
- Honest confidence regions and optimality in high-dimensional precision matrix estimation
- Gaussian graphical model estimation with false discovery rate control
- Robust methods for inferring sparse network structures
- Edge detection in sparse Gaussian graphical models
- Change-point detection in high-dimensional covariance structure
- A general family of trimmed estimators for robust high-dimensional data analysis
- Nonparametric Bayesian learning of heterogeneous dynamic transcription factor networks
- Estimating a common covariance matrix for network meta-analysis of gene expression datasets in diffuse large B-cell lymphoma
- A joint convex penalty for inverse covariance matrix estimation
- Solving norm constrained portfolio optimization via coordinate-wise descent algorithms
- The cluster graphical Lasso for improved estimation of Gaussian graphical models
- Model selection consistency of Lasso for empirical data
- Penalised inference for lagged dependent regression in the presence of autocorrelated residuals
- Statistics for big data: a perspective
- Distributed testing and estimation under sparse high dimensional models
- Sparse linear models and \(l_1\)-regularized 2SLS with high-dimensional endogenous regressors and instruments
- Recent developments in high dimensional covariance estimation and its related issues, a review
- Bayesian variable selection with strong heredity constraints
- High-dimensional inference for personalized treatment decision
- High dimensional Gaussian copula graphical model with FDR control
- On stepwise pattern recovery of the fused Lasso
- On the sign consistency of the Lasso for the high-dimensional Cox model
- Joint estimation of multiple Gaussian graphical models across unbalanced classes
- Moderately clipped Lasso
- Finding Dantzig selectors with a proximity operator based fixed-point algorithm
- Probing for sparse and fast variable selection with model-based boosting
- Confidence regions for entries of a large precision matrix
- Generalized Kalman smoothing: modeling and algorithms
- Sparse causality network retrieval from short time series
- Sparse and low-rank matrix regularization for learning time-varying Markov networks
- High-dimensional simultaneous inference with the bootstrap
- A constrained \(\ell1\) minimization approach for estimating multiple sparse Gaussian or nonparanormal graphical models
- Inferring large graphs using \(\ell_1\)-penalized likelihood
- Reconstruction of recurrent synaptic connectivity of thousands of neurons from simulated spiking activity
- Asymptotically honest confidence regions for high dimensional parameters by the desparsified conservative Lasso
- Heterogeneity adjustment with applications to graphical model inference
- Spectral clustering via sparse graph structure learning with application to proteomic signaling networks in cancer
- Combinatorial inference for graphical models
- Efficient Bayesian regularization for graphical model selection
- Robust covariance estimation for approximate factor models
- Stable limit theorems for empirical processes under conditional neighborhood dependence
- Learning semidefinite regularizers
- Pathwise coordinate optimization for sparse learning: algorithm and theory
- Regularization and the small-ball method. I: Sparse recovery
- Gaussian and bootstrap approximations for high-dimensional U-statistics and their applications
- Inference of the stochastic MAPK pathway by modified diffusion bridge method
- High-dimensional inference: confidence intervals, \(p\)-values and R-software \texttt{hdi}
- Broken adaptive ridge regression and its asymptotic properties
- An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation
- Stable graphical model estimation with random forests for discrete, continuous, and mixed variables
- Variable selection with Hamming loss
- Semiparametric efficiency bounds for high-dimensional models
- Fitting very large sparse Gaussian graphical models
- \(\ell _{1}\)-regularized linear regression: persistence and oracle inequalities
- Model selection via standard error adjusted adaptive Lasso
- Simultaneous variable selection and estimation in semiparametric modeling of longitudinal/clustered data
- Discussion: Latent variable graphical model selection via convex optimization
- Rejoinder: Latent variable graphical model selection via convex optimization
- High-dimensional semiparametric Gaussian copula graphical models
- Structural learning for Bayesian networks by testing complete separators in prime blocks
- Minimax risks for sparse regressions: ultra-high dimensional phenomenons
- Group symmetry and covariance regularization
- Estimating networks with jumps
- The graphical lasso: new insights and alternatives
- Bootstrap inference for network construction with an application to a breast cancer microarray study
- Sparse permutation invariant covariance estimation
- Estimation of Gaussian graphs by model selection
- On the asymptotic properties of the group lasso estimator for linear models
- Honest variable selection in linear and logistic regression models via \(\ell _{1}\) and \(\ell _{1}+\ell _{2}\) penalization
- Inferring sparse Gaussian graphical models with latent structure
- High dimensional sparse covariance estimation via directed acyclic graphs
- Forest Garrote
- On the conditions used to prove oracle results for the Lasso
- Self-concordant analysis for logistic regression
- PAC-Bayesian bounds for sparse regression estimation with exponential weights
- The adaptive and the thresholded Lasso for potentially misspecified models (and a lower bound for the Lasso)
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- Robust regression through the Huber's criterion and adaptive lasso penalty
- The smooth-Lasso and other \(\ell _{1}+\ell _{2}\)-penalized methods
This page was built for publication: High-dimensional graphs and variable selection with the Lasso
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500458)
