A class of multi-resolution approximations for large spatial datasets
Not on the map. Why?
Abstract (arXiv)
Gaussian processes are popular and flexible models for spatial, temporal, and functional data, but they are computationally infeasible for large datasets. We discuss Gaussian-process approximations that use basis functions at multiple resolutions to achieve fast inference and that can (approximately) represent any spatial covariance structure. We consider two special cases of this multi-resolution-approximation framework, a taper version and a domain-partitioning (block) version. We describe theoretical properties and inference procedures, and study the computational complexity of the methods. Numerical comparisons and an application to satellite data are also provided.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 24 Oct 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 0; 2026: 1.
3 papers.
- 2022Scalable Gaussian-process regression and variable selection using Vecchia approximationscited by 8
- 2024When the whole is greater than the sum of its parts: Scaling black-box inference to large data settings through divide-and-conquercited by 0
- 2026Adaptive multi-resolution Gaussian processes: Scalable exact inference with naturally data-sparse covariance matricescited by 0
- 2026Adaptive multi-resolution Gaussian processes: Scalable exact inference with naturally data-sparse covariance matrices24 Sep 2026
- 2024When the whole is greater than the sum of its parts: Scaling black-box inference to large data settings through divide-and-conquer29 Dec 2024
- 2022Scalable Gaussian-process regression and variable selection using Vecchia approximations25 Feb 2022