The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Neighborhood based Levenberg-Marquardt algorithm for neural network training
Abstract
Although the Levenberg-Marquardt (LM) algorithm has been extensively applied as a neural-network training method, it suffers from being very expensive, both in memory and number of operations required, when the network to be trained has a significant number of adaptive weights. In this paper, the behavior of a recently proposed variation of this algorithm is studied. This new method is based on the application of the concept of neural neighborhoods to the LM algorithm. It is shown that, by performing an LM step on a single neighborhood at each training iteration, not only significant savings in memory occupation and computing effort are obtained, but also, the overall performance of the LM method can be increased.
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
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
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1994) · Cited by 15,411
A method for the solution of certain non-linear problems in least squares
Levenberg, K. (1944) · Quarterly of Applied Mathematics · doi:10.1090/qam/10666 · Cited by 12,359
Dongarra, J. J., Moler, C. B., Bunch, J. R., & Stewart, G. W. (1979) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971811 · Cited by 1,738
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
Explorations in parallel distributed processing
McClelland, J. L. (1988) · Cited by 841
An empirical study of learning speed in back-propagation networks
Fahlman, S. E. (2018) · doi:10.1184/r1/6603266 · Cited by 829
Klema, V., Dongarra, J. J., Bunch, J. R., Moler, C. B., & Stewart, G. W. (1980) · Mathematics of Computation · doi:10.2307/2006212 · Cited by 646
Cited by
Parameter estimation of solar photovoltaic (PV) cells: A review
Jordehi, A. R. (2016) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2016.03.049 · Cited by 670
Metaheuristic design of feedforward neural networks: A review of two decades of research
Ojha, V. K., Abraham, A., & Snášel, V. (2017) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2017.01.013 · Cited by 606
Pan, L., He, C., Tian, Y., Wang, H., Zhang, X., & Jin, Y. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2802784 · Cited by 456
Metadata
- Authors
- Lera, G., & Pinzolas, M.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2002-09
- Volume
- 13
- Issue
- 5
- Pages
- 1200-1203
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2140527568
- Cited by
- 281
- References
- 8
- FWCI
- 4.68
- 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.