Optimal Non-Adaptive Tolerant Junta Testing via Local Estimators
CoRR(2024)
摘要
We give a non-adaptive algorithm that makes
2^Õ(√(klog(1/ε_2 - ε_1))) queries to a
Boolean function f:{± 1}^n →{± 1} and distinguishes
between f being ε_1-close to some k-junta versus
ε_2-far from every k-junta. At the heart of our algorithm is a
local mean estimation procedure for Boolean functions that may be of
independent interest. We complement our upper bound with a matching lower
bound, improving a recent lower bound obtained by Chen et al. We thus obtain
the first tight bounds for a natural property of Boolean functions in the
tolerant testing model.
更多查看译文
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要