

























Precision matrix estimation is an important problem in statistical data analysis. This paper introduces a fast sparse precision matrix estimation algorithm, namely GISS$^{ρ}$, which is originally introduced for compressive sensing. The algorithm GISS$^{ρ}$ is derived based on $l_1$ minimization while with the computation advantage of greedy algorithms. We analyze the asymptotic convergence rate of the proposed GISS$^{ρ}$ for sparse precision matrix estimation and sparsity recovery properties with respect to the stopping criteria. Finally, we numerically compare GISS$^ρ$ to other sparse recovery algorithms, such as ADMM and HTP in three settings of precision matrix estimation. The numerical results show the advantages of the proposed algorithm.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。