Generalization bounds for function approximation from scattered noisy data
From MaRDI portal
Publication:1284139
DOI10.1023/A:1018966213079zbMath1053.65506OpenAlexW242422246MaRDI QIDQ1284139
Federico Girosi, Partha Niyogi
Publication date: 1999
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018966213079
Rate of convergence, degree of approximation (41A25) Algorithms for approximation of functions (65D15)
Related Items
An introduction to the use of neural networks in control systems ⋮ Approximation by ridge function fields over compact sets ⋮ On Different Facets of Regularization Theory ⋮ Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm ⋮ Physics-informed neural networks for approximating dynamic (hyperbolic) PDEs of second order in time: error analysis and algorithms ⋮ The mechanism of additive composition ⋮ Using radial basis function networks for function approximation and classification ⋮ Increasing the accuracy of solving discrete ill-posed problems by the random projection method ⋮ Generalization ability of fractional polynomial models ⋮ A neural network method for nonlinear time series analysis ⋮ LATTICE OPTION PRICING BY MULTIDIMENSIONAL INTERPOLATION ⋮ On the Convergence of Physics Informed Neural Networks for Linear Second-Order Elliptic and Parabolic Type PDEs ⋮ Error bounds for approximation with neural networks ⋮ Some properties of Gaussian reproducing kernel Hilbert spaces and their implications for function approximation and learning theory ⋮ Multivariate extensions of isotonic regression and total variation denoising via entire monotonicity and Hardy-Krause variation ⋮ Risk bounds for mixture density estimation ⋮ Learning a function from noisy samples at a finite sparse set of points ⋮ A New Function Space from Barron Class and Application to Neural Network Approximation
