A learning generalization bound with an application to sparse-representation classifiers

DOI10.1023/A:1007605716762MaRDI QIDQ5928991zbMATH OpenFDO

Authors Yoram Gat

Publication date 8 October 2001

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1007605716762

zbMATH Keywords

classifiergeneralization abilityVC dimension

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Structured sparsity and generalization
• 10.1162/153244302760200704
• scientific article; zbMATH DE number 2080458
• Data representations and generalization error in kernel based learning machines
• Generalization bounds for voting classifiers based on sparsity and clustering.

Cited in

(7)

• Learning the set covering machine by bound minimization and margin-sparsity trade-off
• A sparsity driven kernel machine based on minimizing a generalization error bound
• Data representations and generalization error in kernel based learning machines
• On classification of signals represented with data-dependent overcomplete dictionaries
• scientific article; zbMATH DE number 5957262 (Why is no real title available?)
• Generalized Thresholding and Online Sparsity-Aware Learning in a Union of Subspaces
• Structured sparsity and generalization

This page was built for publication: A learning generalization bound with an application to sparse-representation classifiers

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