We present a new class of perceptron-like algorithms with margin in which the “effective” learning rate, defined as the ratio of the learning rate to the length of the weight vector, remains constant. We prove that the new algorithms converge in a finite number of steps and show that there exists a limit of the parameters involved in which convergence leads to classification with maximum margin

Shawe-Taylor, John

Tsampouka, Petroula

CiteSeerX

Southampton (e-Prints Soton)

English

An Introduction to Support Vector Machines

Analysis of generic perceptron-like large margin classiﬁers. ECML

Analysis of hidden units in a layered network trained to classify sonar targets.

Learning algorithms with optimal stability in neural networks.

new approximate maximal margin classiﬁcation algorithm.

Pattern Classsiﬁcation and Scene Analysis

Structural risk minimization over data-dependent hierarchies.

The Nature of Statistical Learning Theory

The perceptron algorithm with uneven margins.

The perceptron: A probabilistic model for information storage and organization in the brain.

Theoretical foundations of the potential function method in pattern recognition learning. Automation and remote control 25

Constant Rate Approximate Maximum Margin Algorithms