Convergence rate of the data-independent P-greedy algorithm in kernel-based approximation
From MaRDI portal
Convergence rate of the data-independent \(P\)-greedy algorithm in kernel-based approximation
Abstract: Kernel-based methods provide flexible and accurate algorithms for the reconstruction of functions from meshless samples. A major question in the use of such methods is the influence of the samples locations on the behavior of the approximation, and feasible optimal strategies are not known for general problems. Nevertheless, efficient and greedy point-selection strategies are known. This paper gives a proof of the convergence rate of the data-independent extit{-greedy} algorithm, based on the application of the convergence theory for greedy algorithms in reduced basis methods. The resulting rate of convergence is shown to be near-optimal in the case of kernels generating Sobolev spaces. As a consequence, this convergence rate proves that, for kernels of Sobolev spaces, the points selected by the algorithm are asymptotically uniformly distributed, as conjectured in the paper where the algorithm has been introduced.
Recommendations
- A novel class of stabilized greedy kernel approximation algorithms: convergence, stability and uniform point distribution
- Convergence rates for matrix P-greedy variants
- Convergence rates for greedy algorithms in reduced basis methods
- On the convergence rate of kernel-based sequential greedy regression
- Convergence rates of the POD-greedy method
Cited in
(34)- RBF-based partition of unity methods for elliptic PDEs: adaptivity and stability issues via variably scaled kernels
- Kernel-based interpolation at approximate Fekete points
- Kernel methods for center manifold approximation and a weak data-based version of the center manifold theorem
- Stable interpolation with exponential-polynomial splines and node selection via greedy algorithms
- Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization
- Sampling based approximation of linear functionals in reproducing kernel Hilbert spaces
- A greedy non-intrusive reduced order model for shallow water equations
- Efficient reduced basis algorithm (ERBA) for kernel-based approximation
- Graph signal interpolation with positive definite graph basis functions
- Nyström landmark sampling and regularized Christoffel functions
- Generation of point sets by convex optimization for interpolation in reproducing kernel Hilbert spaces
- An adaptive sparse kernel technique in greedy algorithm framework to simulate an anomalous solute transport model
- A novel class of stabilized greedy kernel approximation algorithms: convergence, stability and uniform point distribution
- Residual Gaussian process: a tractable nonparametric Bayesian emulator for multi-fidelity simulations
- Comparison of data-driven uncertainty quantification methods for a carbon dioxide storage benchmark scenario
- Analysis of target data-dependent greedy kernel algorithms: convergence rates for \(f\)-, \(f \cdot P\)- and \(f/P\)-greedy
- Convergence rates for matrix P-greedy variants
- 9 Kernel methods for surrogate modeling
- Biomechanical surrogate modelling using stabilized vectorial greedy kernel methods
- Greedy Kernel Approximation for Sparse Surrogate Modeling
- Small errors imply large evaluation instabilities
- Quasi-uniform designs with optimal and near-optimal uniformity constant
- A New Certified Hierarchical and Adaptive RB-ML-ROM Surrogate Model for Parametrized PDEs
- Model reduction of coupled systems based on non-intrusive approximations of the boundary response maps
- Data-Driven Kernel Designs for Optimized Greedy Schemes: A Machine Learning Perspective
- Classifier-dependent feature selection via greedy methods
- On the optimality of target-data-dependent kernel greedy interpolation in Sobolev reproducing kernel Hilbert spaces
- On the convergence of generalized kernel-based interpolation by greedy data selection algorithms
- Be greedy and learn: efficient and certified algorithms for parametrized optimal control problems
- Spectral alignment of kernel matrices and applications
- Stability of convergence rates: kernel interpolation on non-Lipschitz domains
- Product kernels are efficient and flexible tools for high-dimensional scattered data interpolation
- Adaptive meshfree approximation for linear elliptic partial differential equations with PDE-greedy kernel methods
- Greedy adaptive local recovery of functions in Sobolev spaces
This page was built for publication: Convergence rate of the data-independent \(P\)-greedy algorithm in kernel-based approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5355342)
