Normalizing Basis Functions: Approximate Stationary Models for Large Spatial Data
Antony Sikorski, Daniel McKenzie, Douglas Nychka

TL;DR
This paper introduces efficient algorithms for normalizing basis functions in spatial models, enabling scalable and nearly stationary analysis of large geostatistical datasets with significant computational speedups.
Contribution
The paper presents two fast algorithms for normalizing basis functions, improving the scalability and accuracy of stationary spatial models for large datasets.
Findings
Achieved significant computational speedups in spatial analysis.
Enabled fitting nearly stationary models to large, complex datasets.
Demonstrated practical effectiveness within the LatticeKrig framework.
Abstract
In geostatistics, traditional spatial models often rely on the Gaussian Process (GP) to fit stationary covariances to data. It is well known that this approach becomes computationally infeasible when dealing with large data volumes, necessitating the use of approximate methods. A powerful class of methods approximate the GP as a sum of basis functions with random coefficients. Although this technique offers computational efficiency, it does not inherently guarantee a stationary covariance. To mitigate this issue, the basis functions can be "normalized" to maintain a constant marginal variance, avoiding unwanted artifacts and edge effects. This allows for the fitting of nearly stationary models to large, potentially non-stationary datasets, providing a rigorous base to extend to more complex problems. Unfortunately, the process of normalizing these basis functions is computationally…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSpatial and Panel Data Analysis · Soil Geostatistics and Mapping
