Skip to main content

The Universal Approximation Capabilities of Mellin Approximate Identity Neural Networks

  • Conference paper
Advances in Neural Networks – ISNN 2013 (ISNN 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7951))

Included in the following conference series:

Abstract

Universal approximation capability of feedforward neural networks with one hidden layer states that these networks are dense in the space of functions. In this paper, the concept of the Mellin approximate identity functions is proposed. By using this concept, It is shown that feedforward Mellin approximate identity neural networks with one hidden layer can approximate any positive real continuous function to any degree of accuracy. Moreover, universal approximation capability of these networks is extended to positive real Lebesgue spaces.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Arik, S.: Global asymptotic stability of a class of dynamical neural networks. IEEE Trans. Circuits Syst. 47, 568–571 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cybenko, G.: Approximation by superpositions of a sigmoid function. Mathematics of Control, Signal, and Systems 3, 303–314 (1989)

    Article  MathSciNet  Google Scholar 

  3. Funuhashi, K.: On the approximate realization of continuous mapping by neural networks. Neural Networks 2, 359–366 (1989)

    Article  Google Scholar 

  4. Hahm, N., Hong, B.I.: An approximation by neural networks with a fixed weight. Computers and Mathematics with Applications 47, 1897–1903 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Hornik, K., Stinchcombe, M., White, H.: Multilayer feedforward networks are universal approximators. Neural Networks 2, 359–366 (1989)

    Article  Google Scholar 

  6. Leshno, M., Pinkus, A., Shocken, S.: Multilayer feedforward neural networks with a polynomial activation function can approximate any function. Neural Networks 6, 861–867 (1993)

    Article  Google Scholar 

  7. Li, F.: Function approximation by neural networks. In: Proceedings 5th International Symposium on Neural Networks, pp. 348–390 (2008)

    Google Scholar 

  8. Panahian Fard, S., Zainuddin, Z.: Analyses for L p[a, b]-norm approximation capability of flexible approximate identity neural networks. Accepted in Neural Computing and Applications 23: Special Issues on ICONIP 2012 (2013b)

    Google Scholar 

  9. Panahian Fard, S., Zainuddin, Z.: On the universal approximation capability of flexible approximate identity neural networks. In: Wong, W.E., Ma, T. (eds.) Emerging Technologies for Information Systems, Computing, and Management. LNEE, vol. 236, XXV, 1339 p. 499 (2013a) ISBN 978-1-4614-7010-6, doi:10.1007/978-1-4614-7010-6-23

    Google Scholar 

  10. Park, J., Sandberg, I.W.: universal approximation using radial-basis-function networks. Neural Computation 3, 246–257 (1991)

    Article  Google Scholar 

  11. Park, J., Sandberg, I.W.: Approximation and radial-basis-functions networks. Neural Computation 5, 305–316 (1993)

    Article  Google Scholar 

  12. Poggio, T., Girosi, F.: A theory of networks for approximation and learning. Ai, Memo 1140. Artificial Intelligence Laboratory, MIT, Cambridge (1989)

    Google Scholar 

  13. Rupasov, V.I., Lebedev, M.A., Erlichman, J.S., Linderman, M.: Neuronal variability during handwriting: lognormal distribution. PLoS One 7, e34759 (2012)

    Google Scholar 

  14. Scarselli, F., Tsoi, A.C.: Universal approximation using feed forward neural networks: a survey of some existing methods, and some new results. Neural Networks 11, 15–37 (1998)

    Article  Google Scholar 

  15. Tikk, D., Koczy, L.T., Gedeon, T.D.: A survey on universal approximation and its limits in soft computing techniques. International Journal of Approximate Reasoning 33, 185–202 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  16. Turchetti, C., Conti, M., Crippa, P., Orcioni, S.: On the approximation of stochastic processes by approximate identity neural networks. IEEE Transactions on Neural Networks 9, 1069–1085 (1998)

    Article  Google Scholar 

  17. Wu, W., Nan, D., Li, Z., Long, J., Wang, J.: Approximation to compact set of functions by feedforward neural networks. In: Proceedings 20th International Joint Conference on Neural Networks, pp. 1222–1225 (2007)

    Google Scholar 

  18. Zainuddin, Z., Fard, S.P.: Double approximate identity neural networks universal approximation in real lebesgue spaces. In: Huang, T., Zeng, Z., Li, C., Leung, C.S. (eds.) ICONIP 2012, Part I. LNCS, vol. 7663, pp. 409–415. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Panahian Fard, S., Zainuddin, Z. (2013). The Universal Approximation Capabilities of Mellin Approximate Identity Neural Networks. In: Guo, C., Hou, ZG., Zeng, Z. (eds) Advances in Neural Networks – ISNN 2013. ISNN 2013. Lecture Notes in Computer Science, vol 7951. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39065-4_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39065-4_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39064-7

  • Online ISBN: 978-3-642-39065-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics