Density problem and approximation error in learning theory
Summary: We study the density problem and approximation error of reproducing kernel Hilbert spaces for the purpose of learning theory. For a Mercer kernel \(K\) on a compact metric space \((X,d)\), a characterization for the generated reproducing kernel Hilbert space (RKHS) \(\mathcal{H}_K\) to be dense in \(C(X)\) is given. As a corollary, we show that the density is always true for convolution type kernels. Some estimates for the rate of convergence of interpolation schemes are presented for general Mercer kernels. These are then used to establish for convolution type kernels quantitative analysis for the approximation error in learning theory. Finally, we show by the example of Gaussian kernels with varying variances that the approximation error can be improved when we adaptively change the value of the parameter for the used kernel. This confirms the method of choosing varying parameters which is used often in many applications of learning theory.
- Capacity of reproducing kernel spaces in learning theory
- Choosing multiple parameters for support vector machines
- Eigenvalues of euclidean distance matrices
- Error estimates for scattered data interpolation on spheres
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- scientific article; zbMATH DE number 4052203 (Why is no real title available?)
- scientific article; zbMATH DE number 19417 (Why is no real title available?)
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 803197 (Why is no real title available?)
- scientific article; zbMATH DE number 822284 (Why is no real title available?)
- scientific article; zbMATH DE number 3246460 (Why is no real title available?)
- Interpolation of scattered data: distance matrices and conditionally positive definite functions
- Local error estimates for radial basis function interpolation of scattered data
- Lower bounds for norms of inverses of interpolation matrices for radial basis functions
- Networks and the best approximation property
- Norm estimates for the inverses of a general class of scattered-data radial-function interpolation matrices
- Norms of inverses and condition numbers for matrices associated with scattered data
- On the influence of the kernel on the consistency of support vector machines
- On the mathematical foundations of learning
- Positive definite dot product kernels in learning theory
- Practical Approximate Solutions to Linear Operator Equations When the Data are Noisy
- Regularization networks and support vector machines
- Strictly positive definite functions on a real inner product space
- The covering number in learning theory
- Theory of Reproducing Kernels
- Learning distributions by their density levels: A paradigm for learning without a teacher
- A simpler approach to coefficient regularized support vector machines regression
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- On the K-functional in learning theory
- LEARNING RATES FOR DENSITY LEVEL DETECTION
- Convergence analysis for kernel-regularized online regression associated with an RRKHS
- Moduli of smoothness, \(K\)-functionals and Jackson-type inequalities associated with Kernel function approximation in learning theory
This page was built for publication: Density problem and approximation error in learning theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2319010)
