Optimal learning of bandlimited functions from localized sampling

Authors:
Charles A. Micchelli;Yuesheng Xu;Haizhang Zhang
Affiliations:
Department of Mathematics and Statistics, State University of New York, The University at Albany, Albany, NY 12222, USA;Department of Mathematics, Syracuse University, Syracuse, NY 13244, USA;Institute of Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, PR China
Venue:
Journal of Complexity
Year:
2009

Citing 3
Cited 3

Real and complex analysis, 3rd ed.

Real and complex analysis, 3rd ed.
Refinable Kernels

The Journal of Machine Learning Research
Refinement of Reproducing Kernels

The Journal of Machine Learning Research

Reproducing kernel banach spaces for machine learning

IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Reproducing Kernel Banach Spaces for Machine Learning

The Journal of Machine Learning Research
Optimal order of truncation and aliasing errors for multi-dimensional Whittaker-Shannon sampling expansion

International Journal of Wireless and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An optimal algorithm for approximating bandlimited functions from localized sampling is established. Several equivalent formulations for the approximation error of the optimal algorithm are presented and its upper and lower bound estimates for the univariate case are provided. The estimates show that the approximation error decays exponentially (but not faster) as the number of localized samplings increases. As a consequence of these results, we obtain an upper bound estimate for the eigenvalues of an integral operator that arises in the bandwidth problem.