Simplifying Neural Nets by Discovering Flat Minima
暂无分享,去创建一个
[1] J. Stephen Judd,et al. Optimal stopping and effective machine complexity in learning , 1993, Proceedings of 1995 IEEE International Symposium on Information Theory.
[2] D. Mackay,et al. A Practical Bayesian Framework for Backprop Networks , 1991 .
[3] Babak Hassibi,et al. Second Order Derivatives for Network Pruning: Optimal Brain Surgeon , 1992, NIPS.
[4] Isabelle Guyon,et al. Structural Risk Minimization for Character Recognition , 1991, NIPS.
[5] Barak A. Pearlmutter. Fast Exact Multiplication by the Hessian , 1994, Neural Computation.
[6] Alan F. Murray,et al. Synaptic Weight Noise During MLP Learning Enhances Fault-Tolerance, Generalization and Learning Trajectory , 1992, NIPS.
[7] John Moody,et al. Architecture Selection Strategies for Neural Networks: Application to Corporate Bond Rating Predicti , 1995, NIPS 1995.
[8] Vladimir Vapnik,et al. Principles of Risk Minimization for Learning Theory , 1991, NIPS.
[9] Geoffrey E. Hinton,et al. Keeping Neural Networks Simple , 1993 .
[10] J. Urgen Schmidhuber. Discovering Problem Solutions with Low Kolmogorov Complexity and High Generalization Capability , 1994 .
[11] David H. Wolpert,et al. Bayesian Backpropagation Over I-O Functions Rather Than Weights , 1993, NIPS.
[12] David E. Rumelhart,et al. Generalization by Weight-Elimination with Application to Forecasting , 1990, NIPS.
[13] M. F. Møller,et al. Exact Calculation of the Product of the Hessian Matrix of Feed-Forward Network Error Functions and a Vector in 0(N) Time , 1993 .
[14] Peter M. Williams,et al. Bayesian Regularization and Pruning Using a Laplace Prior , 1995, Neural Computation.
[15] David J. C. MacKay,et al. A Practical Bayesian Framework for Backpropagation Networks , 1992, Neural Computation.
[16] Sean B. Holden,et al. On the theory of generalization and self-structuring in linearly weighted connectionist networks , 1993 .
[17] Geoffrey E. Hinton,et al. Simplifying Neural Networks by Soft Weight-Sharing , 1992, Neural Computation.
[18] Barak A. Pearlmutter,et al. Chaitin-Kolmogorov Complexity and Generalization in Neural Networks , 1990, NIPS.