arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1811.01427cs.DMcs.CC
收藏

单调性测试的论域约简:$d$维布尔函数的$o(d)$测试器

Domain Reduction for Monotonicity Testing: A $o(d)$ Tester for Boolean Functions in $d$-Dimensions

Hadley Black, Deeparnab Chakrabarty, C. Seshadhri

摘要:

我们描述了一个$\tilde{O}(d^{5/6})$ -查询单调性测试布尔函数$f:[n]^d \to \{0,1\}$上的$n$ -超网格。这是第一个查询复杂度独立于$n$的$o(d)$单调性测试器。出于这种独立性的$n$,我们开始研究的单调性测试的可测量的布尔函数$f:\mathbb{R}^d \to \{0,1\}$在连续域,其中的距离测量相对于产品分布在$\mathbb{R}^d$。我们给出了一个$\tilde{O}(d^{5/6})$查询单调性测试这样的功能。我们的主要技术成果是单调性的域缩减定理。对于任何函数$f:[n]^d \to \{0,1\}$,令$ε_f$是它到单调性的距离。考虑原始域的随机$[k]^d$子超网格上的函数的限制$\hat{f}$。我们表明,对于$k = \text{poly}(d/ε)$,预期的距离的限制是$\mathbb{E}[ε_{\hat{f}}] = Ω(ε_f)$。以前,这样的结果仅为$d=1$所知(Berman-Raskhodova-Yaroslavtsev,STOC 2014)。我们在$[n]^d$上测试布尔函数的结果随后应用Black-Chakrabarty-Seshadhri的$d^{5/6}\cdot \text{poly}(1/ε,\log n, \log d)$查询超网格测试器(SODA 2018)。为了获得测试布尔函数在$\mathbb{R}^d$的结果,我们使用标准的测量理论工具,以减少单调性测试的可测量的功能$f$的单调性测试的离散化版本的$f$在超网格域$[N]^d$的大,但有限,$N$(可能取决于$f$)。超网格测试程序中$N$的独立性对于最终测试程序通过$\mathbb{R}^d$至关重要。

英文摘要:

We describe a $\tilde{O}(d^{5/6})$-query monotonicity tester for Boolean functions $f:[n]^d \to \{0,1\}$ on the $n$-hypergrid. This is the first $o(d)$ monotonicity tester with query complexity independent of $n$. Motivated by this independence of $n$, we initiate the study of monotonicity testing of measurable Boolean functions $f:\mathbb{R}^d \to \{0,1\}$ over the continuous domain, where the distance is measured with respect to a product distribution over $\mathbb{R}^d$. We give a $\tilde{O}(d^{5/6})$-query monotonicity tester for such functions. Our main technical result is a domain reduction theorem for monotonicity. For any function $f:[n]^d \to \{0,1\}$, let $ε_f$ be its distance to monotonicity. Consider the restriction $\hat{f}$ of the function on a random $[k]^d$ sub-hypergrid of the original domain. We show that for $k = \text{poly}(d/ε)$, the expected distance of the restriction is $\mathbb{E}[ε_{\hat{f}}] = Ω(ε_f)$. Previously, such a result was only known for $d=1$ (Berman-Raskhodnikova-Yaroslavtsev, STOC 2014). Our result for testing Boolean functions over $[n]^d$ then follows by applying the $d^{5/6}\cdot \text{poly}(1/ε,\log n, \log d)$-query hypergrid tester of Black-Chakrabarty-Seshadhri (SODA 2018). To obtain the result for testing Boolean functions over $\mathbb{R}^d$, we use standard measure theoretic tools to reduce monotonicity testing of a measurable function $f$ to monotonicity testing of a discretized version of $f$ over a hypergrid domain $[N]^d$ for large, but finite, $N$ (that may depend on $f$). The independence of $N$ in the hypergrid tester is crucial to getting the final tester over $\mathbb{R}^d$.

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

↑