mlsanityData to 7 Oct 2026

Assessing the performance of correlation-based multi-fidelity neural emulators

arXiv 2512.02868 ↗First posted 2 Dec 2025cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Outer loop tasks such as optimization, uncertainty quantification or inference can easily become intractable when the underlying high-fidelity model is computationally expensive. Similarly, data-driven architectures typically require large datasets to perform predictive tasks with sufficient accuracy. A possible approach to mitigate these challenges is the development of multi-fidelity emulators, leveraging potentially biased, inexpensive low-fidelity information while correcting and refining predictions using scarce, accurate high-fidelity data. This study investigates the performance of multi-fidelity neural emulators, neural networks designed to learn the input-to-output mapping by integrating limited high-fidelity data with abundant low-fidelity model solutions. We investigate the performance of such emulators for low and high-dimensional functions, with oscillatory character, in the presence of discontinuities, for collections of models with equal and dissimilar parametrization, and for a possibly large number of potentially corrupted low-fidelity sources. In doing so, we consider a large number of architectural, hyperparameter, and dataset configurations including networks with a different amount of spectral bias (Multi-Layered Perceptron, Siren and Kolmogorov Arnold Network), various mechanisms for coordinate encoding, exact or learnable low-fidelity information, and for varying training dataset size. We further analyze the added value of the multi-fidelity approach by conducting equivalent single-fidelity tests for each case, quantifying the performance gains achieved through fusing multiple sources of information.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 18 of its 57 references that are in the map. First posted on arXiv 2 Dec 2025.

Builds on

18 of 57 references.

References · 18

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2020Fourier Neural Operator for Parametric Partial Differential Equationscited by 2,806
  3. 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,214
  4. 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,170
  5. 2019DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operatorscited by 1,965
  6. 2024KAN: Kolmogorov-Arnold Networkscited by 634
  7. 2022PDEBENCH: An Extensive Benchmark for Scientific Machine Learningcited by 396
  8. 2024Kolmogorov-Arnold Networks are Radial Basis Function Networkscited by 125
  9. 2024Wav-KAN: Wavelet Kolmogorov-Arnold Networkscited by 118
  10. 2024Chebyshev Polynomial-Based Kolmogorov-Arnold Networks: An Efficient Architecture for Nonlinear Function Approximationcited by 115
  11. 2022Multifidelity deep neural operators for efficient learning of partial differential equations with application to fast inverse design of nanoscale heat transportcited by 92
  12. 2020The Kolmogorov-Arnold representation theorem revisitedcited by 89
6 more
  1. 2022Multifidelity Deep Operator Networks For Data-Driven and Physics-Informed Problemscited by 57
  2. 2022Multi-fidelity surrogate modeling using long short-term memory networkscited by 18
  3. 2021Transfer Learning on Multi-Fidelity Datacited by 17
  4. 2022Multi-fidelity Hierarchical Neural Processescited by 15
  5. 2019Function approximation by deep networkscited by 10
  6. 2020MFNets: Data efficient all-at-once learning of multifidelity surrogates as directed networks of information sourcescited by 10

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.