The regularized least squares algorithm and the problem of learning halfspaces

12 years 11 months ago

Download itb.biologie.hu-berlin.de

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.

Ha Quang Minh

Real-time Traffic

IPL 2011 | Monotonic Noise | Reproducing Kernel | Sample Complexity |

claim paper

» Learning Rates of LeastSquare Regularized Regression

» A least squares formulation for a class of generalized eigenvalue problems in machine lear...

» Least Squares SVM for Least Squares TD Learning

» Regularized Alternating Least Squares Algorithms for Nonnegative MatrixTensor Factorizatio...

» Efficient approximate Regularized Least Squares by Toeplitz matrix

» LeastSquares Independent Component Analysis

» Sparse LeastSquares Methods in the Parallel Machine Learning PML Framework

» Regularized Least Squares Cancer Classifiers from DNA microarray data

Post Info
More Details (n/a)

Added	14 May 2011
Updated	14 May 2011
Type	Journal
Year	2011
Where	IPL
Authors	Ha Quang Minh

Comments (0)

Sciweavers

The regularized least squares algorithm and the problem of learning halfspaces

IPL 2011 | Monotonic Noise | Reproducing Kernel | Sample Complexity |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers