Probabilistic learning and Boolean functions

MaRDI QIDQ3081623zbMATH OpenFDO

Authors Martin Anthony

Publication date 9 March 2011

zbMATH Keywords

learnability of Boolean functionsprobabilistic models

Mathematics Subject Classification ID

Boolean functions (06E30) Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning Boolean functions with queries
• Exact learning Boolean functions via the monotone theory
• Learning Monotone Boolean Functions by Uniformly Distributed Examples
• Learning Boolean functions in an infinite attribute space
• Efficient Learning of Pseudo-Boolean Functions from Limited Training Data

Cited in

(13)

• Learning Boolean functions in an infinite attribute space
• Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity
• Learning of bounded-weight Boolean functions
• Learning Boolean functions with queries
• Learning Coefficients and Reproducing True Probability Functions in Learning Systems
• An Algebraic Perspective on Boolean Function Learning
• scientific article; zbMATH DE number 1966612 (Why is no real title available?)
• scientific article; zbMATH DE number 2080652 (Why is no real title available?)
• scientific article; zbMATH DE number 1895645 (Why is no real title available?)
• scientific article; zbMATH DE number 6129640 (Why is no real title available?)
• Efficient Learning of Pseudo-Boolean Functions from Limited Training Data
• The computational complexity of understanding binary classifier decisions
• Statistical computational learning

This page was built for publication: Probabilistic learning and Boolean functions

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