Learning Monotone Boolean Functions by Uniformly Distributed Examples
From MaRDI portal
Recommendations
Cited in
(19)- Learning Boolean functions in an infinite attribute space
- Nonuniform learnability
- On the learnability of monotone \(k\mu\)-DNF formulae under product distributions
- Almost all monotone Boolean functions are polynomially learnable using membership queries
- On specifying Boolean functions by labelled examples
- \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration
- Exact learning Boolean functions via the monotone theory
- Probabilistic learning and Boolean functions
- scientific article; zbMATH DE number 4060753 (Why is no real title available?)
- Computational limitations on learning from examples
- scientific article; zbMATH DE number 17552 (Why is no real title available?)
- scientific article; zbMATH DE number 67632 (Why is no real title available?)
- LEARNING CLASSES OF LINEARLY SEPARABLE BOOLEAN FUNCTIONS FROM POSITIVE EXAMPLES
- Learning Boolean formulas
- scientific article; zbMATH DE number 1163915 (Why is no real title available?)
- scientific article; zbMATH DE number 1966606 (Why is no real title available?)
- scientific article; zbMATH DE number 1500576 (Why is no real title available?)
- scientific article; zbMATH DE number 4197455 (Why is no real title available?)
- On learning monotone Boolean functions under the uniform distribution
This page was built for publication: Learning Monotone Boolean Functions by Uniformly Distributed Examples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016915)