The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Capabilities of a four-layered feedforward neural network: four layers versus three
Abstract
Neural-network theorems state that only when there are infinitely many hidden units is a four-layered feedforward neural network equivalent to a three-layered feedforward neural network. In actual applications, however, the use of infinitely many hidden units is impractical. Therefore, studies should focus on the capabilities of a neural network with a finite number of hidden units, In this paper, a proof is given showing that a three-layered feedforward network with N-1 hidden units can give any N input-target relations exactly. Based on results of the proof, a four-layered network is constructed and is found to give any N input-target relations with a negligibly small error using only (N/2)+3 hidden units. This shows that a four-layered feedforward network is superior to a three-layered feedforward network in terms of the number of parameters needed for the training data.
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
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
Multilayer feedforward networks are universal approximators
HornikK., StinchcombeM., & WhiteH. (1989) · Neural Networks · doi:10.5555/70405.70408 · Cited by 9,081
On the approximate realization of continuous mappings by neural networks
Funahashi, K.-I. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90003-8 · Cited by 4,206 · cited 1×
“Indeed, a three- or four-layered feedforward neural network (an input layer, one or two hidden layers, and an output layer), which is only allowed connections between adjacent layers, can achieve any continuous mapping using sigmoid-like saturating unit output functions when there are infinitely many hidden units [ 1…”
BackgroundBackpropagation neural nets with one and two hidden layers
de Villiers, J., & Barnard, E. (1993) · IEEE Transactions on Neural Networks · doi:10.1109/72.182704 · Cited by 344
Bounds on the number of hidden neurons in multilayer perceptrons
Huang, S.-C., & Huang, Y.-F. (1991) · IEEE Transactions on Neural Networks · doi:10.1109/72.80290 · Cited by 328
A simple method to derive bounds on the size and to train multilayer neural networks
Sartori, M. A., & Antsaklis, P. J. (1991) · IEEE Transactions on Neural Networks · doi:10.1109/72.88168 · Cited by 182
Cited by
Extreme learning machine: Theory and applications
Huang, G.-B., Zhu, Q.-Y., & Siew, C.-K. (2006) · Neurocomputing · doi:10.1016/j.neucom.2005.12.126 · Cited by 13,285
Extreme learning machine: a new learning scheme of feedforward neural networks
Huang, G.-B., Zhu, Q.-Y., & Siew, C.-K. (2005) · 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541) · doi:10.1109/ijcnn.2004.1380068 · Cited by 4,084
Maier, H. R., & Dandy, G. C. (2000) · Environmental Modelling & Software · doi:10.1016/s1364-8152(99)00007-9 · Cited by 2,377
A Fast and Accurate Online Sequential Learning Algorithm for Feedforward Networks
Liang, N.-Y., Huang, G.-B., Saratchandran, P., & Sundararajan, N. (2006) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.880583 · Cited by 1,965
Review of surrogate modeling in water resources
Razavi, S., Tolson, B. A., & Burn, D. H. (2012) · Water Resources Research · doi:10.1029/2011wr011527 · Cited by 983
Auto-encoder based dimensionality reduction
Wang, Y., Yao, H., & Zhao, S. (2016) · Neurocomputing · doi:10.1016/j.neucom.2015.08.104 · Cited by 976
Review on Methods to Fix Number of Hidden Neurons in Neural Networks
Sheela, K. G., & Deepa, S. N. (2013) · Mathematical Problems in Engineering · doi:10.1155/2013/425740 · Cited by 941
Learning capability and storage capacity of two-hidden-layer feedforward networks
Huang, G.-B. (2003) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2003.809401 · Cited by 810
An artificial neural network model for flood simulation using GIS: Johor River Basin, Malaysia
Kia, M. B., Pirasteh, S., Pradhan, B., Mahmud, A. R., Sulaiman, W. N. A., & Moradi, A. (2012) · Environmental Earth Sciences · doi:10.1007/s12665-011-1504-z · Cited by 692
Advanced Spectral Classifiers for Hyperspectral Images: A review
Ghamisi, P., Plaza, J., Chen, Y., Li, J., & Plaza, A. J. (2017) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2016.2616418 · Cited by 675
Huang, G.-B. (2015) · Cognitive Computation · doi:10.1007/s12559-015-9333-0 · Cited by 471
Sales forecasting using extreme learning machine with applications in fashion retailing
Sun, Z.-L., Choi, T.-M., Au, K.-F., & Yu, Y. (2008) · Decision Support Systems · doi:10.1016/j.dss.2008.07.009 · Cited by 426
Deo, R. C., & Şahin, M. (2015) · Atmospheric Research · doi:10.1016/j.atmosres.2014.10.016 · Cited by 317
Extreme learning machine: RBF network case
Huang, G.-B., & Siew, C.-K. (2005) · ICARCV 2004 8th Control, Automation, Robotics and Vision Conference, 2004. · doi:10.1109/icarcv.2004.1468985 · Cited by 278
Can threshold networks be trained directly?
Huang, G.-B., Zhu, Q.-Y., Mao, K. Z., Siew, C.-K., Saratchandran, P., & Sundararajan, N. (2006) · IEEE Transactions on Circuits and Systems II: Express Briefs · doi:10.1109/tcsii.2005.857540 · Cited by 266
Feng, F., Zhang, C., Ma, J., & Zhang, Q.-J. (2016) · IEEE Transactions on Microwave Theory and Techniques · doi:10.1109/tmtt.2015.2504099 · Cited by 262
Incremental extreme learning machine with fully complex hidden nodes
Huang, G.-B., Li, M.-B., Chen, L., & Siew, C.-K. (2008) · Neurocomputing · doi:10.1016/j.neucom.2007.07.025 · Cited by 259
Metadata
- Authors
- Tamura, S., & Tateishi, M.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1997-03
- Volume
- 8
- Issue
- 2
- Pages
- 251-255
- ISSN
- 1045-9227 (ISSN-L)
- 1941-0093
- OpenAlex
- W2104714048
- Cited by
- 422
- References
- 7
- FWCI
- 4.28
- 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.