ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 0909.5000
109
68

Eignets for function approximation on manifolds

28 September 2009
H. Mhaskar
ArXivPDFHTML
Abstract

Let \XX\XX\XX be a compact, smooth, connected, Riemannian manifold without boundary, G:\XX×\XX→\RRG:\XX\times\XX\to \RRG:\XX×\XX→\RR be a kernel. Analogous to a radial basis function network, an eignet is an expression of the form ∑j=1MajG(∘,yj)\sum_{j=1}^M a_jG(\circ,y_j)∑j=1M​aj​G(∘,yj​), where aj∈\RRa_j\in\RRaj​∈\RR, yj∈\XXy_j\in\XXyj​∈\XX, 1≤j≤M1\le j\le M1≤j≤M. We describe a deterministic, universal algorithm for constructing an eignet for approximating functions in Lp(μ;\XX)L^p(\mu;\XX)Lp(μ;\XX) for a general class of measures μ\muμ and kernels GGG. Our algorithm yields linear operators. Using the minimal separation amongst the centers yjy_jyj​ as the cost of approximation, we give modulus of smoothness estimates for the degree of approximation by our eignets, and show by means of a converse theorem that these are the best possible for every \emph{individual function}. We also give estimates on the coefficients aja_jaj​ in terms of the norm of the eignet. Finally, we demonstrate that if any sequence of eignets satisfies the optimal estimates for the degree of approximation of a smooth function, measured in terms of the minimal separation, then the derivatives of the eignets also approximate the corresponding derivatives of the target function in an optimal manner.

View on arXiv
Comments on this paper