Sparse nearest neighbor Cholesky matrices in spatial statistics
Abhirup Datta

TL;DR
This paper reviews the use of sparse Cholesky matrices in Gaussian Process models for spatial statistics, highlighting their diverse applications beyond traditional parameter estimation and prediction.
Contribution
It provides a comprehensive review of sparse Cholesky matrices in NNGP, exploring new applications in spatial bootstrapping, large-scale simulation, and non-parametric mean estimation.
Findings
Sparse Cholesky matrices enable efficient large-scale Gaussian Process computations.
Applications extend to spatial bootstrapping, simulation, and non-parametric mean estimation.
Addresses interpretability issues in areal data models.
Abstract
Gaussian Processes (GP) is a staple in the toolkit of a spatial statistician. Well-documented computing roadblocks in the analysis of large geospatial datasets using Gaussian Processes have now been successfully mitigated via several recent statistical innovations. Nearest Neighbor Gaussian Processes (NNGP) has emerged as one of the leading candidates for such massive-scale geospatial analysis owing to their empirical success. This article reviews the connection of NNGP to sparse Cholesky factors of the spatial precision (inverse-covariance) matrices. Focus of the review is on these sparse Cholesky matrices which are versatile and have recently found many diverse applications beyond the primary usage of NNGP for fast parameter estimation and prediction in the spatial (generalized) linear models. In particular, we discuss applications of sparse NNGP Cholesky matrices to address…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoil Geostatistics and Mapping · Remote Sensing and LiDAR Applications · Remote Sensing in Agriculture
