The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Upper bounds on the number of hidden neurons in feedforward networks with arbitrary bounded nonlinear activation functions
Abstract
It is well known that standard single-hidden layer feedforward networks (SLFNs) with at most N hidden neurons (including biases) can learn N distinct samples (x(i),t(i)) with zero error, and the weights connecting the input neurons and the hidden neurons can be chosen "almost" arbitrarily. However, these results have been obtained for the case when the activation function for the hidden neurons is the signum function. This paper rigorously proves that standard single-hidden layer feedforward networks (SLFNs) with at most N hidden neurons and with any bounded nonlinear activation function which has a limit at one infinity can learn N distinct samples (x(i),t(i)) with zero error. The previous method of arbitrarily choosing weights is not feasible for any SLFN. The proof of our result is constructive and thus gives a method to directly find the weights of the standard SLFNs with any such bounded nonlinear activation function as opposed to iterative training algorithms in the literature.
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
Approximation capabilities of multilayer feedforward networks
Hornik, K. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90009-t · Cited by 6,091
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
Leshno, M., Lin, V. Y., Pinkus, A., & Schocken, S. (1993) · Neural Networks · doi:10.1016/s0893-6080(05)80131-5 · Cited by 2,121
Chen, T., & Chen, H. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.392253 · Cited by 1,230
Networks and the best approximation property
Girosi, F., & Poggio, T. (1990) · Biological Cybernetics · doi:10.1007/bf00195855 · Cited by 888
Kolmogorov's theorem and multilayer neural networks
Kůrková, V. (1992) · Neural Networks · doi:10.1016/0893-6080(92)90012-8 · Cited by 747
A Theory of Networks for Approximation and Learning
Poggio, T., & Girosi, F. (1989) · Cited by 703
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
Self-citationExtreme 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
Self-citationUniversal Approximation using Incremental Constructive Feedforward Networks with Random Hidden Nodes
Huang, G.-B., Chen, L., & Siew, C.-K. (2006) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.875977 · Cited by 2,614
Self-citationA 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
Self-citationExtreme learning machines: a survey
Huang, G.-B., Wang, D. H., & Lan, Y. (2011) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-011-0019-y · Cited by 1,914
Self-citationApproximation theory of the MLP model in neural networks
Pinkus, A. (1999) · Acta Numerica · doi:10.1017/s0962492900002919 · Cited by 1,529
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
Self-citationMetaheuristic design of feedforward neural networks: A review of two decades of research
Ojha, V. K., Abraham, A., & Snášel, V. (2017) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2017.01.013 · Cited by 606
Extreme learning machine: algorithm, theory and applications
Ding, S., Zhao, H., Zhang, Y., Xu, X., & Nie, R. (2015) · Artificial Intelligence Review · doi:10.1007/s10462-013-9405-z · Cited by 593
Wang, Y., Fang, Z., & Hong, H. (2019) · Science of The Total Environment · doi:10.1016/j.scitotenv.2019.02.263 · Cited by 525
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
A fast pruned-extreme learning machine for classification problem
Rong, H.-J., Ong, Y.-S., Tan, A.-H., & Zhu, Z. (2008) · Neurocomputing · doi:10.1016/j.neucom.2008.01.005 · Cited by 358
Power Utility Nontechnical Loss Analysis With Extreme Learning Machine Method
Nizar, A. H., Dong, Z. Y., & Wang, Y. (2008) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2008.926431 · Cited by 342
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
Self-citationA study on effectiveness of extreme learning machine
Wang, Y., Cao, F., & Yuan, Y. (2011) · Neurocomputing · doi:10.1016/j.neucom.2010.11.030 · Cited by 269
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
Self-citationClassification ability of single hidden layer feedforward neural networks
Huang, G.-B., Chen, Y.-Q., & Babri, H. A. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.846750 · Cited by 261
Self-citationChen, H.-L., Wang, G., Ma, C., Cai, Z.-N., Liu, W.-B., & Wang, S.-J. (2016) · Neurocomputing · doi:10.1016/j.neucom.2015.07.138 · Cited by 256
Real-Time Learning Capability of Neural Networks
Huang, G.-B., Zhu, Q.-Y., & Siew, C.-K. (2006) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.875974 · Cited by 253
Self-citationPanda, S. S., Chakraborty, D., & Pal, S. K. (2008) · Applied Soft Computing · doi:10.1016/j.asoc.2007.07.003 · Cited by 135
Metadata
- Authors
- Huang, G.-B., & Babri, H. A.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1998
- Volume
- 9
- Issue
- 1
- Pages
- 224-229
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2167982865
- Cited by
- 538
- References
- 22
- FWCI
- 1.31
- 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.