A polynomial-time algorithm learns O(log n)-juntas over smoothed Markov random fields, generalizing Kalai-Teng's product-distribution result.
Weakly learning dnf and characterizing statistical query learning using fourier analysis
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Learning Juntas under Markov Random Fields
A polynomial-time algorithm learns O(log n)-juntas over smoothed Markov random fields, generalizing Kalai-Teng's product-distribution result.