zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Estimating the approximation error in learning theory. (English) Zbl 1079.68089
Summary: Let $B$ be a Banach space and $(\cal H, \Vert \cdot \Vert_H)$ be a dense, imbedded subspace. For $a \in B$, its distance to the ball of $\cal H$ with radius $R$ (denoted as $I(a, R)$) tends to zero when $R$ tends to infinity. We are interested in the rate of this convergence. This approximation problem arose from the study of learning theory, where $B$ is the $L_2$ space and $\cal H$ is a reproducing kernel Hilbert space. The class of elements having $I(a, R) = O(R^{-r})$ with $r > 0$ is an interpolation space of the couple $(B,\cal H)$. The rate of convergence can often be realized by linear operators. In particular, this is the case when $\cal H$ is the range of a compact, symmetric, and strictly positive definite linear operator on a separable Hilbert space $B$. For the kernel approximation studied in learning theory, the rate depends on the regularity of the kernel function. This yields error estimates for the approximation by reproducing kernel Hilbert spaces. When the kernel is smooth, the convergence is slow and a logarithmic convergence rate is presented for analytic kernels in this paper. The purpose of our results is to provide some theoretical estimates, including the constants, for the approximation error required for the learning theory.

68T05Learning and adaptive systems
41A25Rate of convergence, degree of approximation
Full Text: DOI