The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Flat Minima
Abstract
We present a new algorithm for finding low-complexity neural networks with high generalization capability. The algorithm searches for a “flat” minimum of the error function. A flat minimum is a large connected region in weight space where the error remains approximately constant. An MDL-based, Bayesian argument suggests that flat minima correspond to “simple” networks and low expected overfitting. The argument is based on a Gibbs algorithm variant and a novel way of splitting generalization error into underfitting and overfitting error. Unlike many previous approaches, ours does not require gaussian assumptions and does not depend on a “good” weight prior. Instead we have a prior over input output functions, thus taking into account net architecture and training set. Although our algorithm requires the computation of second-order derivatives, it has backpropagation's order of complexity. Automatically, it effectively prunes units, weights, and input lines. Various experiments with feedforward and recurrent nets are described. In an application to stock market prediction, flat minimum search outperforms conventional backprop, weight decay, and “optimal brain surgeon/optimal brain damage.”
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Cross validatory choice and assessment of statistical predictions
Stone, M. (1974) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1974.tb00994.x · Cited by 10,881
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011
MacKay, D. J. C. (1992) · Neural Computation · doi:10.1162/neco.1992.4.3.415 · Cited by 4,388
Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
Golub, G. H., Heath, M., & Wahba, G. (1979) · Technometrics · doi:10.1080/00401706.1979.10489751 · Cited by 3,934
Hastie, T., & Tibshirani, R. (1986) · Statistical Science · doi:10.1214/ss/1177013604 · Cited by 3,409
Craven, P., & Wahba, G. (1978) · Numerische Mathematik · doi:10.1007/bf01404567 · Cited by 3,388
A practical Bayesian framework for backpropagation networks
MacKay, D. J. C. (1992) · Neural Computation · doi:10.1162/neco.1992.4.3.448 · Cited by 2,917
Advances in Neural Information Processing Systems 37
(2024) · doi:10.52202/079017 · Cited by 2,791
(1993) · CaltechAUTHORS (California Institute of Technology) · Cited by 1,498
(1992) · Cited by 1,405
Statistical predictor identification
Akaike, H. (1970) · Annals of the Institute of Statistical Mathematics · doi:10.1007/bf02506337 · Cited by 1,250
Statistical Predictor Identification
Akaike, H. (1998) · Springer Series in Statistics · doi:10.1007/978-1-4612-1694-0_11 · Cited by 1,213
Spline Smoothing and Nonparametric Regression.
Jones, M. C., & Eubank, R. L. (1989) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2982831 · Cited by 1,031
An Information Measure for Classification
Wallace, C. S., & Boulton, D. M. (1968) · The Computer Journal · doi:10.1093/comjnl/11.2.185 · Cited by 933
Learning in Artificial Neural Networks: A Statistical Perspective
White, H. (1989) · Neural Computation · doi:10.1162/neco.1989.1.4.425 · Cited by 922
Principles of Risk Minimization for Learning Theory
Vapnik, V. N. (1991) · neural information processing systems · Cited by 692
Simplifying Neural Networks by Soft Weight-Sharing
Nowlan, S. J., & Hinton, G. E. (1992) · Neural Computation · doi:10.1162/neco.1992.4.4.473 · Cited by 595
Fast Exact Multiplication by the Hessian
Pearlmutter, B. A. (1994) · Neural Computation · doi:10.1162/neco.1994.6.1.147 · Cited by 540
Skeletonization: A Technique for Trimming the Fat from a Network via Relevance Assessment
Mozer, M. C., & Smolensky, P. (1988) · neural information processing systems · Cited by 540
Comparing Biases for Minimal Network Construction with Back-Propagation
Hanson, S. J., & Pratt, L. (1988) · neural information processing systems · Cited by 480
Moody, J. E. (1991) · Cited by 437
Dynamic node creation in backpropagation networks
ASH, T. (1989) · Connection Science · doi:10.1080/09540098908915647 · Cited by 415
Buntine, W., & Weigend, A. S. (1991) · Complex Systems · Cited by 361
Stock performance modeling using neural networks: A comparative study with regression models
Nicholas Refenes, A., Zapranis, A., & Francis, G. (1994) · Neural Networks · doi:10.1016/0893-6080(94)90030-2 · Cited by 318
Noise injection into inputs in back-propagation learning
Matsuoka, K. (1992) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.155944 · Cited by 262
A statistical approach to learning and generalization in layered neural networks
Levin, E., Tishby, N., & Solla, S. A. (1990) · Proceedings of the IEEE · doi:10.1109/5.58339 · Cited by 248
Statistical Theory of Learning Curves under Entropic Loss Criterion
Амари, Ш.-И., & Murata, N. (1993) · Neural Computation · doi:10.1162/neco.1993.5.1.140 · Cited by 134
Maximally fault tolerant neural networks
Neti, C., Schneider, M. H., & Young, E. D. (1992) · IEEE Transactions on Neural Networks · doi:10.1109/72.105414 · Cited by 124
Structural Risk Minimization for Character Recognition
Guyon, I., Vapnik, V. N., Boser, B. E., Bottou, L., & Solla, S. A. (1991) · neural information processing systems · Cited by 105
Curvature-driven smoothing: a learning algorithm for feedforward networks
Bishop, C. M. (1993) · IEEE Transactions on Neural Networks · doi:10.1109/72.248466 · Cited by 89
Wolpert, D. H. (2018) · CRC Press eBooks · doi:10.1201/9780429492525-5 · Cited by 77
Fast pruning using principal components
Levin, A. U. (2018) · doi:10.6083/ht24wj648 · Cited by 72
Optimal stopping and effective machine complexity in learning
Wang, C., Venkatesh, S. S., & Judd, J. S. (2002) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.1995.531518 · Cited by 55
Robustness in Multilayer Perceptrons
Kerlirzin, P., & VALLET, F. (1993) · Neural Computation · doi:10.1162/neco.1993.5.3.473 · Cited by 54
Møller, M. F. (1993) · DAIMI Report Series · doi:10.7146/dpb.v22i432.6748 · Cited by 28
Chaitin-Kolmogorov Complexity and Generalization in Neural Networks
Pearlmutter, B. A., & Rosenfeld, R. (1990) · Maynooth University ePrints and eTheses Archive (Maynooth University) · Cited by 27
Keeping Neural Networks Simple
Hinton, G. E., & van Camp, D. (1993) · Springer eBooks · doi:10.1007/978-1-4471-2063-6_2 · Cited by 24
Operational Fault Tolerance of CMAC Networks
Carter, M. J., Rudolph, F. J., & Nucci, A. J. (1989) · neural information processing systems · Cited by 20
Bayesian Backpropagation Over I-O Functions Rather Than Weights
Wolpert, D. H. (1993) · Cited by 18
Perturbation response in feedforward networks
Minai, A. A., & Williams, R. D. (1994) · Neural Networks · doi:10.1016/0893-6080(94)90100-7 · Cited by 12
Murray, A. F., & Edwards, P. J. (1992) · neural information processing systems · Cited by 8
Research works printed but not linked: 11
- Buntine W. L., 1991, Complex Systems, 5, 603
- Carter M. J., 1990, Advances in Neural Information Processing Systems, 2, 340
- Fahlman S. E., 1990, Advances in Neural Information Processing Systems 2, D. S. Touretzky, ed., 525
- 10.2307/1268518 · DOI
- Hanson S. J., 1989, Advances in Neural Information Processing Systems 1, D. S. Touretzky, ed., 177
- LeCun Y., 1990, Advances in Neural Information Processing Systems 2, D. S. Touretzky, ed., 598
- Levin A. U., 1994, Advances in Neural Information Processing Systems 6, J. D. Cowan, G. Tesauro, and J. Alspector, eds., 35
- Moody J. E., 1989, Advances in Neural Information Processing Systems 1, D. S. Touretzky, ed., 29
- Mozer M. C., 1989, Advances in Neural Information Processing Systems 1, D. S. Touretzky, ed., 107
- Wang C., 1994, Advances in Neural Information Processing Systems 6, J. D. Cowan, G. Tesauro, and J. Alspector, eds., 303
- Wolpert D. H., 1994, Advances in Neural Information Processing Systems 6, J. D. Cowan, G. Tesauro, and J. Alspector, eds., 200
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Self-citationPattern Recognition and Neural Networks
Ripley, B. D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511812651 · Cited by 6,459
Improved Adam Optimizer for Deep Neural Networks
Zhang, Z. (2018) · 2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS) · doi:10.1109/iwqos.2018.8624183 · Cited by 1,400
Super-convergence: very fast training of neural networks using large learning rates
Smith, L. N., & Topin, N. (2019) · Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications · doi:10.1117/12.2520589 · Cited by 1,335
REBUS and the anarchic brain: Toward a unified model of the brain action of psychedelics
Carhart-Harris, R. L., & Friston, K. J. (2019) · Pharmacological Reviews · doi:10.1124/pr.118.017160 · Cited by 1,180
Metadata
- Authors
- Hochreiter, S., & Schmidhuber, J.
- Venue
- Neural Computation
- Publisher
- MIT Press
- Published
- 1997-01-01
- Volume
- 9
- Issue
- 1
- Pages
- 1-42
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2912811302
- Cited by
- 676
- References
- 42
- FWCI
- 11.41
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.