Concentration estimates for learning with unbounded sampling
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 207-223 |
Journal / Publication | Advances in Computational Mathematics |
Volume | 38 |
Issue number | 1 |
Online published | 11 Oct 2011 |
Publication status | Published - Jan 2013 |
Link(s)
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.
Research Area(s)
- Concentration estimates, Empirical covering number, Learning theory, Least-square regression, Regularization in reproducing kernel Hilbert spaces
Citation Format(s)
Concentration estimates for learning with unbounded sampling. / Guo, Zheng-Chu; Zhou, Ding-Xuan.
In: Advances in Computational Mathematics, Vol. 38, No. 1, 01.2013, p. 207-223.
In: Advances in Computational Mathematics, Vol. 38, No. 1, 01.2013, p. 207-223.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review