The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Levenberg–Marquardt Training
Abstract
This chapter introduces the implementation of training with the Levenberg–Marquardt algorithm in two parts: calculation of the Jacobian matrix and training process design. The Levenberg–Marquardt algorithm, which was independently developed by Kenneth Levenberg and Donald Marquardt, provides a numerical solution to the problem of minimizing a nonlinear function. The Levenberg–Marquardt algorithm blends the steepest descent method and the Gauss–Newton algorithm. The chapter presents the derivation of the Levenberg–Marquardt algorithm in four parts: steepest descent algorithm, Newton’s method, Gauss-Newton’s algorithm, and Levenberg–Marquardt algorithm. The steepest descent algorithm is a first-order algorithm. It uses the first-order derivative of total error function to find the minima in error space. With the update rule of the Levenberg–Marquardt algorithm and the computation of the Jacobian matrix, the next step is to organize the training process. The Levenberg–Marquardt algorithm solves the problems existing in both the gradient descent method and the Gauss–Newton method for neural-networks training, by the combination of those two algorithms.
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
Generalization of backpropagation with application to a recurrent gas market model
Werbos, P. J. (1988) · Neural Networks · doi:10.1016/0893-6080(88)90007-x · Cited by 944
Neural network architectures and learning algorithms
Wilamowski, B. (2009) · IEEE Industrial Electronics Magazine · doi:10.1109/mie.2009.934790 · Cited by 355
Self-citationNeural Network Learning Without Backpropagation
Wilamowski, B. M., & Yu, H. (2010) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2010.2073482 · Cited by 195
Self-citationComputing Gradient Vector and Jacobian Matrix in Arbitrarily Connected Neural Networks
Wilamowski, B. M., Cotton, N. J., Kaynak, O., & Dündar, G. (2008) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2008.2003319 · Cited by 155
Self-citation
Cited by
Bui, D.-K., Nguyen, T., Chou, J.-S., Nguyen-Xuan, H., & Ngo, T. D. (2018) · Construction and Building Materials · doi:10.1016/j.conbuildmat.2018.05.201 · Cited by 395
Kannangara, M., Dua, R., Ahmadi, L., & Bensebaa, F. (2018) · Waste Management · doi:10.1016/j.wasman.2017.11.057 · Cited by 319
Classification of Electromyographic Hand Gesture Signals using Machine Learning Techniques
Jia, G., Lam, H.-K., Liao, J., & Wang, R. (2020) · Neurocomputing · doi:10.1016/j.neucom.2020.03.009 · Cited by 89
“NN has the strongest robustness in this case mainly due to the use of LM algorithm which is proven to be a more robust method [39].”
BackgroundMethodInfluentialEwert, P., Orlowska-Kowalska, T., & Jankowska, K. (2021) · Energies · doi:10.3390/en14030712 · Cited by 48
Kinase inhibitor screening using artificial neural networks and engineered cardiac biowires
Conant, G., Ahadian, S., Zhao, Y., & Radisic, M. (2017) · Scientific Reports · doi:10.1038/s41598-017-12048-5 · Cited by 25
Metadata
- Authors
- Yu, H., & Wilamowski, B.
- Venue
- Electrical Engineering Handbook
- Publisher
- CRC Press
- Published
- 2011-02-28
- Pages
- 1-16
- ISSN
- 1097-9409 (ISSN-L)
- OpenAlex
- W2488544472
- Cited by
- 395
- References
- 4
- FWCI
- 29.20
- Type
- book chapter
- 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.