Algorithm 1042: Sparse Precision Matrix Estimation With SQUIC
Informazioni aggiuntive
Autori
Tipo
Articolo pubblicato in rivista scientifica
Anno
2024
Lingua
Inglese
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.
Rivista
ACM Transactions on Mathematical Software
Volume
Volume 50
Numero
Issue 2
Pagina inizio
1
Pagina fine
18
DOI
Parole chiave
sparse precision matrix estimation, covariance matrix, matrix factorization, matrix inversion
