Convergence rate of the data-independent $P$-greedy algorithm in kernel-based approximation
From MaRDI portal
Publication:5355342
zbMath1370.94401arXiv1612.02672MaRDI QIDQ5355342
Bernard Haasdonk, Gabriele Santin
Publication date: 7 September 2017
Full work available at URL: https://arxiv.org/abs/1612.02672
Related Items (24)
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 ⋮ Small errors imply large evaluation instabilities ⋮ Comparison of data-driven uncertainty quantification methods for a carbon dioxide storage benchmark scenario ⋮ Generation of point sets by convex optimization for interpolation in reproducing kernel Hilbert spaces ⋮ 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 ⋮ Analysis of target data-dependent greedy kernel algorithms: convergence rates for \(f\)-, \(f \cdot P\)- and \(f/P\)-greedy ⋮ 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 ⋮ RBF-based partition of unity methods for elliptic PDEs: adaptivity and stability issues via variably scaled kernels ⋮ Kernel-based interpolation at approximate Fekete points ⋮ Convergence Rates for Matrix P-Greedy Variants ⋮ 9 Kernel methods for surrogate modeling ⋮ Greedy Kernel Approximation for Sparse Surrogate Modeling ⋮ 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
This page was built for publication: Convergence rate of the data-independent $P$-greedy algorithm in kernel-based approximation
