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

超网格上单调性检验的一个最优下界

An optimal lower bound for monotonicity testing over hypergrids

Deeparnab Chakrabarty, C. Seshadhri

摘要:

对于正整数$n, d$,考虑超网格$[n]^d$,其坐标乘积偏序记为$\prec$。函数$f: [n]^d \mapsto \mathbb{N}$是单调的,如果$\forall x \prec y$,$f(x) \leq f(y)$。一个函数$f$是$\eps$ -远离单调,如果至少一个$\eps$ -分数的值必须改变,使$f$单调。给定参数$\eps$,\emph{monotonicity tester}必须以高概率区分单调函数与$\eps$ -远的函数。我们证明,任何(自适应,双边)单调测试功能$f:[n]^d \mapsto \mathbb{N}$必须进行$Ω(\eps^{-1}d\log n - \eps^{-1}\log \eps^{-1})$查询。最近的上限表明超网格的$O(\eps^{-1}d \log n)$查询单调性测试器的存在。这关闭了在任意范围内的超网格的单调性测试的问题。以前的最佳下界一般超网格是一个非自适应界的$Ω(d \log n)$。

英文摘要:

For positive integers $n, d$, consider the hypergrid $[n]^d$ with the coordinate-wise product partial ordering denoted by $\prec$. A function $f: [n]^d \mapsto \mathbb{N}$ is monotone if $\forall x \prec y$, $f(x) \leq f(y)$. A function $f$ is $\eps$-far from monotone if at least an $\eps$-fraction of values must be changed to make $f$ monotone. Given a parameter $\eps$, a \emph{monotonicity tester} must distinguish with high probability a monotone function from one that is $\eps$-far. We prove that any (adaptive, two-sided) monotonicity tester for functions $f:[n]^d \mapsto \mathbb{N}$ must make $Ω(\eps^{-1}d\log n - \eps^{-1}\log \eps^{-1})$ queries. Recent upper bounds show the existence of $O(\eps^{-1}d \log n)$ query monotonicity testers for hypergrids. This closes the question of monotonicity testing for hypergrids over arbitrary ranges. The previous best lower bound for general hypergrids was a non-adaptive bound of $Ω(d \log n)$.

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

↑