The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Improved Computation for Levenberg–Marquardt Training
Abstract
The improved computation presented in this paper is aimed to optimize the neural networks learning process using Levenberg-Marquardt (LM) algorithm. Quasi-Hessian matrix and gradient vector are computed directly, without Jacobian matrix multiplication and storage. The memory limitation problem for LM training is solved. Considering the symmetry of quasi-Hessian matrix, only elements in its upper/lower triangular array need to be calculated. Therefore, training speed is improved significantly, not only because of the smaller array stored in memory, but also the reduced operations in quasi-Hessian matrix calculation. The improved memory and time efficiencies are especially true for large sized patterns training.
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
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
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
Training feedforward networks with the Marquardt algorithm
Hagan, M. T., & Menhaj, M. B. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.329697 · Cited by 7,701
(2018) · De Gruyter eBooks · doi:10.1515/9783110542400 · Cited by 1,876
Linear Algebra and Its Applications
I., E., & Strang, G. (1976) · Mathematics of Computation · doi:10.2307/2005411 · Cited by 1,871
Farrell, J. A., & Polycarpou, M. M. (2006) · Wiley eBooks · doi:10.1002/0471781819 · Cited by 617
Neural network architectures and learning algorithms
Wilamowski, B. (2009) · IEEE Industrial Electronics Magazine · doi:10.1109/mie.2009.934790 · Cited by 355
Self-citationFault Diagnostic System for a Multilevel Inverter Using a Neural Network
Khomfoi, S., & Tolbert, L. M. (2007) · IEEE Transactions on Power Electronics · doi:10.1109/tpel.2007.897128 · Cited by 291
Backpropagation: past and future
Werbos (1988) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1988.23866 · Cited by 228
Martins, J. F., Pires, V. F., & Pires, A. J. (2007) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2006.888790 · Cited by 219
Parallel Sequential Minimal Optimization for the Training of Support Vector Machines
Cao, L. J., Keerthi, S. S., Ong, C.-J., Zhang, J. Q., Periyathamby, U., Fu, X. J., & Lee, H. P. (2006) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.875989 · Cited by 182
Two highly efficient second-order algorithms for training feedforward networks
Ampazis, N., & Perantonis, S. J. (2002) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2002.1031939 · Cited by 161
Discrete-Time Adaptive Backstepping Nonlinear Control via High-Order Neural Networks
Alanís, A. Y., Sanchez, E. N., & Loukianov, A. G. (2007) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2007.899170 · Cited by 158
Computing 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-citationOptimized Approximation Algorithm in Neural Networks Without Overfitting
Liu, Y., Starzyk, J. A., & Zhu, Z. (2008) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2007.915114 · Cited by 150
A Constrained Optimization Approach to Preserving Prior Knowledge During Incremental Training
Ferrari, S., & Jensenius, M. A. (2008) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2007.915108 · Cited by 51
Multilayer Potts Perceptrons With Levenberg–Marquardt Learning
Wu, J.-M. (2008) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2003271 · Cited by 48
Cited by
Advantages of Radial Basis Function Networks for Dynamic System Design
Yu, H., Xie, T., Paszczynski, S., & Wilamowski, B. M. (2011) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2011.2164773 · Cited by 445
Self-citationSelection of Proper Neural Network Sizes and Architectures—A Comparative Study
Hunter, D., Yu, H., Pukish, III, Kolbusz, J., & Wilamowski, B. M. (2012) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2187914 · Cited by 415
Self-citationReal-time non-rigid reconstruction using an RGB-D camera
Zollhöfer, M., Nießner, M., Izadi, S., Rehmann, C., Zach, C., Fisher, M., Wu, C., Fitzgibbon, A., Loop, C., Theobalt, C., et al. (2014) · ACM Transactions on Graphics · doi:10.1145/2601097.2601165 · Cited by 405
A Survey on SCADA Systems: Secure Protocols, Incidents, Threats and Tactics
Pliatsios, D., Sarigiannidis, P., Lagkas, T., & Sarigiannidis, A. G. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2987688 · Cited by 320
“Linda et al. [85] presented an anomaly-based intrusion detection system based on the combination of two neural network algorithms, namely the Levenberg-Marquardt [86] and the Error Back-Propagation [87] algorithms.”
MethodEnhancing transportation systems via deep learning: A survey
Wang, Y., Zhang, D., Liu, Y., Dai, B., & Lee, L. H. (2019) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2018.12.004 · Cited by 312
Metadata
- Authors
- Wilamowski, B. M., & Yu, H.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2010-06
- Volume
- 21
- Issue
- 6
- Pages
- 930-937
- ISSN
- 1045-9227 (ISSN-L)
- 1941-0093
- OpenAlex
- W2133764509
- Cited by
- 622
- References
- 17
- FWCI
- 26.53
- 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.