Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. Artificial Intelligence Lab Publications
  4. AI Memos (1959 - 2004)
  5. Convergence Rates of Approximation by Translates

Convergence Rates of Approximation by Translates

Thumbnail Image
Download
Name

AIM-1288.pdf

Size

321.6 KB

Format

Adobe PDF

Checksum (MD5)

99a46bb3bb7386e80d330d2c6cdb6518

Thumbnail Image
Download
Name

AIM-1288.ps.Z

Size

75.84 KB

Format

Unknown

Checksum (MD5)

be57be0c8fd2fb625a85c862201833b6

Author(s)
Girosi, Federico
•
Anzellotti, Gabriele
Date Issued
March 1, 1992
Series/Report no.
AIM-1288
Abstract
In this paper we consider the problem of approximating a function belonging to some funtion space Φ by a linear comination of n translates of a given function G. Ussing a lemma by Jones (1990) and Barron (1991) we show that it is possible to define function spaces and functions G for which the rate of convergence to zero of the erro is 0(1/n) in any number of dimensions. The apparent avoidance of the "curse of dimensionality" is due to the fact that these function spaces are more and more constrained as the dimension increases. Examples include spaces of the Sobolev tpe, in which the number of weak derivatives is required to be larger than the number of dimensions. We give results both for approximation in the L2 norm and in the Lc norm. The interesting feature of these results is that, thanks to the constructive nature of Jones" and Barron"s lemma, an iterative procedure is defined that can achieve this rate.
Persistent DSpace Link
http://hdl.handle.net/1721.1/7316
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.