Kernel Methods for Surrogate Modeling

Abstract

This chapter deals with kernel methods as a special class of techniques for surrogate modeling. Kernel methods have proven to be efficient in machine learning, pattern recognition and signal analysis due to their flexibility, excellent experimental performance and elegant functional analytic background. These data-based techniques provide so called kernel expansions, i.e., linear combinations of kernel functions which are generated from given input-output point samples that may be arbitrarily scattered. In particular, these techniques are meshless, do not require or depend on a grid, hence are less prone to the curse of dimensionality, even for high-dimensional problems. In contrast to projection-based model reduction, we do not necessarily assume a high-dimensional model, but a general function that models input-output behavior within some simulation context. This could be some micro-model in a multiscale-simulation, some submodel in a coupled system, some initialization function for solvers, coefficient function in PDEs, etc. First, kernel surrogates can be useful if the input-output function is expensive to evaluate, e.g. is a result of a finite element simulation. Here, acceleration can be obtained by sparse kernel expansions. Second, if a function is available only via measurements or a few function evaluation samples, kernel approximation techniques can provide function surrogates that allow global evaluation. We present some important kernel approximation techniques, which are kernel interpolation, greedy kernel approximation and support vector regression. Pseudo-code is provided for ease of reproducibility. In order to illustrate the main features, commonalities and differences, we compare these techniques on a real-world application. The experiments clearly indicate the enormous acceleration potential

References in corpus (7)

• The ROMES method for statistical modeling of reduced-order-model error
• Numerical modelling of a peripheral arterial stenosis using dimensionally reduced models and kernel methods
• Comparison of data-driven uncertainty quantification methods for a carbon dioxide storage benchmark scenario
• liquidSVM: A Fast and Versatile SVM package
• Greedy regularized kernel interpolation
• Greedy kernel methods for accelerating implicit integrators for parametric ODEs
• On the Inclusion Relation of Reproducing Kernel Hilbert Spaces

Cited by in corpus (9)

• A Perspective on Machine Learning Methods in Turbulence Modelling
• A novel class of stabilized greedy kernel approximation algorithms: Convergence, stability & uniform point distribution
• Analysis of target data-dependent greedy kernel algorithms: Convergence rates for $f$-, $f\cdot P$- and $f/P$-greedy
• Kernel methods for center manifold approximation and a data-based version of the Center Manifold Theorem
• Adaptive Interpolatory MOR by Learning the Error Estimator in the Parameter Domain
• Feature space approximation for kernel-based supervised learning
• A full order, reduced order and machine learning model pipeline for efficient prediction of reactive flows
• Kernel-Based Models for Influence Maximization on Graphs based on Gaussian Process Variance Minimization
• Structured Deep Kernel Networks for Data-Driven Closure Terms of Turbulent Flows