Universal approximation using radial-basis-function networks
Neural Computation
Approximation and radial-basis-function networks
Neural Computation
Approximation by ridge functions and neural networks with one hidden layer
Journal of Approximation Theory
Advances in Applied Mathematics
Uniform approximation by neural networks
Journal of Approximation Theory
Approximation by ridge functions and neural networks
SIAM Journal on Mathematical Analysis
On best approximation by ridge functions
Journal of Approximation Theory
On best approximation of classes by radial functions
Journal of Approximation Theory
Zonal function network frames on the sphere
Neural Networks
Foundations of Computational Mathematics
Neural networks for optimal approximation of smooth and analytic functions
Neural Computation
Approximation by polynomials and ridge functions of classes of s-monotone radial functions
Journal of Approximation Theory
Approximation of Sobolev classes by polynomials and ridge functions
Journal of Approximation Theory
Localized Linear Polynomial Operators and Quadrature Formulas on the Sphere
SIAM Journal on Numerical Analysis
Weighted quadrature formulas and approximation by zonal function networks on the sphere
Journal of Complexity
Rapid and brief communication: Evolutionary extreme learning machine
Pattern Recognition
Universal approximation bounds for superpositions of a sigmoidal function
IEEE Transactions on Information Theory
Approximation bounds for smooth functions in C(Rd) by neural and mixture networks
IEEE Transactions on Neural Networks
Smooth function approximation using neural networks
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
We consider the optimal rate of approximation by single hidden feed-forward neural networks on the unit sphere. It is proved that there exists a neural network with n neurons, and an analytic, strictly increasing, sigmoidal activation function such that the deviation of a Sobolev class W"2"r^2(S^d) from the class of neural networks @F"n^@f, behaves asymptotically as n^-^2^r^d^-^1. Namely, we prove that the essential rate of approximation by spherical neural networks is n^-^2^r^d^-^1.