A greedy algorithm for sparse precision matrix approximation

07/01/2019
by   Didi Lv, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset