The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Neural Network Learning Without Backpropagation
Abstract
The method introduced in this paper allows for training arbitrarily connected neural networks, therefore, more powerful neural network architectures with connections across layers can be efficiently trained. The proposed method also simplifies neural network training, by using the forward-only computation instead of the traditionally used forward and backward computation.
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
A direct adaptive method for faster backpropagation learning: the RPROP algorithm
Riedmiller, M., & Braun, H. (2002) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1993.298623 · Cited by 3,917
Cited by
Densely Connected Convolutional Networks
Huang, G., Liu, Z., Van Der Maaten, L., & Weinberger, K. Q. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.243 · Cited by 48,566
Trends in extreme learning machines: A review
Huang, G., Huang, G.-B., Song, S., & You, K. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.10.001 · Cited by 1,732
Convolutional Networks with Dense Connectivity
Huang, G., Liu, Z., Pleiss, G., Maaten, L. V. D., & Weinberger, K. Q. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2918284 · Cited by 591
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-citation
Metadata
- Authors
- Wilamowski, B. M., & Yu, H.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2010-11
- Volume
- 21
- Issue
- 11
- Pages
- 1793-1803
- ISSN
- 1045-9227 (ISSN-L)
- 1941-0093
- OpenAlex
- W2102013737
- Cited by
- 195
- References
- 1
- FWCI
- 12.92
- 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.