Multilayer Perceptrons: Approximation Order and Necessary Number of Hidden Units

Authors:
S. Trenn
Affiliations:
Ilmenau Univ. of Technol., Ilmenau
Venue:
IEEE Transactions on Neural Networks
Year:
2008

Citing 0
Cited 2

Local context discrimination in signature neural networks

IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation: new challenges on bioinspired applications - Volume Part II
Performance evaluation of multilayer perceptrons for discriminating and quantifying multiple kinds of odors with an electronic nose

Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the approximation of sufficiently smooth multivariable functions with a multilayer perceptron (MLP). For a given approximation order, explicit formulas for the necessary number of hidden units and its distributions to the hidden layers of the MLP are derived. These formulas depend only on the number of input variables and on the desired approximation order. The concept of approximation order encompasses Kolmogorov-Gabor polynomials or discrete Volterra series, which are widely used in static and dynamic models of nonlinear systems. The results are obtained by considering structural properties of the Taylor polynomials of the function in question and of the MLP function.