• DocumentCode
    2249155
  • Title

    Approximate interpolation by a class of neural networks in Lebesgue metric

  • Author

    Ding, Chunmei ; Yuan, Yubo ; Cao, Feilong

  • Author_Institution
    Inst. of Metrol. & Comput. Sci., China Jiliang Univ., Hangzhou, China
  • Volume
    6
  • fYear
    2010
  • fDate
    11-14 July 2010
  • Firstpage
    3134
  • Lastpage
    3139
  • Abstract
    In this paper, a class of approximate interpolation neural networks is constructed to approximate Lebesgue integrable functions. It is showed that the networks can arbitrarily approximate any p-th Lebesgue integrable function in Lebesgue metric as long as the number of hidden nodes is sufficiently large. The relation among the approximation speed, the number of hidden nodes, the interpolation sample and the smoothness of the target function is also revealed by designing the Steklov mean function and the modulus of smoothness of f. The obtained results are helpful in studying the problem of approximation complexity of interpolation neural networks in Lebesgue metric.
  • Keywords
    approximation theory; interpolation; neural nets; Lebesgue metrix; Steklov mean function; approximate interpolation; neural networks; p-th Lebesgue integrable function approximation; Artificial neural networks; Approximation; Estimate of error; Interpolation; Lebesgue metric; Neural networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Machine Learning and Cybernetics (ICMLC), 2010 International Conference on
  • Conference_Location
    Qingdao
  • Print_ISBN
    978-1-4244-6526-2
  • Type

    conf

  • DOI
    10.1109/ICMLC.2010.5580730
  • Filename
    5580730