Answers are grounded in this paper and cite their sources.
Statistical mechanics is applied to study the generalization properties of a two-layer neural network trained to implement a linearly separable problem. For a stochastic learing algorithm the generalization error as a function of the training set size is calculated exactly. The network with three hidden units experiences two first-order phase transitions due to an asymmetric freezing of the hidden units. Compared to a simple perceptron the committee machine is found to generalize worse.
No takes yet. Share an insight, caveat, or question.
Schwarze et al. (1992) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: