Parallel attribute-efficient learning of monotone Boolean functions

DOI10.1007/3-540-44985-X_42MaRDI QIDQ2722007zbMATH OpenFDO

Authors Peter Damaschke

Publication date 11 July 2001

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

Full work available at URL https://doi.org/10.1007/3-540-44985-X_42

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• On parallel attribute-efficient learning.
• Adaptive versus nonadaptive attribute-efficient learning
• Exact learning Boolean functions via the monotone theory
• scientific article; zbMATH DE number 1775448
• The monotone theory for the PAC-model.

Cited in

(11)

• On parallel attribute-efficient learning.
• Approximate location of relevant variables under the crossover distribution.
• Adaptive versus nonadaptive attribute-efficient learning
• Almost all monotone Boolean functions are polynomially learnable using membership queries
• Guided inference of nested monotone Boolean functions
• Identification of partial disjunction, parity, and threshold functions
• Learning of monotone functions with single error correction
• Minimizing the average query complexity of learning monotone Boolean functions
• On learning monotone Boolean functions with irrelevant variables
• Derandomized learning of Boolean functions
• scientific article; zbMATH DE number 1775448 (Why is no real title available?)

This page was built for publication: Parallel attribute-efficient learning of monotone Boolean functions

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