This is the authors' abstract. We don't add key points for this paper.
A statistical theory for overtraining is proposed. The analysis treats general realizable stochastic neural networks, trained with Kullback-Leibler divergence in the asymptotic case of a large number of training examples. It is shown that the asymptotic gain in the generalization error is small if we perform early stopping, even if we have access to the optimal stopping time. Based on the cross-validation stopping we consider the ratio the examples should be divided into training and cross-validation sets in order to obtain the optimum performance. Although cross-validated early stopping is useless in the asymptotic region, it surely decreases the generalization error in the nonasymptotic region. Our large scale simulations done on a CM5 are in good agreement with our analytical findings.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Амари et al. (1997) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: