We introduce into the classical Perceptron algorithm with margin a mechanism of unlearning which in the course of the regular update allows for a reduction of possible contributio...
This paper presents a novel Second Order Cone Programming (SOCP) formulation for large scale binary classification tasks. Assuming that the class conditional densities are mixture...
J. Saketha Nath, Chiranjib Bhattacharyya, M. Naras...
We present an improvement of Noviko 's perceptron convergence theorem. Reinterpreting this mistakebound as a margindependent sparsity guarantee allows us to give a PAC{style ...
Thore Graepel, Ralf Herbrich, Robert C. Williamson
In this paper we evaluate the performance of multilabel classification algorithms on the EUR-Lex database of legal documents of the European Union. On the same set of underlying d...
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...