Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
427344 | Information Processing Letters | 2011 | 7 Pages |
Abstract
We provide sample complexity of the problem of learning halfspaces with monotonic noise, using the regularized least squares algorithm in the reproducing kernel Hilbert spaces (RKHS) framework.
Research highlights► We provide the sample complexity for the problem of learning halfspaces under monotonic noise using the regularized least squares algorithm. ► We give the proof using the reproducing kernel Hilbert space (RKHS) framework. ► We show a connection between the RKHS framework and traditional computational learning theory.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ha Quang Minh,