Linearly constrained reconstruction of functions by kernels with applications to machine learning

DOI10.1007/s10444-004-7616-1zbMath1106.65008OpenAlexW2023409392MaRDI QIDQ2498389

Yanyan Li

Publication date: 16 August 2006

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10444-004-7616-1

zbMATH Keywords

quadratic programmingHilbert spacenumerical experimentsgreedy algorithmreproducing kernelregressionvector machinessupport vectorspositive definite radial basis functions

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Learning and adaptive systems in artificial intelligence (68T05) Numerical interpolation (65D05) Multidimensional problems (41A63) Algorithms for approximation of functions (65D15) Approximation by other special function classes (41A30) Saturation in approximation theory (41A40)

Related Items

A greedy non-intrusive reduced order model for shallow water equations, Surrogate modeling of multiscale models using kernel methods, Kernel-based adaptive approximation of functions with discontinuities, Reproducing kernel Hilbert spaces associated with analytic translation-invariant Mercer kernels, Derivative reproducing properties for kernel methods in learning theory, Cholesky-Based Experimental Design for Gaussian Process and Kernel-Based Emulation and Calibration

Cites Work

• Interpolation of scattered data: distance matrices and conditionally positive definite functions
• Optimal recovery of best approximations
• The optimal recovery of smooth functions
• Positive definite functions and generalizations, an historical survey
• Adaptive greedy techniques for approximate solution of large RBF systems
• Near-optimal data-independent point locations for radial basis function interpolation
• Chebyshev approximation by spline functions with free knots
• Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item