On the sample complexity of weak learning

DOI10.1006/INCO.1995.1045zbMATH Open0826.68102OpenAlexW2029599246MaRDI QIDQ1892883FDOQ1892883

Authors: Sally A. Goldman, Michael Kearns, Robert E. Schapire 

Publication date: 10 July 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/9c6b80742893134c436365a31f9b845b24d15a54

Recommendations

• Computing and Combinatorics
• Improved bounds on the sample complexity of learning
• Publication:4952633
• On weak learning
• scientific article; zbMATH DE number 408770
• Sample size lower bounds in PAC learning by Algorithmic Complexity Theory
• scientific article; zbMATH DE number 67633
• The optimal sample complexity of PAC learning
• Characterizing the sample complexity of private learners

zbMATH Keywords

weak learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cited In (8)

• Agnostic Learning from Tolerant Natural Proofs
• Computational sample complexity and attribute-efficient learning
• Characterizing the sample complexity of private learners
• On weak learning
• Estimation of the hardness of the learning with errors problem with a restricted number of samples
• An overtraining-resistant stochastic modeling method for pattern recognition
• Title not available (Why is that?)
• Computational sample complexity and attribute-efficient learning

This page was built for publication: On the sample complexity of weak learning

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