arrow
返回

pISTA: PRECONDITIONED ITERATIVE SOFT THRESHOLDING ALGORITHM FOR GRAPHICAL LASSO

delete2024-01-16
delete0
delete
OA
AI
G
Gal Shalom *
E
Eran Treister
I
Irad Yavneh
DOI:10.1137/22M1496128delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
We propose a novel quasi-Newton method for solving the sparse inverse covariance estimation problem also known as the graphical least absolute shrinkage and selection operator (GLASSO). This problem is often solved using a second-order quadratic approximation. However, in such algorithms the Hessian term is complex and computationally expensive to handle. Therefore, our method uses the inverse of the Hessian as a preconditioner to simplify and approximate the quadratic element at the cost of a more complex \ell1 1 element. The variables of the resulting preconditioned problem are coupled only by the \ell1 1 subderivative of each other, which can be guessed with minimal cost using the gradient itself, allowing the algorithm to be parallelized and implemented efficiently on GPU hardware accelerators. Numerical results on synthetic and real data demonstrate that our method is competitive with other state-of-the-art approaches.
Keyword:
graphical LASSO
sparse precision matrix estimation
proximal methods
preconditioning

期刊

SIAM Journal on Scientific Computing 封面图
SIAM Journal on Scientific Computing
IF:
2.6
论文数:
5.1K
被引数:
1.8W

机构

B
ben gurion university
学者数:
1.3W
论文数: 1.0W
被引数: 5
T
Technion Israel Institute of Technology
学者数:
1.6W
论文数: 1.5W
被引数: 2.0W
引用论文

引用论文

err分享
err收藏
学者 查看更多内容