A class of multi-resolution approximations for large spatial datasets

Abstract

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.

References in corpus (5)

• Practical Bayesian Optimization of Machine Learning Algorithms
• Fast and scalable Gaussian process modeling with applications to astronomical time series
• Fixed-domain asymptotic properties of tapered maximum likelihood estimators
• Covariance approximation for large multivariate spatial data sets with an application to multiple climate model errors
• Spectral Density Estimation for Random Fields via Periodic Embeddings

Cited by in corpus (6)

• A general framework for Vecchia approximations of Gaussian processes
• Vecchia-Laplace approximations of generalized Gaussian processes for big non-Gaussian spatial data
• Correlation-based sparse inverse Cholesky factorization for fast Gaussian-process inference
• Modelling wildland fire burn severity in California using a spatial Super Learner approach
• Iterative Methods for Vecchia-Laplace Approximations for Latent Gaussian Process Models
• Inverse sampling intensity weighting for preferential sampling adjustment