Approximation in learning theory
From MaRDI portal
Publication:2482344
DOI10.1007/s00365-006-0655-2OpenAlexW2000166160MaRDI QIDQ2482344
Publication date: 16 April 2008
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00365-006-0655-2
Related Items
Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension ⋮ Upper bounds for errors of estimators in a problem of nonparametric regression: the adaptive case and the case of unknown measure \(\rho _X\) ⋮ Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points ⋮ Concentration estimates for learning with unbounded sampling ⋮ Optimal exponential bounds on the accuracy of classification ⋮ On adaptive estimators in statistical learning theory ⋮ Optimal rates for regularization of statistical inverse learning problems ⋮ Almost optimal estimates for approximation and learning by radial basis function networks ⋮ Adaptive estimation for nonlinear systems using reproducing kernel Hilbert spaces ⋮ Some properties of Gaussian reproducing kernel Hilbert spaces and their implications for function approximation and learning theory ⋮ Variational Monte Carlo -- bridging concepts of machine learning and high-dimensional partial differential equations ⋮ Error Estimates for Multivariate Regression on Discretized Function Spaces ⋮ Learning a function from noisy samples at a finite sparse set of points ⋮ On universal estimators in learning theory ⋮ Unnamed Item
This page was built for publication: Approximation in learning theory
