Sliced gradient-enhanced Kriging for high-dimensional function approximation
Not on the map. Why?
Abstract (arXiv)
Gradient-enhanced Kriging (GE-Kriging) is a well-established surrogate modelling technique for approximating expensive computational models. However, it tends to get impractical for high-dimensional problems due to the size of the inherent correlation matrix and the associated high-dimensional hyper-parameter tuning problem. To address these issues, a new method, called sliced GE-Kriging (SGE-Kriging), is developed in this paper for reducing both the size of the correlation matrix and the number of hyper-parameters. We first split the training sample set into multiple slices, and invoke Bayes' theorem to approximate the full likelihood function via a sliced likelihood function, in which multiple small correlation matrices are utilized to describe the correlation of the sample set rather than one large one. Then, we replace the original high-dimensional hyper-parameter tuning problem with a low-dimensional counterpart by learning the relationship between the hyper-parameters and the derivative-based global sensitivity indices. The performance of SGE-Kriging is finally validated by means of numerical experiments with several benchmarks and a high-dimensional aerodynamic modeling problem. The results show that the SGE-Kriging model features an accuracy and robustness that is comparable to the standard one but comes at much less training costs. The benefits are most evident for high-dimensional problems with tens of variables.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 3 of its 50 references that are in the map. First posted on arXiv 5 Apr 2022.
Builds on
3 of 50 references.
References · 3
- 2021Physics-informed neural networks with hard constraints for inverse designcited by 277
- 2017Gradient-enhanced kriging for high-dimensional problemscited by 15
- 2013Global Sensitivity Analysis with Dependence Measurescited by 12
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 0; 2026: 1.
3 papers.
- 2023GPLaSDI: Gaussian Process-based Interpretable Latent Space Dynamics Identification through Deep Autoencodercited by 29
- 2024A Comprehensive Review of Latent Space Dynamics Identification Algorithms for Intrusive and Non-Intrusive Reduced-Order-Modelingcited by 22
- 2026A Tutorial Review of Bayesian Optimization with Gaussian Processes to Accelerate Stationary Point Searchescited by 0
- 2026A Tutorial Review of Bayesian Optimization with Gaussian Processes to Accelerate Stationary Point Searches11 Mar 2026
- 2024A Comprehensive Review of Latent Space Dynamics Identification Algorithms for Intrusive and Non-Intrusive Reduced-Order-Modeling16 Mar 2024
- 2023GPLaSDI: Gaussian Process-based Interpretable Latent Space Dynamics Identification through Deep Autoencoder10 Aug 2023