Data-Driven Kernel Designs for Optimized Greedy Schemes: A Machine Learning Perspective
From MaRDI portal
Publication:6154961
DOI10.1137/23m1551201arXiv2301.08047OpenAlexW4391435972MaRDI QIDQ6154961
Emma Perracchione, Tizian Wenzel, F. Marchetti
Publication date: 16 February 2024
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.08047
Computational learning theory (68Q32) Interpolation in approximation theory (41A05) Algorithms for approximation of functions (65D15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive greedy techniques for approximate solution of large RBF systems
- Interpolation in the limit of increasingly flat radial basis functions
- Stable computation of multiquadric interpolants for all values of the shape parameter
- Near-optimal data-independent point locations for radial basis function interpolation
- An algorithm for selecting a good value for the parameter \(c\) in radial basis function interpolation
- On the search of the shape parameter in radial basis functions using univariate global optimization methods
- Learning via variably scaled kernels
- Learning dynamical systems from data: a simple cross-validation perspective. I: Parametric kernel flows
- A greedy non-intrusive reduced order model for shallow water equations
- A stochastic extended Rippa's algorithm for LpOCV
- Efficient reduced basis algorithm (ERBA) for kernel-based approximation
- Jumping with variably scaled discontinuous kernels (VSDKs)
- Kernel flows: from learning kernels from data into the abyss
- A novel class of stabilized greedy kernel approximation algorithms: convergence, stability and uniform point distribution
- The extension of Rippa's algorithm beyond LOOCV
- The Runge phenomenon and spatially variable shape parameters in RBF interpolation
- Adaptive LOOCV-based kernel methods for solving time-dependent BVPs
- Analysis of target data-dependent greedy kernel algorithms: convergence rates for \(f\)-, \(f \cdot P\)- and \(f/P\)-greedy
- Principal Angles between Subspaces in an A-Based Scalar Product: Algorithms and Perturbation Estimates
- Active Subspace Methods in Theory and Practice: Applications to Kriging Surfaces
- Active Subspaces
- Surrogate modeling of multiscale models using kernel methods
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Feature augmentation for the inversion of the Fourier transform with limited data
- Convergence rate of the data-independent $P$-greedy algorithm in kernel-based approximation
- A representer theorem for deep kernel learning
- A Correspondence Between Bayesian Estimation on Stochastic Processes and Smoothing by Splines
- Scattered Data Approximation
- A new variable shape parameter strategy for RBF approximation using neural networks
