Simultaneous approximation by spherical neural networks

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

Approximation capabilities of the spherical neural networks (SNNs) are considered in this paper. Based on a known Taylor formula, we prove that, for non-polynomial target function, rates of simultaneously approximating the function itself and its (Laplace–Beltrami) derivatives by SNNs is not slower than those by the spherical polynomials (SPs). Then, the simultaneous approximation rates of SPs automatically derive the rates of SNNs.

Original languageEnglish
Pages (from-to)348-354
Number of pages7
JournalNeurocomputing
Volume175
Issue numberPartA
DOIs
StatePublished - 22 May 2015
Externally publishedYes

Keywords

  • Laplace–Beltrami operator
  • Simultaneous approximation
  • Spherical neural networks
  • Spherical polynomials

Fingerprint

Dive into the research topics of 'Simultaneous approximation by spherical neural networks'. Together they form a unique fingerprint.

Cite this