Pith. sign in

REVIEW 1 cited by

Scaled Vecchia approximation for fast computer-model emulation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2005.00386 v4 pith:W3U7KCOQ submitted 2020-05-01 stat.ME stat.COstat.ML

classification stat.MEstat.COstat.ML
keywords computerinputexperimentsmethodsanalysisapproximationcomputer-modelemulation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Many scientific phenomena are studied using computer experiments consisting of multiple runs of a computer model while varying the input settings. Gaussian processes (GPs) are a popular tool for the analysis of computer experiments, enabling interpolation between input settings, but direct GP inference is computationally infeasible for large datasets. We adapt and extend a powerful class of GP methods from spatial statistics to enable the scalable analysis and emulation of large computer experiments. Specifically, we apply Vecchia's ordered conditional approximation in a transformed input space, with each input scaled according to how strongly it relates to the computer-model response. The scaling is learned from the data, by estimating parameters in the GP covariance function using Fisher scoring. Our methods are highly scalable, enabling estimation, joint prediction and simulation in near-linear time in the number of model runs. In several numerical examples, our approach substantially outperformed existing methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Streaming Sparse Cholesky Method for Derivative-Informed Gaussian Process Surrogates Within Digital Twin Applications

    stat.ML 2025-11 conditional novelty 5.0 of 10

    A dynamic sparse Cholesky solver for derivative-augmented Gaussian processes enables streaming updates for digital twin surrogates, with gains shown on simulated fatigue crack growth.

Pith tools