Early Stopping-But When?
暂无分享，去创建一个
[1] John E. Moody,et al. Fast Pruning Using Principal Components , 1993, NIPS.
[2] J. Stephen Judd,et al. Optimal stopping and effective machine complexity in learning , 1993, Proceedings of 1995 IEEE International Symposium on Information Theory.
[3] Pierre Baldi,et al. Temporal Evolution of Generalization during Learning in Linear Networks , 1991, Neural Computation.
[4] Lutz Prechelt,et al. PROBEN 1 - a set of benchmarks and benchmarking rules for neural network training algorithms , 1994 .
[5] Ferdinand Hergert,et al. Improving model selection by nonconvergent methods , 1993, Neural Networks.
[6] Anders Krogh,et al. A Simple Weight Decay Can Improve Generalization , 1991, NIPS.
[7] Hervé Bourlard,et al. Generalization and Parameter Estimation in Feedforward Netws: Some Experiments , 1989, NIPS.
[8] Geoffrey E. Hinton,et al. Simplifying Neural Networks by Soft Weight-Sharing , 1992, Neural Computation.
[9] Russell Reed,et al. Pruning algorithms-a survey , 1993, IEEE Trans. Neural Networks.
[10] Elie Bienenstock,et al. Neural Networks and the Bias/Variance Dilemma , 1992, Neural Computation.