On estimation of the diagonal elements of a sparse precision matrix
From MaRDI portal
Abstract: In this paper, we present several estimators of the diagonal elements of the inverse of the covariance matrix, called precision matrix, of a sample of iid random vectors. The focus is on high dimensional vectors having a sparse precision matrix. It is now well understood that when the underlying distribution is Gaussian, the columns of the precision matrix can be estimated independently form one another by solving linear regression problems under sparsity constraints. This approach leads to a computationally efficient strategy for estimating the precision matrix that starts by estimating the regression vectors, then estimates the diagonal entries of the precision matrix and, in a final step, combines these estimators for getting estimators of the off-diagonal entries. While the step of estimating the regression vector has been intensively studied over the past decade, the problem of deriving statistically accurate estimators of the diagonal entries has received much less attention. The goal of the present paper is to fill this gap by presenting four estimators---that seem the most natural ones---of the diagonal entries of the precision matrix and then performing a comprehensive empirical evaluation of these estimators. The estimators under consideration are the residual variance, the relaxed maximum likelihood, the symmetry-enforced maximum likelihood and the penalized maximum likelihood. We show, both theoretically and empirically, that when the aforementioned regression vectors are estimated without error, the symmetry-enforced maximum likelihood estimator has the smallest estimation error. However, in a more realistic setting when the regression vector is estimated by a sparsity-favoring computationally efficient method, the qualities of the estimators become relatively comparable with a slight advantage for the residual variance estimator.
Recommendations
- Efficient distributed estimation of high-dimensional sparse precision matrix
- Fast and adaptive sparse precision matrix estimation in high dimensions
- Adjusting for high-dimensional covariates in sparse precision matrix estimation by \(\ell_1\)-penalization
- A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
- Confidence intervals for high-dimensional inverse covariance estimation
Cites work
- scientific article; zbMATH DE number 1489799 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
- A direct estimation approach to sparse linear discriminant analysis
- A note on two problems in connexion with graphs
- Adaptive estimation of a quadratic functional by model selection.
- Conditional Means and Covariances of Normal Variables with Singular Covariance Matrix
- Estimating sparse precision matrix: optimal rates of convergence and adaptive estimation
- High dimensional inverse covariance matrix estimation via linear programming
- High-dimensional graphs and variable selection with the Lasso
- Improved matrix uncertainty selector
- Introduction to algorithms.
- Introductory lectures on convex optimization. A basic course.
- Least squares after model selection in high-dimensional sparse models
- Model selection and estimation in the Gaussian graphical model
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Pivotal estimation via square-root lasso in nonparametric regression
- Rejoinder to the comments on: \(\ell _{1}\)-penalization for mixture regression models
- Scaled sparse linear regression
- Sparse inverse covariance estimation with the graphical lasso
- Sparse matrix inversion with scaled Lasso
- Sparse nonparametric graphical models
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The nonparanormal: semiparametric estimation of high dimensional undirected graphs
- \(\ell_{1}\)-penalization for mixture regression models
Cited in
(7)- Fast estimates for the diagonal of the inverse of large scale matrices appearing in applications
- scientific article; zbMATH DE number 4182700 (Why is no real title available?)
- Variable selection for generalized linear model with highly correlated covariates
- Robust estimators in high-dimensions without the computational intractability
- The approximation characteristic of diagonal matrix in probabilistic setting
- Fluctuations of the diagonal entries of a large sample precision matrix
- scientific article; zbMATH DE number 1844154 (Why is no real title available?)
This page was built for publication: On estimation of the diagonal elements of a sparse precision matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q302437)
