SearcharxivSearch

arXiv · 2503.16027

Deep Gaussian Process Emulation with gradient Information and Sequential Design for Simulators with Sharp Variations

Abstract

Deep Gaussian Processes (DGPs) compose GP layers to warp inputs, enabling improved emulation of computer models with nonstationary input-output behavior compared with ordinary GPs. In contrast to GPs, the predictive uncertainty for DGP gradients remains relatively underexplored. Quantifying DGP gradient uncertainty can support gradient-based tasks in complex, nonstationary settings where ordinary GPs may struggle. While GP gradient posteriors are analytically tractable, extending such constructions to DGPs is challenging due to their hierarchical composition. In this paper, we propose an efficient approximation to the gradient distribution of a two-layer DGP emulator. Using the chain rule with local linearization, we derive closed-form expressions for the gradient mean and covariance, enabling fast gradient evaluation with uncertainty quantification (UQ). Empirically, our approach delivers promising performance while uniquely providing UQ of gradients. We then use the gradient uncertainties to guide sequential design for models with sharp variations: we define sharp variation regions as those where the gradient norm exceeds a threshold. We subsequently introduce an entropy-based acquisition rule that selects new samples in locations where the classification of points as inside versus outside the sharp-variation region is most uncertain. Experiments on synthetic benchmarks and a real-world application show that the resulting sequential design more accurately emulates functions with sharp variations than existing design methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yiming Yang, Deyu Ming, Serge Guillas. 2025-03-20. Deep Gaussian Process Emulation with gradient Information and Sequential Design for Simulators with Sharp Variations. https://arxiv.org/abs/2503.16027

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO