The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Stochastic choice of basis functions in adaptive function approximation and the functional-link net
Abstract
A theoretical justification for the random vector version of the functional-link (RVFL) net is presented in this paper, based on a general approach to adaptive function approximation. The approach consists of formulating a limit-integral representation of the function to be approximated and subsequently evaluating that integral with the Monte-Carlo method. Two main results are: (1) the RVFL is a universal approximator for continuous functions on bounded finite dimensional sets, and (2) the RVFL is an efficient universal approximator with the rate of approximation error convergence to zero of order O(C/ radicaln), where n is number of basis functions and with C independent of n. Similar results are also obtained for neural nets with hidden nodes implemented as products of univariate functions or radial basis functions. Some possible ways of enhancing the accuracy of multivariate function approximations are discussed.
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
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
Function minimization by conjugate gradients
Fletcher, R. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.149 · Cited by 4,939
Iterative Solution of Nonlinear Equations in Several Variables
I., E., Ortega, J. M., & Rheinboldt, W. C. (1971) · Mathematics of Computation · doi:10.2307/2004942 · Cited by 4,408
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
Hammersley, J. M., & Handscomb, D. C. (1964) · Springer eBooks · doi:10.1007/978-94-009-5819-7 · Cited by 4,054
Principles of mathematical analysis
Hammer, C. (1953) · Journal of the Franklin Institute · doi:10.1016/0016-0032(53)90617-6 · Cited by 3,985
Universal approximation bounds for superpositions of a sigmoidal function
Barron, A. R. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256500 · Cited by 2,804
Adaptive pattern recognition and neural networks
(1989) · Choice Reviews Online · doi:10.5860/choice.26-6311 · Cited by 2,313
Leshno, M., Lin, V. Y., Pinkus, A., & Schocken, S. (1993) · Neural Networks · doi:10.1016/s0893-6080(05)80131-5 · Cited by 2,121
Approximate Calculation of Multiple Integrals
G., W., & Stroud, A. H. (1973) · Mathematics of Computation · doi:10.2307/2005635 · Cited by 1,470
On the approximate calculation of multiple integrals
Bakhvalov, N. S. (2015) · Journal of Complexity · doi:10.1016/j.jco.2014.12.003 · Cited by 1,246
Learning and generalization characteristics of the random vector functional-link net
Pao, Y.-H., Park, G.-H., & Sobajic, D. J. (1994) · Neurocomputing · doi:10.1016/0925-2312(94)90053-1 · Cited by 1,138
Self-citationFunctional-link net computing: theory, system architecture, and functionalities
Pao, Y.-H., & Takefuji, Y. (1992) · Computer · doi:10.1109/2.144401 · Cited by 927
Self-citationDecision theoretic generalizations of the PAC model for neural net and other learning applications
Haussler, D. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90010-d · Cited by 843
Methods of Numerical Integration
Rall, L. B., Davis, P. J., & Rabinowitz, P. (1976) · Mathematics of Computation · doi:10.2307/2005342 · Cited by 753
Minimum complexity density estimation
Barron, A. R., & Cover, T. M. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.86996 · Cited by 497
Some new results on neural network approximation
Hornik, K. (1993) · Neural Networks · doi:10.1016/s0893-6080(09)80018-x · Cited by 496
Jones, L. K. (1992) · The Annals of Statistics · doi:10.1214/aos/1176348546 · Cited by 474
H�non, M. (1971) · Astrophysics and Space Science · doi:10.1007/bf00649201 · Cited by 464
Approximation and estimation bounds for artificial neural networks
Barron, A. R. (1994) · Machine Learning · doi:10.1007/bf00993164 · Cited by 399
Neural-net computing and the intelligent control of systems
PAO, Y.-H., PHILLIPS, S. M., & SOBAJIC, D. J. (1992) · International Journal of Control · doi:10.1080/00207179208934315 · Cited by 307
Self-citationApproximation 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
Cited by
Chen, C. L. P., & Liu, Z. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2716952 · Cited by 1,957
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
An Insight into Extreme Learning Machines: Random Neurons, Random Features and Kernels
Huang, G.-B. (2014) · Cognitive Computation · doi:10.1007/s12559-014-9255-2 · Cited by 957
Stochastic Configuration Networks: Fundamentals and Algorithms
Wang, D., & Li, M. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2734043 · Cited by 727
Fuzziness based semi-supervised learning approach for intrusion detection system
Ashfaq, R. A. R., Wang, X.-Z., Huang, J. Z., Abbas, H., & He, Y.-L. (2017) · Information Sciences · doi:10.1016/j.ins.2016.04.019 · Cited by 552
Metadata
- Authors
- Igelnik, B., & Pao, Y.-H.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1995
- Volume
- 6
- Issue
- 6
- Pages
- 1320-1329
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W1986278072
- Cited by
- 955
- References
- 25
- FWCI
- 6.22
- 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.