Testing whether a Boolean function is a k-junta and finding its relevant variables have the same optimal sample complexity, achieved by the brute-force consistent-set algorithm.
Distribution testing lower bounds via reductions from communication complexity
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
-
Feature Selection and Junta Testing are Statistically Equivalent
Testing whether a Boolean function is a k-junta and finding its relevant variables have the same optimal sample complexity, achieved by the brute-force consistent-set algorithm.