Algorithm 1042: Sparse Precision Matrix Estimation With SQUIC
Additional information
Authors
Type
Journal Article
Year
2024
Language
English
Abstract
We present SQUIC, a fast and scalable sparse precision matrix estimation package. The algorithm is a second-order method that solves the ℓ1–regularized maximum likelihood problem using highly optimized linear algebra subroutines, which leverage the underlying sparsity and the intrinsic parallelism in the computation. We provide didactic examples using synthetic datasets where SQUIC consistently outperforms the state-of-the-art packages, with at least up to an order of magnitude faster runtimes and equivalent or higher accuracy. Next, we utilize SQUIC to classify microarray gene expressions and demonstrate that by using the matrix form of the tuning parameter (also called the regularization parameter), SQUIC can use prior bias in the estimation procedure, which can improve classification accuracy with minimal computational overhead. SQUIC is implemented in C++ with interfaces for R and Python.
Journal
ACM Transactions on Mathematical Software
Volume
Volume 50
Number
Issue 2
Start page number
1
End page number
18
DOI
Keywords
sparse precision matrix estimation, covariance matrix, matrix factorization, matrix inversion
