On learning monotone DNF under product distributions
From MaRDI portal
Publication:1881232
DOI10.1016/j.ic.2004.04.003zbMath1076.68037OpenAlexW2011717937WikidataQ59831533 ScholiaQ59831533MaRDI QIDQ1881232
Publication date: 4 October 2004
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2004.04.003
Related Items (8)
Learning juntas in the presence of noise ⋮ Submodular Functions: Learnability, Structure, and Optimization ⋮ Learning random monotone DNF ⋮ Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles ⋮ Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas ⋮ On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance ⋮ Proper learning of \(k\)-term DNF formulas from satisfying assignments ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A guided tour of Chernoff bounds
- On using the Fourier transform to learn disjoint DNF
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
- More efficient PAC-learning of DNF with membership queries under the uniform distribution
- An \(O(n^{\log \log n})\) learning algorithm for DNF under the uniform distribution
- Learning monotone log-term DNF formulas under the uniform distribution
- Queries and concept learning
- Exact learning Boolean functions via the monotone theory
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
- Constant depth circuits, Fourier transform, and learnability
- A theory of the learnable
- Monotone versus positive
- Learning Boolean formulas
- On the Fourier spectrum of monotone functions
This page was built for publication: On learning monotone DNF under product distributions
