A constrained _1 minimization approach to sparse precision matrix estimation
From MaRDI portal
Publication:3095179
Abstract: A constrained L1 minimization method is proposed for estimating a sparse inverse covariance matrix based on a sample of iid -variate random variables. The resulting estimator is shown to enjoy a number of desirable properties. In particular, it is shown that the rate of convergence between the estimator and the true -sparse precision matrix under the spectral norm is when the population distribution has either exponential-type tails or polynomial-type tails. Convergence rates under the elementwise norm and Frobenius norm are also presented. In addition, graphical model selection is considered. The procedure is easily implementable by linear programming. Numerical performance of the estimator is investigated using both simulated and real data. In particular, the procedure is applied to analyze a breast cancer dataset. The procedure performs favorably in comparison to existing methods.
Recommendations
- An approach to precision matrix estimation based on L₁ norm minimization
- Estimating sparse precision matrix: optimal rates of convergence and adaptive estimation
- Sparse permutation invariant covariance estimation
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- Sparse inverse covariance estimation with the graphical lasso
Cited in
(only showing first 100 items - show all)- Confidence intervals for high-dimensional inverse covariance estimation
- On generating random Gaussian graphical models
- False Discovery Rate Control Under General Dependence By Symmetrized Data Aggregation
- A projection-based conditional dependence measure with applications to high-dimensional undirected graphical models
- Non-asymptotic error controlled sparse high dimensional precision matrix estimation
- Tuning-free heterogeneous inference in massive networks
- 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
- Edge detection in sparse Gaussian graphical models
- Two-step sparse boosting for high-dimensional longitudinal data with varying coefficients
- Adaptive test for mean vectors of high-dimensional time series data with factor structure
- The cluster graphical Lasso for improved estimation of Gaussian graphical models
- A unified theory of confidence regions and testing for high-dimensional estimating equations
- A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints
- High dimensional Gaussian copula graphical model with FDR control
- Robust estimation of precision matrices under cellwise contamination
- Estimating large covariance matrix with network topology for high-dimensional biomedical data
- Confidence regions for entries of a large precision matrix
- A constrained \(\ell1\) minimization approach for estimating multiple sparse Gaussian or nonparanormal graphical models
- 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
- Adaptive estimation of high-dimensional signal-to-noise ratios
- Gaussian and bootstrap approximations for high-dimensional U-statistics and their applications
- Testing independence with high-dimensional correlated samples
- High-dimensional robust precision matrix estimation: cellwise corruption under \(\epsilon \)-contamination
- Robust two-sample test of high-dimensional mean vectors under dependence
- On the dimension effect of regularized linear discriminant analysis
- Adaptive covariance matrix estimation through block thresholding
- High-dimensional semiparametric Gaussian copula graphical models
- Sparse permutation invariant covariance estimation
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- Optimal rates of convergence for estimating Toeplitz covariance matrices
- ROCKET: robust confidence intervals via Kendall's tau for transelliptical graphical models
- High-dimensional consistency in score-based and hybrid structure learning
- Weighted covariance matrix estimation
- An efficient ADMM algorithm for high dimensional precision matrix estimation via penalized quadratic loss
- Rate optimal estimation and confidence intervals for high-dimensional regression with missing covariates
- A scalable sparse Cholesky based approach for learning high-dimensional covariance matrices in ordered data
- Bayesian structure learning in graphical models
- A distribution-based Lasso for a general single-index model
- Complexity and applications of the homotopy principle for uniformly constrained sparse minimization
- Network modeling in biology: statistical methods for gene and brain networks
- Bootstrap based inference for sparse high-dimensional time series models
- Efficient distributed estimation of high-dimensional sparse precision matrix for transelliptical graphical models
- Consistent multiple changepoint estimation with fused Gaussian graphical models
- Bayesian inference for high-dimensional decomposable graphs
- Recent advances in shrinkage-based high-dimensional inference
- High dimensional change point inference: recent developments and extensions
- Estimating high-dimensional covariance and precision matrices under general missing dependence
- Simplicial and minimal-variance distances in multivariate data analysis
- Neyman's truncation test for two-sample means under high dimensional setting
- Reproducible learning in large-scale graphical models
- Robust parameter estimation of regression models under weakened moment assumptions
- Varying coefficient linear discriminant analysis for dynamic data
- Novel multiplier bootstrap tests for high-dimensional data with applications to MANOVA
- Multivariate sparse Laplacian shrinkage for joint estimation of two graphical structures
- On skewed Gaussian graphical models
- Low-rank multi-parametric covariance identification
- An efficient parallel block coordinate descent algorithm for large-scale precision matrix estimation using graphics processing units
- High-dimensional sufficient dimension reduction through principal projections
- Estimating finite mixtures of ordinal graphical models
- Doubly debiased Lasso: high-dimensional inference under hidden confounding
- Single-index composite quantile regression for ultra-high-dimensional data
- Differential network inference via the fused D-trace loss with cross variables
- A fast iterative algorithm for high-dimensional differential network
- Inference for high-dimensional instrumental variables regression
- High-dimensional joint estimation of multiple directed Gaussian graphical models
- Uniform joint screening for ultra-high dimensional graphical models
- Certifiably optimal sparse inverse covariance estimation
- Sparse directed acyclic graphs incorporating the covariates
- Adaptive estimation in structured factor models with applications to overlapping clustering
- Minimax estimation of large precision matrices with bandable Cholesky factor
- Estimating covariance and precision matrices along subspaces
- Dependence in elliptical partial correlation graphs
- Bayesian estimation of sparse precision matrices in the presence of Gaussian measurement error
- Minimax estimation of covariance and precision matrices for high-dimensional time series with long-memory
- Gemini: graph estimation with matrix variate normal instances
- Mean-variance portfolio selection with correlation risk
- Fast and adaptive sparse precision matrix estimation in high dimensions
- Data science, big data and statistics
- Sign-based test for mean vector in high-dimensional and sparse settings
- Efficient computation for differential network analysis with applications to quadratic discriminant analysis
- User-friendly covariance estimation for heavy-tailed distributions
- Regularized estimation of precision matrix for high-dimensional multivariate longitudinal data
- High-dimensional minimum variance portfolio estimation based on high-frequency data
- Ultrahigh dimensional precision matrix estimation via refitted cross validation
- Optimal designs in sparse linear models
- Bayesian estimation of large precision matrix based on Cholesky decomposition
- Bayesian discriminant analysis using a high dimensional predictor
- Non-asymptotic rate for high-dimensional covariance estimation with non-independent missing observations
- High-dimensional generalized linear models incorporating graphical structure among predictors
- Spectral analysis of high-dimensional time series
- Property testing in high-dimensional Ising models
- Testing for independence of large dimensional vectors
- Selecting the tuning parameter in penalized Gaussian graphical models
- Estimation of positive definite M-matrices and structure learning for attractive Gaussian Markov random fields
- Rate-optimal posterior contraction for sparse PCA
- Innovated interaction screening for high-dimensional nonlinear classification
This page was built for publication: A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095179)
