{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:35:27Z","timestamp":1787333727077,"version":"build-2736575974"},"reference-count":45,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"6","funder":[{"DOI":"10.13039\/501100004955","name":"\u00d6sterreichische Forschungsf\u00f6rderungsgesellschaft","doi-asserted-by":"crossref","award":["881147"],"award-info":[{"award-number":["881147"]}],"id":[{"id":"10.13039\/501100004955","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2023,12,31]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>Gradient-enhanced Kriging (GE-Kriging) is a well-established surrogate modeling 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 hyperparameter 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 hyperparameters. We first split the training sample set into multiple slices, and invoke Bayes\u2019 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 hyperparameter tuning problem with a low-dimensional counterpart by learning the relationship between the hyperparameters 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.<\/jats:p>","DOI":"10.1137\/22m154315x","type":"journal-article","created":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T04:28:43Z","timestamp":1700108923000},"page":"A2858-A2885","source":"Crossref","is-referenced-by-count":9,"title":["Sliced Gradient-Enhanced Kriging for High-Dimensional Function Approximation"],"prefix":"10.1137","volume":"45","author":[{"given":"Kai","family":"Cheng","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Southern Denmark (SDU) Odense, Odense, DK-5230, Denmark."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1692-3996","authenticated-orcid":true,"given":"Ralf","family":"Zimmermann","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Southern Denmark (SDU) Odense, Odense, DK-5230, Denmark."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2023,11,16]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.heliyon.2018.e00938"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7930(98)00041-3"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2010.12.021"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-020-02488-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-018-0590-x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2018.11.048"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2020.112861"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2017.09.002"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2020.107286"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-019-02413-5"},{"key":"ref11","doi-asserted-by":"crossref","unstructured":"H.S. Chung and J. J. Alonso, Using gradients to construct cokriging approximation models for high-dimensional design optimization problems, in 40th AIAA Aerospace Sciences Meeting & Exhibit, American Institute of Aeronautics and Astronautics, Reston, VA, 2002, AIAA 2002-0317.","DOI":"10.2514\/6.2002-317"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1080\/00949655.2014.945932"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2514\/1.J053813"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106356"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ast.2012.01.006"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.2514\/1.J055842"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2514\/3.58379"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbspro.2010.05.208"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008306431147"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7161(96)13011-X"},{"key":"ref21","series-title":"Modern Analytic and Computational Methods in Science and Mathematics 13","volume-title":"Methods for Unconstrained Optimization Problems","author":"Kowalik J. S.","year":"1968"},{"key":"ref22","first-page":"119","volume":"52","author":"Krige D. G.","journal-title":"J. South. Afr. Inst. Min. Metall."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-33507-0_23"},{"key":"ref24","unstructured":"L. Le Gratiet, Multi-fidelity Gaussian Process Regression for Computer Experiments, Ph.D. thesis, Universit\u00e9 Paris-Diderot-Paris VII, Paris, 2013."},{"key":"ref25","unstructured":"W. Liu, Development of Gradient-Enhanced Kriging Approximations for Multidisciplinary Design Optimization, Ph.D. thesis, University of Notre Dame, Notre Dame, IN, 2003."},{"key":"ref26","doi-asserted-by":"crossref","unstructured":"W. Liu and S. Batill, Gradient-enhanced response surface approximations using kriging models, in 9th AIAA\/ISSMO Symposium on Multidisciplinary Analysis and Optimization, American Institute of Aeronautics and Astronautics, Reston, VA, 2002, AIAA 2002\u20135456.","DOI":"10.2514\/6.2002-5456"},{"key":"ref27","unstructured":"S. N. Lophaven, H. B. Nielsen, and J.S\u00f8ndergaard, DACE: A Matlab Kriging Toolbox, Technical report IMM-TR-2002-12, Version 2.0, Technical University of Denmark, Lyngby, Denmark, 2002."},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/21M1397908"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.2012.725994"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.1993.10485320"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/080743627"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.paerosci.2005.02.001"},{"key":"ref33","series-title":"Summer School Mach. Learn.","first-page":"63","volume-title":"Advanced Lectures on Machine Learning","author":"Rasmussen C. E.","year":"2003"},{"key":"ref34","unstructured":"B. Rosenbaum, Efficient Global Surrogate Models for Responses of Expensive Simulations, Ph.D. thesis, Trier University, Trier, Germany, 2013."},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177012413"},{"key":"ref36","volume-title":"Global Sensitivity Analysis: The Primer","author":"Saltelli A.","year":"2008"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1023\/B:STCO.0000035301.49549.88"},{"key":"ref38","volume-title":"The Nature of Statistical Learning Theory","author":"Vapnik V.","year":"1999"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2015.05.018"},{"key":"ref40","volume-title":"Gaussian Processes for Machine Learning","volume":"2","author":"Williams C. K.","year":"2006"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827501387826"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/21M1432739"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-019-02342-3"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/13092229X"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2014.10.038"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/22M154315X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:19:51Z","timestamp":1787332791000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/22M154315X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,16]]},"references-count":45,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12,31]]}},"alternative-id":["10.1137\/22M154315X"],"URL":"https:\/\/doi.org\/10.1137\/22m154315x","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,16]]}}}