Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 184

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

An algorithm for fast convergence in training neural networks

Wilamowski, B.M., Iplikci, S., Kaynak, O., Efe, M.O. · 2002 · IJCNN'01. International Joint Conference on Neural Networks. Proceedings (Cat. No.01CH37222)

Abstract

In this work, two modifications on Levenberg-Marquardt (LM) algorithm for feedforward neural networks are studied. One modification is made on performance index, while the other one is on calculating gradient information. The modified algorithm gives a better convergence rate compared to the standard LM method and is less computationally intensive and requires less memory. The performance of the algorithm has been checked on several example problems.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/ijcnn.2001.938431

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 184

Metadata

Authors
Wilamowski, B. M., Iplikci, S., Kaynak, O., & Efe, M. O.
Venue
IJCNN'01. International Joint Conference on Neural Networks. Proceedings (Cat. No.01CH37222)
Publisher
IEEE
Published
2002-11-13
Volume
3
Pages
1778-1782
ISSN
2161-4407 (ISSN-L)
OpenAlex
W1948203804
Cited by
184
References
2
FWCI
3.81
Type
conference paper
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.