The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Bounds on the number of hidden neurons in multilayer perceptrons
Abstract
Fundamental issues concerning the capability of multilayer perceptrons with one hidden layer are investigated. The studies are focused on realizations of functions which map from a finite subset of E(n) into E(d). Real-valued and binary-valued functions are considered. In particular, a least upper bound is derived for the number of hidden neurons needed to realize an arbitrary function which maps from a finite subset of E(n ) into E(d). A nontrivial lower bound is also obtained for realizations of injective functions. This result can be applied in studies of pattern recognition and database retrieval. An upper bound is given for realizing binary-valued functions that are related to pattern-classification problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
Adaptive pattern recognition and neural networks
(1989) · Choice Reviews Online · doi:10.5860/choice.26-6311 · Cited by 2,313
Introduction to linear and nonlinear programming
Polak, E. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100535 · Cited by 2,100
Cover, T. M. (1965) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1965.264137 · Cited by 2,044
Gesammelte Mathematische Abhandlungen: Erster Band
Schwarz, H. A. (1890) · Springer eBooks · doi:10.1007/978-3-642-50665-9 · Cited by 827
On the capabilities of multilayer perceptrons
Baum, E. B. (1988) · Journal of Complexity · doi:10.1016/0885-064x(88)90020-9 · Cited by 379
Principles of neurodynamics: Yu. G. Antomonov
Ivakhnenko, A. G. (1976) · Cybernetics · doi:10.1007/bf01071380 · Cited by 318
Internal representations for associative memory
Baum, E. B., Moody, J. E., & Wilczek, F. A. (1988) · Biological Cybernetics · doi:10.1007/bf00332910 · Cited by 129
Gesammelte Mathematische Abhandlungen
Schläfli, L. (1950) · Springer eBooks · doi:10.1007/978-3-0348-4118-4 · Cited by 123
Partitions of N -Space by Hyperplanes
Winder, R. O. (1966) · SIAM Journal on Applied Mathematics · doi:10.1137/0114068 · Cited by 97
An Optimization Network for Matrix Inversion
Jang, J.-S., Lee, S.-Y., & Shin, S.-Y. (1987) · neural information processing systems · Cited by 82
Learning algorithms for perceptions using back-propagation with selective updates
Huang, S. C., & Huang, Y.-F. (1990) · IEEE Control Systems Magazine · doi:10.1109/37.55125 · Cited by 42
Self-citationThe capacity of multilevel threshold functions
Ólafsson, S., & Abu‐Mostafa, Y. S. (1988) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.3890 · Cited by 42
Applications and analysis of second order artificial neural networks
Soon, V. C., & Huang, Y.-F. (2003) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.1988.194326 · Cited by 3
Self-citation
Cited by
Maier, H. R., & Dandy, G. C. (2000) · Environmental Modelling & Software · doi:10.1016/s1364-8152(99)00007-9 · Cited by 2,377
Extreme 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
Approximation theory of the MLP model in neural networks
Pinkus, A. (1999) · Acta Numerica · doi:10.1017/s0962492900002919 · Cited by 1,529
Progress in supervised neural networks
Hush, D. R., & Horne, B. G. (1993) · IEEE Signal Processing Magazine · doi:10.1109/79.180705 · Cited by 1,247
Concepts of Artificial Intelligence for Computer-Assisted Drug Discovery
Yang, X., Wang, Y., Byrne, R., Schneider, G., & Yang, S. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00728 · Cited by 1,022
Metadata
- Authors
- Huang, S.-C., & Huang, Y.-F.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1991
- Volume
- 2
- Issue
- 1
- Pages
- 47-55
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2166915851
- Cited by
- 328
- References
- 15
- FWCI
- 15.90
- 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.