Metraipolis › archive › dc_4acc14f7e802
Adaptive multi-resolution Gaussian processes: Scalable exact inference with naturally data-sparse covariance matrices — arXiv:2609.30348
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.30348
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T01:38:51.258Z
- SHA-256 of the archived text
83c6054a79771366aea31d8eff8a9e0e2058a533fbd964573a91c93c9dbf35ac- Stable URL of this page
https://metraipolis.com/documento/dc_4acc14f7e802
How to cite
Adaptive multi-resolution Gaussian processes: Scalable exact inference with naturally data-sparse covariance matrices — arXiv:2609.30348 — arXiv (en), https://arxiv.org/abs/2609.30348 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4acc14f7e802 (Metraipolis archive dc_4acc14f7e802, sha256 83c6054a79771366aea31d8eff8a9e0e2058a533fbd964573a91c93c9dbf35ac)
BibTeX
@misc{dc4acc14f7e802,
title = {Adaptive multi-resolution Gaussian processes: Scalable exact inference with naturally data-sparse covariance matrices — arXiv:2609.30348},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.30348},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4acc14f7e802; sha256 83c6054a79771366aea31d8eff8a9e0e2058a533fbd964573a91c93c9dbf35ac},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30348. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Gaussian processes constitute a cornerstone of probabilistic machine learning, yet scaling them to large datasets typically forces a trade-off between computational efficiency and model fidelity. This work bridges this gap by presenting an adaptive multi-resolution Gaussian process framework that is both scalable and exact. Our key innovation is constructing a naturally data-sparse covariance matrix with adaptive multi-resolution basis functions. These basis functions are directly anchored to samples, eliminating the need for auxiliary points. By shrinking the support domains of multi-resolution basis, the matrix block sizes are limited, guaranteeing sparsity. The inverse of the data-sparse covariance matrix is computed exactly and efficiently via the sparse Cholesky inverse algorithm. To further improve predictive uncertainties, we construct an augmented basis function. Theoretical analysis and numerical experiments demonstrate that our model achieves exact inference with $\mathcal{O}(n \log^2 n)$ training cost and $\mathcal{O}(\log^d n)$ prediction cost, establishing a principled framework for scalable and high-fidelity Gaussian process regression.
Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-28 in cs.AI).
Categorie arXiv: Machine Learning (stat.ML) ; Artificial Intelligence (cs.AI); Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.30348 — 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-10-08T01:12:14.417Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).