REVIEW 2 cited by
Testing Junta Truncation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
We consider the basic statistical problem of detecting truncation of the uniform distribution on the Boolean hypercube by juntas. More concretely, we give upper and lower bounds on the problem of distinguishing between i.i.d. sample access to either (a) the uniform distribution over $\{0,1\}^n$, or (b) the uniform distribution over $\{0,1\}^n$ conditioned on the satisfying assignments of a $k$-junta $f: \{0,1\}^n\to\{0,1\}$. We show that (up to constant factors) $\min\{2^k + \log{n\choose k}, {2^{k/2}\log^{1/2}{n\choose k}}\}$ samples suffice for this task and also show that a $\log{n\choose k}$ dependence on sample complexity is unavoidable. Our results suggest that testing junta truncation requires learning the set of relevant variables of the junta.
Forward citations
Cited by 2 Pith papers
-
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.
-
New Statistical and Computational Results for Learning Junta Distributions
Learning junta distributions is computationally equivalent to LPN, and a new algorithm achieves near-optimal sample complexity O((k/epsilon^2)(2^k + log n)).
Discussion (0). Continue with ORCID to comment.