Abstract
The least-square regression problem is considered by regularization schemes in reproducing kernel Hilbert spaces. The learning algorithm is implemented with samples drawn from unbounded sampling processes. The purpose of this paper is to present concentration estimates for the error based on ℓ2-empirical covering numbers, which improves learning rates in the literature. © 2011 Springer Science+Business Media, LLC.
Original language | English |
---|---|
Pages (from-to) | 207-223 |
Journal | Advances in Computational Mathematics |
Volume | 38 |
Issue number | 1 |
Online published | 11 Oct 2011 |
DOIs | |
Publication status | Published - Jan 2013 |
Research Keywords
- Concentration estimates
- Empirical covering number
- Learning theory
- Least-square regression
- Regularization in reproducing kernel Hilbert spaces