English

GraphSPME: Markov Precision Matrix Estimation and Asymptotic Stein-Type Shrinkage

Computation 2022-05-17 v1

Abstract

GraphSPME is an open source Python, R and C++ header-only package implement-ing non-parametric sparse precision matrix estimation along with asymptotic Stein-type shrinkage estimation of the covariance matrix. The user defines a potential neighbourhood structure and provides data that potentially are p >> n. This paper introduces a novel approach for finding the optimal order (that data allows to estimate) of a potential Markov property. The algorithm is implemented in the package, alleviating the problem of users making Markov assumptions and implementing corresponding complex higher-order neighbourhood structures. Estimation is made accurate and stable by simultaneously utilising both Markov properties and Stein-type shrinkage. Asymptotic results on Stein-type shrinkage ensure that non-singular well conditioned matrices are obtained in an automatic manner. Final symmetry conversion creates symmetric positive definite estimates. Furthermore, the estimation routine is made efficient and scalable to very high-dimensional problems (~10^7) by utilising the sparse nature of the precision matrix under Markov assumptions. Implementation wise, the sparsity is exploited by employing the sparsity possibilities made available by the Eigen C++ linear-algebra library. The package and examples are available at https://github.com/equinor/GraphSPME

Keywords

Cite

@article{arxiv.2205.07584,
  title  = {GraphSPME: Markov Precision Matrix Estimation and Asymptotic Stein-Type Shrinkage},
  author = {Berent Ånund Strømnes Lunde and Feda Curic and Sondre Sortland},
  journal= {arXiv preprint arXiv:2205.07584},
  year   = {2022}
}

Comments

17 pages, 6 figures

R2 v1 2026-06-24T11:18:22.954Z