arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2308.13992cs.CCcs.DSmath.PRmath.STstat.TH
收藏

测试 Junta 截断

Testing Junta Truncation

William He, Shivam Nadimpalli

AI总结:

本文研究检测布尔超立方体上均匀分布被 junta 截断的统计问题,给出了样本复杂度的上下界,并表明该任务需要学习 junta 的相关变量集合。

摘要:

我们考虑在布尔超立方体上均匀分布被 junta 截断的检测这一基本统计问题。更具体地说,我们给出了区分以下两种独立同分布样本访问问题的上下界:(a) 在 $\{0,1\}^n$ 上的均匀分布,或 (b) 在 $\{0,1\}^n$ 上均匀分布且以 $k$-junta $f: \{0,1\}^n\to\{0,1\}$ 的满足赋值为条件的分布。我们证明(在常数因子范围内)$\min\{2^k + \log{n\choose k}, {2^{k/2}\log^{1/2}{n\choose k}}\}$ 个样本足以完成此任务,并且还表明样本复杂度的 $\log{n\choose k}$ 依赖是不可避免的。我们的结果表明,测试 junta 截断需要学习 junta 的相关变量集合。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑