Pages that link to "Item:Q1894459"
From MaRDI portal
The following pages link to An \(O(n^{\log \log n})\) learning algorithm for DNF under the uniform distribution (Q1894459):
Displaying 19 items.
- Upper bounds on Fourier entropy (Q344776) (← links)
- DNF sparsification and a faster deterministic counting algorithm (Q354649) (← links)
- Learning intersections and thresholds of halfspaces (Q598257) (← links)
- A note on the entropy/influence conjecture (Q713162) (← links)
- On the Fourier spectrum of symmetric Boolean functions (Q987559) (← links)
- A slight sharpening of LMN (Q1604204) (← links)
- Boolean functions: influence, threshold and noise (Q1620841) (← links)
- On learning monotone DNF under product distributions (Q1881232) (← links)
- Learning functions of \(k\) relevant variables (Q1886314) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- Proper learning of \(k\)-term DNF formulas from satisfying assignments (Q2323349) (← links)
- Learning DNF from random walks (Q2568457) (← links)
- Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas (Q2816303) (← links)
- The Fourier Entropy–Influence Conjecture for Certain Classes of Boolean Functions (Q3012817) (← links)
- Upper Bounds on Fourier Entropy (Q3196433) (← links)
- Fourier bounds and pseudorandom generators for product tests (Q5091757) (← links)
- (Q5121889) (← links)
- Agnostically Learning Boolean Functions with Finite Polynomial Representation (Q5136248) (← links)
- Hardness amplification within NP (Q5917544) (← links)
