Learning sparse low-threshold linear classifiers

MaRDI QIDQ5744804zbMATH OpenFDO

Authors Sivan Sabato, Shai Shalev-Shwartz, Nathan Srebro, Daniel Hsu, Tong Zhang

Publication date 19 February 2016

Full work available at URL https://arxiv.org/abs/1212.3276, http://jmlr.csail.mit.edu/papers/v16/sabato15a.html

zbMATH Keywords

empirical risk minimizationlinear classifiersmonotone disjunctionsonline learninguniform convergence

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On-line learning with linear loss constraints.
• Learning rates for l^1-regularized kernel classifiers
• Efficient learning with virtual threshold gates
• scientific article; zbMATH DE number 5968873
• A polynomial-time algorithm for learning noisy linear threshold functions

Cited in

(5)

• Robust linear classification from limited training data
• scientific article; zbMATH DE number 5968873 (Why is no real title available?)
• Generalized Thresholding and Online Sparsity-Aware Learning in a Union of Subspaces
• Hinge-minimax learner for the ensemble of hyperplanes
• Learning Theory

This page was built for publication: Learning sparse low-threshold linear classifiers

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