Convergence Rates of Approximation by Translates

Authors:
Federico Girosi;Gabriele Anzellotti
Affiliations:
-;-
Venue:
Convergence Rates of Approximation by Translates
Year:
1992

Citing 0
Cited 7

Robust fuzzy control of nonlinear systems using shape-adaptive radial basis functions

Fuzzy Sets and Systems - Fuzzy control
Analysis of Tikhonov regularization for function approximation by neural networks

Neural Networks
Bandwidth of mechanical systems and design of emulators with RBF

Neurocomputing
Functions bandlimited in frequency are free of the curse of dimensionality

Neurocomputing
A nonparametric procedure for blind image deblurring

Computational Statistics & Data Analysis
Analysis of the errors in the modelling of manipulators with Gaussian RBF neural networks

Neurocomputing
Selective weight update rule for hybrid neural network

ISNN'12 Proceedings of the 9th international conference on Advances in Neural Networks - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of approximating a function belonging to some function space by a linear combination of $n$ translates of a given function. Using a lemma by Jones (1990) and Barron (1991) we show that it is possible to define function spaces for which the rate of convergence to zero of the error is $O({1 \over \sqrt n})$ in any number of dimensions. The apparent avoidance of the ``curse of dimensionality'''' is due to the fact that these function spaces are more and more constrained as the dimension increases.