On the optimality of target-data-dependent kernel greedy interpolation in Sobolev reproducing kernel Hilbert spaces
From MaRDI portal
Publication:6622686
Recommendations
- On the convergence of generalized kernel-based interpolation by greedy data selection algorithms
- Convergence rate of the data-independent \(P\)-greedy algorithm in kernel-based approximation
- A novel class of stabilized greedy kernel approximation algorithms: convergence, stability and uniform point distribution
- Refined error estimates for Green kernel-based interpolation
- Linearly constrained reconstruction of functions by kernels with applications to machine learning
Cites work
- scientific article; zbMATH DE number 3877692 (Why is no real title available?)
- scientific article; zbMATH DE number 713342 (Why is no real title available?)
- scientific article; zbMATH DE number 3336209 (Why is no real title available?)
- A New Certified Hierarchical and Adaptive RB-ML-ROM Surrogate Model for Parametrized PDEs
- A Newton basis for kernel spaces
- A full order, reduced order and machine learning model pipeline for efficient prediction of reactive flows
- A greedy non-intrusive reduced order model for shallow water equations
- A novel class of stabilized greedy kernel approximation algorithms: convergence, stability and uniform point distribution
- A short note on the comparison of interpolation widths, entropy numbers, and Kolmogorov widths
- Adaptive greedy techniques for approximate solution of large RBF systems
- Analysis of target data-dependent greedy kernel algorithms: convergence rates for \(f\)-, \(f \cdot P\)- and \(f/P\)-greedy
- Approximation of eigenfunctions in kernel-based spaces
- Approximation theory and algorithms for data analysis
- Bases for kernel-based spaces
- Comparison of data-driven uncertainty quantification methods for a carbon dioxide storage benchmark scenario
- Convergence rate of the data-independent \(P\)-greedy algorithm in kernel-based approximation
- Convergence rates for greedy algorithms in reduced basis methods
- Entropy numbers, s-numbers, and eigenvalue problems
- Entropy-based convergence rates of greedy algorithms
- Equally spaced points are optimal for Brownian Bridge kernel interpolation
- Error estimates and condition numbers for radial basis function interpolation
- Greedy algorithms for reduced bases in Banach spaces
- Greedy approximation
- Kernel-based interpolation at approximate Fekete points
- Metric entropy of convex hulls
- Near-optimal data-independent point locations for radial basis function interpolation
- Polynomial interpolation and approximation in \(\mathbb C^d\)
- Polynomial interpolation of holomorphic functions in \(\mathbb{C}\) and \(\mathbb{C}^ n\)
- Recovering missing CFD data for high-order discretizations using deep neural networks and dynamics learning
- Sampling inequalities for infinitely smooth functions, with applications to interpolation and machine learning
- Scattered Data Approximation
- Sharp Bounds on the Approximation Rates, Metric Entropy, and n-Widths of Shallow Neural Networks
- Small errors imply large evaluation instabilities
- Some remarks on greedy algorithms
- Theory of reproducing kernels and applications
This page was built for publication: On the optimality of target-data-dependent kernel greedy interpolation in Sobolev reproducing kernel Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622686)
