Simple PAC learning of simple decision lists

DOI10.1007/3-540-60454-5_42MaRDI QIDQ6083914zbMATH OpenOpenAlexFDO

Authors Jorge Castro, José L. Balcázar

Publication date 8 December 2023

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

Full work available at URL https://doi.org/10.1007/3-540-60454-5_42

Mathematics Subject Classification ID

Data structures (68P05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Computational learning theory (68Q32)

Recommendations

• Lower bounds on learning decision lists and trees
• Lower bounds on learning decision lists and trees
• PAC learning under helpful distributions
• PACS, simple-PAC and query learning
• PAC learning with simple examples

Cites work

• A theory of the learnable
• scientific article; zbMATH DE number 107774 (Why is no real title available?)
• Learning regular sets from queries and counterexamples
• Learning Simple Concepts under Simple Distributions
• Queries and concept learning

Cited in

(2)

• scientific article; zbMATH DE number 3911752 (Why is no real title available?)
• PAC learning with simple examples

This page was built for publication: Simple PAC learning of simple decision lists

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