Learning monotone log-term DNF formulas under the uniform distribution

DOI10.1007/S002249910002MaRDI QIDQ1969435zbMATH OpenOpenAlexFDO

Authors Yoshifumi Sakai, A. Maruoka

Publication date 16 March 2000

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002249910002

zbMATH Keywords

learnabilityPAC learning model

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On learning monotone DNF formulae under uniform distributions
• scientific article; zbMATH DE number 1804125
• On learning monotone DNF under product distributions
• Learning k-Term Monotone Boolean Formulae.
• Learning Random Monotone DNF

Cited in

(13)

• On learning monotone DNF formulae under uniform distributions
• The learnability of exclusive-or expansions based on monotone DNF formulas
• On learning monotone DNF under product distributions
• Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
• An \(O(n^{\log \log n})\) learning algorithm for DNF under the uniform distribution
• Proper learning of \(k\)-term DNF formulas from satisfying assignments
• Learning DNF from random walks
• scientific article; zbMATH DE number 1804125 (Why is no real title available?)
• Learning Random Monotone DNF
• scientific article; zbMATH DE number 17552 (Why is no real title available?)
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Learning intersections and thresholds of halfspaces
• Learning random monotone DNF

This page was built for publication: Learning monotone log-term DNF formulas under the uniform distribution

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