Learning a function from noisy samples at a finite sparse set of points
From MaRDI portal
Recommendations
- Generalization bounds for function approximation from scattered noisy data
- Shannon sampling. II: Connections to learning theory
- A deterministic learning approach based on discrepancy.
- Learning general sparse additive models from point queries in high dimensions
- Deterministic error bounds for kernel-based learning techniques under bounded noise
Cites work
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 1049042 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 3360568 (Why is no real title available?)
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Approximation in learning theory
- Approximation methods for supervised learning
- Asymptotic Theory of Filtering for Linear Operator Equations with Discrete Noisy Data
- Bounds for the weighted L^p discrepancy and tractability of integration
- Comparisons of parameter choice methods for regularization with discrete noisy data
- Consistency and rates of convergence of nonlinear Tikhonov regularization with random noise
- Convergence Rates of Approximate Least Squares Solutions of Linear Integral and Operator Equations of the First Kind
- Equivalent Norms for Sobolev Spaces
- Error bounds for approximation with neural networks
- Generalization bounds for function approximation from scattered noisy data
- Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm
- Nonlinear methods of approximation
- On the mathematical foundations of learning
- On tractability of weighted integration over bounded and unbounded regions in ℝ^{𝕤}
- Rates of convex approximation in non-Hilbert spaces
- Regularization networks and support vector machines
- Regularized data-driven construction of fuzzy controllers
- Regularized greedy algorithms for network training with data noise
- Shannon sampling and function reconstruction from point values
- Some applications of multidimensional integration by parts
- Theory of Reproducing Kernels
- Universal approximation bounds for superpositions of a sigmoidal function
- Weighted Interpolation Inequalities of Sum and Product form in R n
- Weighted Sobolev interpolation inequalities on product spaces
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Über die Diskrepanz mehrdimensionaler Folgen mod 1
Cited in
(5)- Deterministic error analysis of kernel regularized regression for spherical scattered data
- Deterministic error bounds for kernel-based learning techniques under bounded noise
- Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm
- A deterministic learning approach based on discrepancy.
- The weight-decay technique in learning from data: an optimization point of view
This page was built for publication: Learning a function from noisy samples at a finite sparse set of points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1048968)
