We show that Kolmogorov's theorem on representations of continuous functions of n-variables by sums and superpositions of continuous functions of one variable is relevant in the context of neural networks. We give a version of this theorem with all of the one-variable functions approximated arbitrarily well by linear combinations of compositions of affine functions with some given sigmoidal function. We derive an upper estimate of the number of hidden units.
No takes yet. Share an insight, caveat, or question.
Věra Kůrková (1991) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: