Some improved sample complexity bounds in the probabilistic PAC learning model

DOI10.1007/3-540-57369-0_40MaRDI QIDQ4267803zbMATH OpenFDO

Authors Jun-Ichi Takeuchi

Publication date 24 October 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57369-0_40

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

This page was built for publication: Some improved sample complexity bounds in the probabilistic PAC learning model

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