Bounds on the Number of Examples Needed for Learning Functions

DOI10.1137/S0097539793259185MaRDI QIDQ4337647zbMATH OpenOpenAlexFDO

Authors Hans Ulrich Simon

Publication date 26 May 1997

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539793259185

zbMATH Keywords

function learningsample complexity

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• General bounds on the number of examples needed for learning probabilistic concepts
• A general lower bound on the number of examples needed for learning
• scientific article; zbMATH DE number 67634
• On the learnability of rich function classes

Cited in

(6)

• A general lower bound on the number of examples needed for learning
• Efficient algorithms for learning functions with bounded variation
• On the complexity of function learning
• General bounds on the number of examples needed for learning probabilistic concepts
• Improved bounds about on-line learning of smooth functions of a single variable
• Sample compression for real-valued learners

This page was built for publication: Bounds on the Number of Examples Needed for Learning Functions

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