The regularized least squares algorithm and the problem of learning halfspaces

Authors:
Ha Quang Minh
Affiliations:
Institute for Theoretical Biology, Humboldt University of Berlin, Invalidenstrasse 43, Berlin D-10115, Germany
Venue:
Information Processing Letters
Year:
2011

Citing 11
Cited 0

The perceptron algorithm is fast for nonmalicious distributions

Neural Computation
Halfspace learning, linear programming, and nonmalicious distributions

Information Processing Letters
Efficient noise-tolerant learning from statistical queries

Journal of the ACM (JACM)
Learning From Noisy Examples

Machine Learning
Efficient algorithms in computational learning theory

Efficient algorithms in computational learning theory
Everything old is new again: a fresh look at historical approaches in machine learning

Everything old is new again: a fresh look at historical approaches in machine learning
An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution

Information Processing Letters
Learning intersections and thresholds of halfspaces

Journal of Computer and System Sciences - Special issue on FOCS 2002
Agnostically Learning Halfspaces

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A Learning-Theory Approach to Sensor Networks

IEEE Pervasive Computing
On the sample complexity of PAC learning half-spaces against the uniform distribution

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.89

Visualization

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.