The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Capabilities of three-layered perceptrons
Abstract
A theorem is proved to the effect that three-layered perceptrons with an infinite number of computing units can represent arbitrary mapping if the desired mapping and the input-output characteristics of the computing units satisfy some constraints. The proof is constructive, and each coefficient is explicitly presented. The theorem theoretically guarantees a kind of universality for three-layered perceptrons. Although two-layered perceptrons (simple perceptrons) cannot represent arbitrary functions, three-layers prove necessary and sufficient. The relationship between the model used in the proof and the distributed storage and processing of information is also discussed.>
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
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
The perceptron: A probabilistic model for information storage and organization in the brain.
Rosenblatt, F. (1958) · Psychological Review · doi:10.1037/h0042519 · Cited by 12,280
An introduction to computing with neural nets
Lippmann, R. (1987) · IEEE ASSP Magazine · doi:10.1109/massp.1987.1165576 · Cited by 7,825
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
NETtalk: a parallel network that learns to read aloud
B, T. J. S. A., & Rosenberg, C. (1988) · The MIT Press eBooks · Cited by 670
Conference on Neural Information Processing Systems
Liu, L., Zhou, T., Long, G., Jiang, J., & Zhang, C. (2019) · UTS ePRESS (University of Technology Sydney) · Cited by 593
Kolmogorov, A. N. (1963) · American Mathematical Society Translations: Series 2 · doi:10.1090/trans2/028/04 · Cited by 454
On the Structure of Continuous Functions of Several Variables
Sprecher, D. A. (1965) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1965-0210852-x · Cited by 290
Neural Net and Traditional Classifiers
Huang, W. Y. C., & Lippmann, R. P. (1987) · neural information processing systems · Cited by 144
Cited by
Forecasting with artificial neural networks:
Zhang, G., Eddy Patuwo, B., & Y. Hu, M. (1998) · International Journal of Forecasting · doi:10.1016/s0169-2070(97)00044-7 · Cited by 4,229
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
30 years of adaptive neural networks: perceptron, Madaline, and backpropagation
Widrow, B., & Lehr, M. A. (1990) · Proceedings of the IEEE · doi:10.1109/5.58323 · Cited by 2,242
Theory of the backpropagation neural network
Hecht-Nielsen (1989) · International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1989.118638 · Cited by 2,222
Hornik, K., Stinchcombe, M., & White, H. (1990) · Neural Networks · doi:10.1016/0893-6080(90)90005-6 · Cited by 2,111
Image reconstruction by domain-transform manifold learning
Zhu, B., Liu, J. Z., Cauley, S. F., Rosen, B. R., & Rosen, M. S. (2018) · Nature · doi:10.1038/nature25988 · Cited by 1,694
Approximation theory of the MLP model in neural networks
Pinkus, A. (1999) · Acta Numerica · doi:10.1017/s0962492900002919 · Cited by 1,529
Nguyen, D., & Widrow, B. (1990) · 1990 IJCNN International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1990.137819 · Cited by 1,375
Regularization Theory and Neural Networks Architectures
Girosi, F., Jones, M., & Poggio, T. (1995) · Neural Computation · doi:10.1162/neco.1995.7.2.219 · Cited by 1,349
HECHT-NIELSEN, R. (1992) · Neural Networks for Perception · doi:10.1016/b978-0-12-741252-8.50010-8 · Cited by 1,003
Neural networks for self-learning control systems
Nguyen, D. H., & Widrow, B. (1990) · IEEE Control Systems Magazine · doi:10.1109/37.55119 · Cited by 856
Deep long short-term memory networks for nonlinear structural seismic response prediction
Zhang, R., Chen, Z., Chen, S., Zheng, J., Büyüköztürk, O., & Sun, H. (2019) · Computers & Structures · doi:10.1016/j.compstruc.2019.05.006 · Cited by 562
Physics-guided convolutional neural network (PhyCNN) for data-driven seismic response modeling
Zhang, R., Liu, Y., & Sun, H. (2020) · Engineering Structures · doi:10.1016/j.engstruct.2020.110704 · Cited by 506
Mirjalili, S., Mohd Hashim, S. Z., & Moradian Sardroudi, H. (2012) · Applied Mathematics and Computation · doi:10.1016/j.amc.2012.04.069 · Cited by 505
Credit card fraud detection with a neural-network
Ghosh, & Reilly (1994) · Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences HICSS-94 · doi:10.1109/hicss.1994.323314 · Cited by 433
Chen, T., & Chen, H. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.392252 · Cited by 394
A Gaussian potential function network with hierarchically self-organizing learning
Lee, S., & Kil, R. M. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90005-p · Cited by 325
Neural network with unbounded activation functions is universal approximator
Sonoda, S., & Murata, N. (2017) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2015.12.005 · Cited by 303
“Irie and Miyake [18], Funahashi [19], Jones [20], and Barron [21] used Fourier analysis to show the approximation property in a constructive way.”
Neural network control for a closed-loop System using Feedback-error-learning
Gomi, H., & Kawato, M. (1993) · Neural Networks · doi:10.1016/s0893-6080(09)80004-x · Cited by 288
Approximation by superposition of sigmoidal and radial basis functions
Mhaskar, H. N., & Micchelli, C. A. (1992) · Advances in Applied Mathematics · doi:10.1016/0196-8858(92)90016-p · Cited by 257
An improved PSO-based ANN with simulated annealing technique
Da, Y., & Xiurun, G. (2005) · Neurocomputing · doi:10.1016/j.neucom.2004.07.002 · Cited by 256
DISCRETE- vs. CONTINUOUS-TIME NONLINEAR SIGNAL PROCESSING OF Cu ELECTRODISSOLUTION DATA
RICO-MARTÍNEZ, R., KRISCHER, K., KEVREKIDIS, I. G., KUBE, M. C., & HUDSON, J. L. (1992) · Chemical Engineering Communications · doi:10.1080/00986449208936084 · Cited by 144
Neural Learning from Unbalanced Data
Murphey, Y. L., Guo, H., & Feldkamp, L. A. (2004) · Applied Intelligence · doi:10.1023/b:apin.0000033632.42843.17 · Cited by 82
Son, H., Kim, C., Hwang, N., Kim, C., & Kang, Y. (2014) · Advanced Engineering Informatics · doi:10.1016/j.aei.2013.10.001 · Cited by 74
Metadata
- Authors
- Irie, & Miyake
- Venue
- IEEE International Conference on Neural Networks
- Publisher
- IEEE
- Published
- 1988
- Pages
- 641-648 vol.1
- ISSN
- 1098-7576 (ISSN-L)
- OpenAlex
- W1613359937
- Cited by
- 398
- References
- 9
- FWCI
- 12.66
- 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.