The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Two highly efficient second-order algorithms for training feedforward networks
Abstract
We present two highly efficient second-order algorithms for the training of multilayer feedforward neural networks. The algorithms are based on iterations of the form employed in the Levenberg-Marquardt (LM) method for nonlinear least squares problems with the inclusion of an additional adaptive momentum term arising from the formulation of the training task as a constrained optimization problem. Their implementation requires minimal additional computations compared to a standard LM iteration. Simulations of large scale classical neural-network benchmarks are presented which reveal the power of the two methods to obtain solutions in difficult problems, whereas other standard second-order techniques (including LM) fail to converge.
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
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
Gill, P. E., Murray, W., & Wright, M. H. (2019) · doi:10.1137/1.9781611975604 · Cited by 1,737
Ill-Conditioning in Neural Network Training Problems
Saarinen, S., Bramley, R., & Cybenko, G. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914044 · Cited by 141 · cited 1×
“The ill-conditioning of the Jacobian becomes even more prominent in the case of multilayer feedforward networks due to possible redundancy of the synaptic weights and also due to the saturation of the sigmoid activation functions [ 13 ].”
Background
Cited by
Improved Computation for Levenberg–Marquardt Training
Wilamowski, B. M., & Yu, H. (2010) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2010.2045657 · Cited by 622
Metadata
- Authors
- Ampazis, N., & Perantonis, S. J.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2002-09
- Volume
- 13
- Issue
- 5
- Pages
- 1064-1074
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2136772527
- Cited by
- 161
- References
- 3
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Two highly efficient second-order algorithms for training feedforward networks. https://app.cochat.ai/papers/10.1109/tnn.2002.1031939
- The paper
- Ampazis, N., & Perantonis, S. J. (2002). Two highly efficient second-order algorithms for training feedforward networks. IEEE Transactions on Neural Networks. https://doi.org/10.1109/tnn.2002.1031939
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.