Skip to main content

A Constructive Proof and An Extension of Cybenko’s Approximation Theorem

  • Conference paper
Computing Science and Statistics

Abstract

In this paper, we present a constructive proof of approximation by superposition of sigmoidal functions. We point out a sufficient condition that the set of finite linear combinations of the form \(\sum \alpha _j\sigma (y_jx+\theta _j)\) is dense in \(C(\mathbb{I}^n)\), is the boundedness of the sigmoidal function σ(x). Moreover, we show that if the set of finite linear combinations of the form \(\sum c_j\omega (\xi _j+\eta _j)\), where ω is a univariate function, is dense in \(L^p[a,b] (1\leq p< \infty )\) (or C[a,b]) for any finite a,b, then the set of finite linear combinations of the form \(\sum c_j\omega (y_j.x+\theta _j)\) is dense in \(L^p(\mathbb{I}^n)(or C(\mathbb{I}^n))\). An extension in another direction is also presented in Theorem 4 of this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Cybenko, “Approximation by Superpositions of a Sigmoidal Function”, Mathematics of Control, Signals and Systems, V.2, No.4 (1989), P.303–314.

    Article  MathSciNet  MATH  Google Scholar 

  2. A.N. Komogorov, “On the Representation of Continuous Functions of Several Variables by Superposition of Continuous Functions of One Variable and Addition”, Dokl. Akad. Nawk. SSSR, 114, 1957 (pp.953–956) English translation, American Math. Soc. Transl (2), 28 (1963), pp.55–59, MR.22#2669; 27#3760.

    Google Scholar 

  3. E.M. Stein and Guido Weiss, “Introduction to Fourier Analysis on Euclidean Spaces”, Princeton University Press (1971).

    Google Scholar 

  4. L.K. Jones, “Constructive Approximation for Neural Networks by Sigmoidal Functions”, Technical Report Series, No.7, Dept. of Mathematics, University of Lowell (1988).

    Google Scholar 

  5. S.M. Carrol and B.W. Dickinson, “Construction of Neural Nets Using Radon Transform”, Preprint 1989.

    Google Scholar 

  6. K. Funahashi, “On the Approximate Realization of Continuous Mappings by Neural Networks”, Journal of International Neural Networks (to appear).

    Google Scholar 

  7. K. Hornik, M. Stinchcombe and H. White, “Multilayer Feedforward Networks are Universal Approximators”, Preprint 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag New York, Inc.

About this paper

Cite this paper

Chen, T., Chen, H., Liu, Rw. (1992). A Constructive Proof and An Extension of Cybenko’s Approximation Theorem. In: Page, C., LePage, R. (eds) Computing Science and Statistics. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2856-1_21

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-2856-1_21

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97719-5

  • Online ISBN: 978-1-4612-2856-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics