The convergence rates of Shannon sampling learning algorithms
From MaRDI portal
Publication:2392948
DOI10.1007/s11425-012-4371-5zbMath1288.68199OpenAlexW2266252408MaRDI QIDQ2392948
Publication date: 5 August 2013
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-012-4371-5
learning theoryreproducing kernel Hilbert spacesregularization errorsample errorfunction reconstructionShannon sampling learning algorithm
Computational learning theory (68Q32) General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05) Rate of convergence, degree of approximation (41A25)
Related Items
Error analysis on Hérmite learning with gradient data ⋮ Existence and regularity of solutions to semi-linear Dirichlet problem of infinitely degenerate elliptic operators with singular potential term ⋮ The performance of semi-supervised Laplacian regularized regression with the least square loss
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classification with Gaussians and convex loss. II: Improving error bounds by noise conditions
- Mercer theorem for RKHS on noncompact sets
- On summability of weighted Lagrange interpolation. III: Jacobi weights
- On summability of weighted Lagrange interpolation. II.
- Learning rates of least-square regularized regression with polynomial kernels
- Estimates of the norm of the Mercer kernel matrices with discrete orthogonal transforms
- Multivariate irregular sampling theorem
- Generalization performance of graph-based semi-supervised classification
- Mean convergence of Hermite-Fejér interpolation
- Norm estimates for the inverses of a general class of scattered-data radial-function interpolation matrices
- Lower bounds for norms of inverses of interpolation matrices for radial basis functions
- On condition numbers associated with radial-function interpolation
- Riesz basis, Paley-Wiener class and tempered splines
- Recovery of band limited functions via cardinal splines
- On the convergence and saturation problem of a sequence of discrete linear operators of exponential type in \(L_ p(-\infty,\infty)\) spaces
- The covering number in learning theory
- On summability of weighted Lagrange interpolation. I
- Whittaker-Kotelnikov-Shannon sampling theorem and aliasing error
- On the rate of convergence for multi-category classification based on convex losses
- Shannon sampling. II: Connections to learning theory
- On the mathematical foundations of learning
- Applications of Bernstein-Durrmeyer operators in estimating the covering number
- VECTOR VALUED REPRODUCING KERNEL HILBERT SPACES OF INTEGRABLE FUNCTIONS AND MERCER THEOREM
- Applications of the Bernstein-Durrmeyer operators in estimating the norm of Mercer kernel matrices
- Capacity of reproducing kernel spaces in learning theory
- Error estimates for scattered data interpolation on spheres
- Shannon sampling and function reconstruction from point values
- Sampling expansions for functions having values in a Banach space
- Theory of Reproducing Kernels
- Scattered Data Approximation
