Unconfused ultraconservative multiclass algorithms

DOI10.1007/S10994-015-5490-3zbMATH Open1331.68191arXiv1506.07254OpenAlexW2104970751MaRDI QIDQ2353009FDOQ2353009

Authors: Ugo Louche, Liva Ralaivola 

Publication date: 7 July 2015

Published in: Machine Learning (Search for Journal in Brave)

Abstract: We tackle the problem of learning linear classifiers from noisy datasets in a multiclass setting. The two-class version of this problem was studied a few years ago where the proposed approaches to combat the noise revolve around a Per-ceptron learning scheme fed with peculiar examples computed through a weighted average of points from the noisy training set. We propose to build upon these approaches and we introduce a new algorithm called UMA (for Unconfused Multiclass additive Algorithm) which may be seen as a generalization to the multiclass setting of the previous approaches. In order to characterize the noise we use the confusion matrix as a multiclass extension of the classification noise studied in the aforemen-tioned literature. Theoretically well-founded, UMA furthermore displays very good empirical noise robustness, as evidenced by numerical simulations conducted on both synthetic and real data.

Full work available at URL: https://arxiv.org/abs/1506.07254

Recommendations

• 10.1162/jmlr.2003.3.4-5.951
• scientific article; zbMATH DE number 1804099
• Learning Kernel Perceptrons on Noisy Data Using Random Projections
• scientific article; zbMATH DE number 6982911
• Noise tolerant variants of the perceptron algorithm

zbMATH Keywords

confusion matrixperceptronmulticlass classificationnoisy labelsultraconservative algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• The Forgetron: A Kernel-Based Perceptron on a Budget
• An introduction to support vector machines and other kernel-based learning methods.
• 10.1162/153244303768966085
• Title not available (Why is that?)
• Large margin classification using the perceptron algorithm
• Title not available (Why is that?)
• A theory of the learnable
• Title not available (Why is that?)
• 10.1162/jmlr.2003.3.4-5.951
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• On the Nyström method for approximating a gram matrix for improved kernel-based learning
• A polynomial-time algorithm for learning noisy linear threshold functions
• Canonical transformations of the extended phase space, Toda lattices and the Stäckel family of integrable systems
• The Perceptron: A Model for Brain Functioning. I
• Title not available (Why is that?)
• Learning Kernel Perceptrons on Noisy Data Using Random Projections
• Unconfused ultraconservative multiclass algorithms
• Multiclass learnability and the ERM principle

Cited In (1)

• Unconfused ultraconservative multiclass algorithms

Uses Software

• UCI-ml
• Forgetron

This page was built for publication: Unconfused ultraconservative multiclass algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353009)