A general dimension for approximately learning Boolean functions
From MaRDI portal
Recommendations
- A general dimension for exact learning
- Derandomized learning of Boolean functions
- Learning of bounded-weight Boolean functions
- An Algebraic Perspective on Boolean Function Learning
- Exact learning Boolean functions via the monotone theory
- Efficient Learning of Pseudo-Boolean Functions from Limited Training Data
- Learning Boolean functions in an infinite attribute space
- Probabilistic learning and Boolean functions
- Agnostically learning Boolean functions with finite polynomial representation
Cited in
(10)- Learning of bounded-weight Boolean functions
- A general dimension for query learning
- A general dimension for exact learning
- A Bound on the Precision Required to Estimate a Boolean Perceptron from Its Average Satisfying Assignment
- Representing and learning Boolean functions of multivalued features
- An Algebraic Perspective on Boolean Function Learning
- LEARNING CLASSES OF LINEARLY SEPARABLE BOOLEAN FUNCTIONS FROM POSITIVE EXAMPLES
- scientific article; zbMATH DE number 2045447 (Why is no real title available?)
- scientific article; zbMATH DE number 1895645 (Why is no real title available?)
- Algorithmic Learning Theory
This page was built for publication: A general dimension for approximately learning Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4420746)