The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Training feedforward networks with the Marquardt algorithm
Abstract
The Marquardt algorithm for nonlinear least squares is presented and is incorporated into the backpropagation algorithm for training feedforward neural networks. The algorithm is tested on several function approximation problems, and is compared with a conjugate gradient algorithm and a variable learning rate algorithm. It is found that the Marquardt algorithm is much more efficient than either of the other techniques when the network contains no more than a few hundred weights.
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
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
An Algorithm for Least-Squares Estimation of Nonlinear Parameters
Marquardt, D. W. (1963) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0111030 · Cited by 30,728
On the limited memory BFGS method for large scale optimization
Liu, D. C., & Nocedal, J. (1989) · Mathematical Programming · doi:10.1007/bf01589116 · Cited by 8,560
Increased rates of convergence through learning rate adaptation
Jacobs, R. A. (1988) · Neural Networks · doi:10.1016/0893-6080(88)90003-2 · Cited by 1,806
Nguyen, D., & Widrow, B. (1990) · 1990 IJCNN International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1990.137819 · Cited by 1,375
First- and Second-Order Methods for Learning: Between Steepest Descent and Newton's Method
Battiti, R. (1992) · Neural Computation · doi:10.1162/neco.1992.4.2.141 · Cited by 1,193
Accelerating the convergence of the back-propagation method
Vogl, T. P., Mangis, J. K., Rigler, A. K., Zink, W. T., & Alkon, D. L. (1988) · Biological Cybernetics · doi:10.1007/bf00332914 · Cited by 1,094
(1991) · The MIT Press eBooks · doi:10.7551/mitpress/4939.001.0001 · Cited by 873
Conjugate gradient algorithm for efficient training of artificial neural networks
Charalambous, C. (1992) · IEE Proceedings G Circuits Devices and Systems · doi:10.1049/ip-g-2.1992.0050 · Cited by 375
SuperSAB: Fast adaptive back propagation with good scaling properties
Tollenaere, T. (1990) · Neural Networks · doi:10.1016/0893-6080(90)90006-7 · Cited by 359
Training Multilayer Perceptrons with the Extended Kalman Algorithm
Singhal, S., & Wu, L. (1988) · neural information processing systems · Cited by 320
Decoupled extended Kalman filter training of feedforward layered networks
Puskorius, G. V., & Feldkamp, L. A. (2002) · IJCNN-91-Seattle International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1991.155276 · Cited by 229
Optimization for training neural nets
Barnard, E. (1992) · IEEE Transactions on Neural Networks · doi:10.1109/72.125864 · Cited by 210
An adaptive least squares algorithm for the efficient training of artificial neural networks
Kollias, S., & Anastassiou, D. (1989) · IEEE Transactions on Circuits and Systems · doi:10.1109/31.192419 · Cited by 198
Recent Advances in Numerical Techniques for Large-Scale Optimization
Shanno, D. F. (1991) · The MIT Press eBooks · doi:10.7551/mitpress/4939.003.0011 · Cited by 28
Cited by
State-of-the-art in artificial neural network applications: A survey
Abiodun, O. I., Jantan, A., Omolara, A. E., Dada, K. V., Mohamed, N. A., & Arshad, H. (2018) · Heliyon · doi:10.1016/j.heliyon.2018.e00938 · Cited by 3,054
Applications of Deep Reinforcement Learning in Communications and Networking: A Survey
Luong, N. C., Hoang, D. T., Gong, S., Niyato, D., Wang, P., Liang, Y.-C., & Kim, D. I. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2916583 · Cited by 2,060
Trends in extreme learning machines: A review
Huang, G., Huang, G.-B., Song, S., & You, K. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.10.001 · Cited by 1,732
Neural networks for classification: a survey
Zhang, G. P. (2000) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/5326.897072 · Cited by 1,667
Introduction to multi-layer feed-forward neural networks
Svozil, D., Kvasnicka, V., & Pospichal, J. (1997) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/s0169-7439(97)00061-0 · Cited by 1,600
Metadata
- Authors
- Hagan, M. T., & Menhaj, M. B.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1994
- Volume
- 5
- Issue
- 6
- Pages
- 989-993
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2155482699
- Cited by
- 7,701
- References
- 15
- FWCI
- 12.73
- 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.