Convergence rates for matrix P-greedy variants
From MaRDI portal
Publication:3379545
Recommendations
- Convergence rate of the data-independent \(P\)-greedy algorithm in kernel-based approximation
- Greedy Kernel Approximation for Sparse Surrogate Modeling
- A novel class of stabilized greedy kernel approximation algorithms: convergence, stability and uniform point distribution
- Generation of point sets by convex optimization for interpolation in reproducing kernel Hilbert spaces
- Kernel approximation: from regression to interpolation
Cites work
- scientific article; zbMATH DE number 5957433 (Why is no real title available?)
- Convergence rate of the data-independent \(P\)-greedy algorithm in kernel-based approximation
- Convergence rates for greedy algorithms in reduced basis methods
- Convergence rates of the POD-greedy method
- Greedy algorithms for reduced bases in Banach spaces
- Kernels for vector-valued functions: a review
- On Learning Vector-Valued Functions
- Sampling inequalities for infinitely smooth functions, with applications to interpolation and machine learning
- Scattered Data Approximation
Cited in
(5)- Convergence rate of the data-independent \(P\)-greedy algorithm in kernel-based approximation
- Solving interpolation problems on surfaces stochastically and greedily
- A novel class of stabilized greedy kernel approximation algorithms: convergence, stability and uniform point distribution
- Interpolative decomposition via proxy points for kernel matrices
- Analysis of target data-dependent greedy kernel algorithms: convergence rates for \(f\)-, \(f \cdot P\)- and \(f/P\)-greedy
This page was built for publication: Convergence rates for matrix P-greedy variants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3379545)
