The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Pruning algorithms-a survey
Abstract
A rule of thumb for obtaining good generalization in systems trained by examples is that one should use the smallest system that will fit the data. Unfortunately, it usually is not obvious what size is best; a system that is too small will not be able to learn the data while one that is just big enough may learn very slowly and be very sensitive to initial conditions and learning parameters. This paper is a survey of neural network pruning algorithms. The approach taken by the methods described here is to train a network that is larger than necessary and then remove the parts that are not needed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
Learnability and the Vapnik-Chervonenkis dimension
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989) · Journal of the ACM · doi:10.1145/76359.76371 · Cited by 1,839
What Size Net Gives Valid Generalization?
Baum, E. B., & Haussler, D. (1989) · Neural Computation · doi:10.1162/neco.1989.1.1.151 · Cited by 1,541
A simple procedure for pruning back-propagation trained neural networks
Karnin, E. D. (1990) · IEEE Transactions on Neural Networks · doi:10.1109/72.80236 · Cited by 670
Creating artificial neural networks that generalize
Sietsma, J., & Dow, R. J. F. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90033-2 · Cited by 597
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
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
A general lower bound on the number of examples needed for learning
Ehrenfeucht, A., Haussler, D., Kearns, M., & Valiant, L. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90002-3 · Cited by 403
Experiments on Learning by Back Propagation.
Plaut, D. C., Nowlan, S. J., & Hinton, G. E. (1986) · Cited by 323
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
Neural net pruning-why and how
Sietsma, & Dow (1988) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1988.23864 · Cited by 232
Neural net pruning-why and how.
Sietsma, J., & Dow, R. J. F. (1988) · Cited by 193
BACK-PROPAGATION, WEIGHT-ELIMINATION AND TIME SERIES PREDICTION
Weigend, A. S., Rumelhart, D. E., & Huberman, B. A. (1991) · Connectionist Models · doi:10.1016/b978-1-4832-1448-1.50016-0 · Cited by 174
Consistent inference of probabilities in layered networks: predictions and generalizations
Tishby, Levin, & Solla (1989) · International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1989.118274 · Cited by 161
A general lower bound on the number of examples needed for learning
Ehrenfeucht, A., Haussler, D. H., Kearns, M. J., & Valiant, L. G. (1988) · Conference on Learning Theory · doi:10.5555/93025.93068 · Cited by 138
Generalization by weight-elimination applied to currency exchange rate prediction
Weigend, A. S., Rumelhart, D. E., & Huberman, B. A. (1991) · IEEE International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1991.170743 · Cited by 135
Schwartz, D. B., Samalam, V. K., Solla, S. A., & Denker, J. S. (1990) · Neural Computation · doi:10.1162/neco.1990.2.3.374 · Cited by 73
Generalizing Smoothness Constraints from Discrete Samples
Ji, C., Snapp, R. R., & Psaltis, D. (1990) · Neural Computation · doi:10.1162/neco.1990.2.2.188 · Cited by 63
Generalization performance of overtrained back-propagation networks
Chauvin, Y. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52255-7_26 · Cited by 54
A structural learning algorithm with forgetting of link weights
Ishikawa, M. (1989) · doi:10.1109/ijcnn.1989.118521 · Cited by 51
When are k-nearest neighbor and back propagation accurate for feasible sized sets of examples?
Baum, E. B. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52255-7_24 · Cited by 29
Improving generalization in backpropagation networks with distributed bottlenecks
Kruschke (1989) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1989.118617 · Cited by 29
A Frobenius approximation reduction method (FARM) for determining optimal number of hidden units
Kung, S., & Hu, Y. (2002) · 2022 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1991.155331 · Cited by 29
Reduction of interconnection weights in higher order associative memory networks
Wang, J.-H., Krile, T. F., & Walkup, J. F. (2002) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1991.155334 · Cited by 7
Valiant, L. G. (2026) · Foundations of Computation and Machine Learning · doi:10.1145/3749740.3749746
Cited by
The graph neural network model
Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., & Monfardini, G. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2005605 · Cited by 9,582
Forecasting with artificial neural networks:
Zhang, G., Eddy Patuwo, B., & Y. Hu, M. (1998) · International Journal of Forecasting · doi:10.1016/s0169-2070(97)00044-7 · Cited by 4,229
Gardner, M. W., & Dorling, S. R. (1998) · Atmospheric Environment · doi:10.1016/s1352-2310(97)00447-0 · Cited by 3,324
Maier, H. R., & Dandy, G. C. (2000) · Environmental Modelling & Software · doi:10.1016/s1364-8152(99)00007-9 · Cited by 2,377
Neural networks for short-term load forecasting: a review and evaluation
Hippert, H. S., Pedreira, C. E., & Souza, R. C. (2001) · IEEE Transactions on Power Systems · doi:10.1109/59.910780 · Cited by 2,221
Metadata
- Authors
- Reed, R.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1993
- Volume
- 4
- Issue
- 5
- Pages
- 740-747
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2145085734
- Cited by
- 1,708
- References
- 26
- FWCI
- 26.17
- 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.