Open AccessPosted Content
Kernel Methods for Surrogate Modeling.
Gabriele Santin,Bernard Haasdonk +1 more
TL;DR: This chapter deals with kernel methods as a special class of techniques for surrogate modeling, which are meshless, do not require or depend on a grid, hence are less prone to the curse of dimensionality, even for high-dimensional problems.
read more
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
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Scattered Data Approximation
Marcel Urner
- 01 Jan 2016
TL;DR: Scattered data approximation is available in our book collection an online access to it is set as public so you can get it instantly.Thank you for reading scattered data approximation.
1K
A perspective on machine learning methods in turbulence modeling
Andrea Beck,Marius Kurz +1 more
TL;DR: A survey of the current data‐driven model concepts and methods, highlight important developments, and put them into the context of the discussed challenges, mostly from the perspective of large Eddy simulation and related techniques.
124
Learning dynamical systems from data: A simple cross-validation perspective, part I: Parametric kernel flows
Boumediene Hamzi,Houman Owhadi +1 more
TL;DR: Variants of cross-validation and its variants based on Maximum Mean Discrepancy and Lyapunov exponents are presented as simple approaches for learning the kernel used in these emulators.
A novel class of stabilized greedy kernel approximation algorithms: Convergence, stability and uniform point distribution
TL;DR: These results allow to prove, in the case of certain Sobolev kernels, that the algorithms have optimal stability and optimal convergence rates, including for functions outside the native space of the kernel.
51
References
LIBSVM: A library for support vector machines
Chih-Chung Chang,Chih-Jen Lin +1 more
TL;DR: Issues such as solving SVM optimization problems theoretical convergence multiclass classification probability estimates and parameter selection are discussed in detail.
Regression Shrinkage and Selection via the Lasso
TL;DR: A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
Statistical learning theory
Vladimir Vapnik
- 01 Jan 1998
TL;DR: Presenting a method for determining the necessary and sufficient conditions for consistency of learning process, the author covers function estimates from small data pools, applying these estimations to real-life problems, and much more.
30.4K
A training algorithm for optimal margin classifiers
Bernhard E. Boser,Isabelle Guyon,Vladimir Vapnik +2 more
- 01 Jul 1992
TL;DR: A training algorithm that maximizes the margin between the training patterns and the decision boundary is presented, applicable to a wide variety of the classification functions, including Perceptrons, polynomials, and Radial Basis Functions.
Atomic Decomposition by Basis Pursuit
TL;DR: Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions.
11.3K