Original Contribution: On the complexity of approximating mappings using feedforward networks

Authors:
Pascal Koiran
Affiliations:
-
Venue:
Neural Networks
Year:
1993

Citing 6
Cited 3

Multilayer feedforward networks are universal approximators

Neural Networks
On the approximate realization of continuous mappings by neural networks

Neural Networks
Universal approximation of an unknown mapping and its derivatives using multilayer feedforward networks

Neural Networks
Approximation theory and feedforward networks

Neural Networks
Remarks on interpolation and recognition using neural nets

NIPS-3 Proceedings of the 1990 conference on Advances in neural information processing systems 3
Complexity Issues in Neural Network Computations

LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics

The estimate for approximation error of neural networks: A constructive approach

Neurocomputing
Approximation of curves contained on the surface by freed-forward neural networks

AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part III
Determining functional relationships from trained neural networks

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study the approximation of continuous mappings and dichotomies by one-hidden-layer networks from a computational point of view. Our approach is based on a new approximation method specially designed for constructing small networks. We give upper bounds on the size of these networks.