Metraipolis › archive › dc_44fa91d8163c
Fast nonparametric estimation of sparse precision matrices with a priori sparsity structure — arXiv:2611.03462
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.03462
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:44:24.816Z
- SHA-256 of the archived text
56e132fc1b1718de70b8565e3b12692a1c5cdeea25a0f902b674dccc1511f8e2- Stable URL of this page
https://metraipolis.com/documento/dc_44fa91d8163c
How to cite
Fast nonparametric estimation of sparse precision matrices with a priori sparsity structure — arXiv:2611.03462 — arXiv (en), https://arxiv.org/abs/2611.03462 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_44fa91d8163c (Metraipolis archive dc_44fa91d8163c, sha256 56e132fc1b1718de70b8565e3b12692a1c5cdeea25a0f902b674dccc1511f8e2)
BibTeX
@misc{dc44fa91d8163c,
title = {Fast nonparametric estimation of sparse precision matrices with a priori sparsity structure — arXiv:2611.03462},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.03462},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_44fa91d8163c; sha256 56e132fc1b1718de70b8565e3b12692a1c5cdeea25a0f902b674dccc1511f8e2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03462. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This work describes a computational approach for rapidly estimating and characterizing the covariance structure of a Gaussian random field from a modest number of i.i.d. replicates by formulating the problem in terms of a sparse inverse Cholesky factor of the data's covariance matrix. Borrowing from the extensive literature of using directed acyclic graphs to impose sparsity on inverse Cholesky factors (for example, Vecchia's approximation or nearest-neighbor Gaussian process models), a probabilistically parsimonious a priori sparsity pattern is imposed, and with careful formulation the estimation problem is given as an extremely well-structured convex problem that can be solved for millions of unknowns in seconds on a single processor core. After describing the problem and specific formulation of the optimization, we demonstrate the estimator's speed and effectiveness at capturing a variety of nonstationary structures in spatial or spatio-temporal data, and in ensemble data assimilation. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ME, nuovi lavori del giorno). Categorie arXiv: Computation (stat.CO) ; Methodology (stat.ME). Pagina del lavoro: https://arxiv.org/abs/2611.03462 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T18:13:53.156Z dalla pagina https://arxiv.org/list/stat.ME/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).