Refined rates of convergence for target-data dependent greedy generalized interpolation with Sobolev kernels

Abstract

Greedy methods have recently been successfully applied to generalized kernel interpolation, or the recovery of a function from data stemming from the evaluation of linear functionals, including the approximation of solutions of linear PDEs by symmetric collocation. When applied to kernels generating Sobolev spaces as their native Hilbert spaces, some of these greedy methods can provide the same error guarantee of generalized interpolation on quasi-uniform points. More importantly, certain target-data-adaptive methods even give a dimension- and smoothness-independent improvement in the speed of convergence over quasi-uniform points, thus offering advantages for high-dimensional problems. These convergence rates however contain a spurious logarithmic term that limits this beneficial effect. The goal of this note is to remove this factor, and this is possible by using estimates on metric entropy numbers.

References in corpus (6)

• 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
• Entropy-based convergence rates of greedy algorithms
• Kernel Methods for the Approximation of the Eigenfunctions of the Koopman Operator
• On the optimality of target-data-dependent kernel greedy interpolation in Sobolev Reproducing Kernel Hilbert Spaces
• Adaptive meshfree approximation for linear elliptic partial differential equations with PDE-greedy kernel methods