English

Eignets for function approximation on manifolds

Machine Learning 2009-09-29 v1 Numerical Analysis Neural and Evolutionary Computing

Abstract

Let \XX\XX be a compact, smooth, connected, Riemannian manifold without boundary, G:\XX×\XX\RRG:\XX\times\XX\to \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), where aj\RRa_j\in\RR, yj\XXy_j\in\XX, 1jM1\le j\le M. We describe a deterministic, universal algorithm for constructing an eignet for approximating functions in Lp(μ;\XX)L^p(\mu;\XX) for a general class of measures μ\mu and kernels GG. Our algorithm yields linear operators. Using the minimal separation amongst the centers yjy_j 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_j 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.

Keywords

Cite

@article{arxiv.0909.5000,
  title  = {Eignets for function approximation on manifolds},
  author = {H. N. Mhaskar},
  journal= {arXiv preprint arXiv:0909.5000},
  year   = {2009}
}

Comments

28 pages. Articles in press; Applied and Computational Harmonic Analysis, 2009

R2 v1 2026-06-21T13:51:14.089Z