A Constrained L1 Minimization Approach to Sparse Precision Matrix Estimation

Abstract

A constrained L1 minimization method is proposed for estimating a sparse inverse covariance matrix based on a sample of $n$ iid $p$-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 $s$-sparse precision matrix under the spectral norm is $s\sqrt{\log p/n}$ when the population distribution has either exponential-type tails or polynomial-type tails. Convergence rates under the elementwise $L_{\infty }$ 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.

To appear in Journal of the American Statistical Association

References in corpus (2)

• Model Selection Through Sparse Maximum Likelihood Estimation
• Adaptive Lasso for High Dimensional Regression and Gaussian Graphical Modeling

Cited by in corpus (9)

• Higher Criticism for Large-Scale Inference, Especially for Rare and Weak Effects
• Statistical Significance of Clustering using Soft Thresholding
• Optimal Linear Shrinkage Estimator for Large Dimensional Precision Matrix
• On the Strong Convergence of the Optimal Linear Shrinkage Estimator for Large Dimensional Covariance Matrix
• Confidence regions for entries of a large precision matrix
• On estimation of the diagonal elements of a sparse precision matrix
• Random Matrix Derived Shrinkage of Spectral Precision Matrices
• A random covariance model for bi-level graphical modeling with application to resting-state fMRI data
• Minimax Estimation of Bandable Precision Matrices