Surrogate modeling of multifidelity data for large samples

  • E. V. BurnaevEmail author
  • A. A. Zaytsev
Mathematical Models and Computational Methods


The problem of construction of a surrogate model based on available lowand high-fidelity data is considered. The low-fidelity data can be obtained, e.g., by performing the computer simulation and the high-fidelity data can be obtained by performing experiments in a wind tunnel. A regression model based on Gaussian processes proves to be convenient for modeling variable-fidelity data. Using this model, one can efficiently reconstruct nonlinear dependences and estimate the prediction accuracy at a specified point. However, if the sample size exceeds several thousand points, direct use of the Gaussian process regression becomes impossible due to a high computational complexity of the algorithm. We develop new algorithms for processing multifidelity data based on Gaussian process model, which are efficient even for large samples. We illustrate application of the developed algorithms by constructing surrogate models of a complex engineering system.


multifidelity data uncertainty estimate Gaussian processes covariance matrix approximation cokriging 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. I. J. Forrester, A. Sóbester, and A. J. Keane, Engineering Design Via Surrogate Modeling: A Practical Guide. Progress in Astronautics and Aeronautics (Wiley, New-York, 2008).CrossRefGoogle Scholar
  2. 2.
    N. A. C. Cressie and N. A. Cassie, Statistics for Spatial Data (Wiley, New York, 1993). Vol. 900.Google Scholar
  3. 3.
    C. E. Rasmussen and C. K. I. Williams, Gaussian Processes for Machine Learning (MIT Press, Cambridge, MA, 2006).zbMATHGoogle Scholar
  4. 4.
    A. I. J. Forrester, A. Sóbester, and A. J. Keane, “Multifidelity optimization via surrogate modelling,” Proc. Royal Soc. A: Math, Phys. Engineering Sci. 463, 3251–3269 (2007).CrossRefzbMATHGoogle Scholar
  5. 5.
    M. C. Kennedy and A. O’Hagan, “Predicting the output from a complex computer code when fast approximations are available,” Biometrika 87, 1–13 (2000).CrossRefMathSciNetzbMATHGoogle Scholar
  6. 6.
    S. Koziel, S. Ogurtsov, I. Couckuyt, and T. Dhaene, “Cost-efficient electromagnetic-simulation-driven antenna design using co-kriging,” IET Microwaves, Antennas & Propagation, 6, 1521–1528 (2012).CrossRefGoogle Scholar
  7. 7.
    E. Snelson and Z. Ghahramani, “Sparse gaussian processes using pseudo-inputs,” Adv. Neural Inf. Process. Syst. 18, 1257–1264 (2006).Google Scholar
  8. 8.
    J. Quiñonero-Candela and C. E. Rasmussen, “A unifying view of sparse approximate gaussian process regression,” J. Mach. Learn. Res. 6, 1939–1959 (2005).MathSciNetzbMATHGoogle Scholar
  9. 9.
    L. Foster, A. Waagen, N. Aijaz, M. Hurley, A. Luis, J. Rinsky, C. Satyavolu, M. J. Way, P. Gazis, and A. Srivastava, “Stable and efficient gaussian process calculations,” J. Mach. Learn. Res. 10, 857–882 (2009).MathSciNetzbMATHGoogle Scholar
  10. 10.
    P. Drineas and M. W. Mahoney, “On the nyström method for approximating a gram matrix for improved kernel-based learning,” J. Mach. Learn. Res. 6, 2153–2175 (2005).MathSciNetzbMATHGoogle Scholar
  11. 11.
    A. A. Zaytsev, E. V. Burnaev, and V. G. Spokoiny, “Properties of the bayesian parameter estimation of a regression based on gaussian processes,” J. Math. Sci. 203, 789–798 (2014).CrossRefzbMATHGoogle Scholar
  12. 12.
    F. Bachoc, “Cross validation and maximum likelihood estimations of hyper-parameters of gaussian processes with model misspecification,” Comput. Stat. Data Analysis, 66, 55–69 (2013).CrossRefMathSciNetGoogle Scholar
  13. 13.
    G. H. Golub and Ch. F. Van Loan, Matrix Computations (Johns Hopkins Univ., London, 2012). Vol. 3.Google Scholar
  14. 14.
    J.-S. Park, “Optimal latin-hypercube designs for computer experiments,” J. Stat. Plann. Infer. 39, 95–111 (1994).CrossRefzbMATHGoogle Scholar
  15. 15.
    D. Karaboga and B. Basturk, “A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm,” J. Global Optim., 39, 459–471 (2007).CrossRefMathSciNetzbMATHGoogle Scholar
  16. 16.
    S. C. Armand, Structural Optimization Methodology for Rotating Disks of Aircraft Engines. Technical Report (National Aeronautics and Space Administration, Office of Management, Scientific and Technical Information Program, 1995).Google Scholar
  17. 17.
    J. Ch. Butcher, Numerical Methods for Ordinary Differential Equations (Wiley Online Library, 2005).Google Scholar

Copyright information

© Pleiades Publishing, Inc. 2015

Authors and Affiliations

  1. 1.Kharkevich Institute for Information Transmission Problems (IITP)Russian Academy of SciencesMoscowRussia
  2. 2.OOO DatadvansMoscowRussia
  3. 3.Laboratory of Predictive Modeling and Data Analysis, Moscow Institute of Physics and TechnologyState UniversityDolgoprudnyi, Moscow oblastRussia

Personalised recommendations