Learning sub-classes of monotone DNF on the uniform distribution

DOI10.1007/3-540-49730-7_27MaRDI QIDQ4247017zbMATH OpenFDO

Authors Karsten A. Verbeurgt

Publication date 5 October 1999

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

Full work available at URL https://doi.org/10.1007/3-540-49730-7_27

zbMATH Keywords

learning algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning random monotone DNF
• On using the Fourier transform to learn disjoint DNF
• scientific article; zbMATH DE number 1804125

Cited in

(12)

• On using the Fourier transform to learn disjoint DNF
• On learning monotone DNF formulae under uniform distributions
• Learning functions of \(k\) relevant variables
• Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
• Intractability and approximation of optimization theories of cognition
• Learning DNF from random walks
• Learning Random Monotone DNF
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Learning intersections and thresholds of halfspaces
• Learning random monotone DNF
• On the limits of proper learnability of subclasses of DNF formulas
• On the Fourier spectrum of symmetric Boolean functions

This page was built for publication: Learning sub-classes of monotone DNF on the uniform distribution

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