Concentration estimates for learning with unbounded sampling

Zheng-Chu Guo, Ding-Xuan Zhou

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

41 Citations (Scopus)

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 languageEnglish
Pages (from-to)207-223
JournalAdvances in Computational Mathematics
Volume38
Issue number1
Online published11 Oct 2011
DOIs
Publication statusPublished - Jan 2013

Research Keywords

  • Concentration estimates
  • Empirical covering number
  • Learning theory
  • Least-square regression
  • Regularization in reproducing kernel Hilbert spaces

Fingerprint

Dive into the research topics of 'Concentration estimates for learning with unbounded sampling'. Together they form a unique fingerprint.

Cite this