Papers › A Statistical Learning View of Simple Kriging

A Statistical Learning View of Simple Kriging

15 Feb 2022arXiv:2202.07365archive 2025-07-28

Emilia Siviero, Emilie Chautru, Stephan Clémençon

In the Big Data era, with the ubiquity of geolocation sensors in particular, massive datasets exhibiting a possibly complex spatial dependence structure are becoming increasingly available. In this context, the standard probabilistic theory of statistical learning does not apply directly and guarantees of the generalization capacity of predictive rules learned from such data are left to establish. We analyze here the simple Kriging task from a statistical learning perspective, i.e. by carrying out a nonparametric finite-sample predictive analysis. Given d≥1 values taken by a realization of a square integrable random field X={Xₛ}_(s∈S), S⊂ℝ², with unknown covariance structure, at sites s₁, …, s_d in S, the goal is to predict the unknown values it takes at any other location s∈S with minimum quadratic risk. The prediction rule being derived from a training spatial dataset: a single realization X′ of X, independent from those to be predicted, observed at n≥1 locations σ₁, …, σₙ in S. Despite the connection of this minimization problem with kernel ridge regression, establishing the generalization capacity of empirical risk minimizers is far from straightforward, due to the non independent and identically distributed nature of the training data X′_(σ₁), …, X′_(σₙ) involved in the learning procedure. In this article, non-asymptotic bounds of order O_ℙ(1/√(n)) are proved for the excess risk of a plug-in predictive rule mimicking the true minimizer in the case of isotropic stationary Gaussian processes, observed at locations forming a regular grid in the learning stage. These theoretical results are illustrated by various numerical experiments, on simulated data and on real-world datasets.

PaperPDFCode

Code

emiliasiv/simple-kriging-code officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Gaussian Processes

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

NON

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections