arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1204.0849cs.DMcs.CCcs.DS
收藏

超立方体和超网格上单调性和Lipschitz检验的最优界

Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids

Deeparnab Chakrabarty, C. Seshadhri

摘要:

超网格及其特殊情况超立方体上的单调性测试问题是性质测试中一个经典的、研究得很好但尚未解决的问题。我们被赋予对$f:[k]^n \mapsto \R$的查询访问权(对于某个有序范围$\R$)。超网格/立方体具有由坐标排序给出的自然偏序,由$\prec$表示。如果对于所有对$x \prec y$、$f(x) \leq f(y)$,则函数是\emph{monotone}。到单调性的距离$\eps_f$是需要改变以使$f$单调的$f$值的最小分数。对于$k=2$(布尔超立方体),通常的测试器是\emph{edge tester},它检查相邻域点对的单调性。已知使用$O(\eps^{-1}n\log|\R|)$样本的边缘测试器可以区分单调函数和其中$\eps_f > \eps$的函数。另一方面,超立方体上单调性测试的最佳下界是$\min(|\R|^2,n)$。这在我们的知识中留下了二次缺口,因为$|\R|$可以是$2^n$。我们解决了这个长期存在的开放问题,并证明$O(n/\eps)$样本足够的边缘测试。对于超网格,已知的测试器需要$O(\eps^{-1}n\log k\log |\R|)$样本,而最著名的(非自适应)下限是$Ω(\eps^{-1} n\log k)$。我们给出了一个运行在$O(\eps^{-1} n\log k)$时间的超网格的(非自适应)单调性测试器。我们的技术导致最佳的属性测试(具有相同的运行时间)的自然\emph{Lipschitz property}超立方体和超网格。($c$ -Lipschitz函数是其中$|f(x) - f(y)| \leq c\|x-y\|_1$。)事实上,我们给出了一个一般的统一证明$O(\eps^{-1}n\log k)$查询测试的一类“有界衍生物”的属性,一类包含单调性和Lipschitz。

英文摘要:

The problem of monotonicity testing over the hypergrid and its special case, the hypercube, is a classic, well-studied, yet unsolved question in property testing. We are given query access to $f:[k]^n \mapsto \R$ (for some ordered range $\R$). The hypergrid/cube has a natural partial order given by coordinate-wise ordering, denoted by $\prec$. A function is \emph{monotone} if for all pairs $x \prec y$, $f(x) \leq f(y)$. The distance to monotonicity, $\eps_f$, is the minimum fraction of values of $f$ that need to be changed to make $f$ monotone. For $k=2$ (the boolean hypercube), the usual tester is the \emph{edge tester}, which checks monotonicity on adjacent pairs of domain points. It is known that the edge tester using $O(\eps^{-1}n\log|\R|)$ samples can distinguish a monotone function from one where $\eps_f > \eps$. On the other hand, the best lower bound for monotonicity testing over the hypercube is $\min(|\R|^2,n)$. This leaves a quadratic gap in our knowledge, since $|\R|$ can be $2^n$. We resolve this long standing open problem and prove that $O(n/\eps)$ samples suffice for the edge tester. For hypergrids, known testers require $O(\eps^{-1}n\log k\log |\R|)$ samples, while the best known (non-adaptive) lower bound is $Ω(\eps^{-1} n\log k)$. We give a (non-adaptive) monotonicity tester for hypergrids running in $O(\eps^{-1} n\log k)$ time. Our techniques lead to optimal property testers (with the same running time) for the natural \emph{Lipschitz property} on hypercubes and hypergrids. (A $c$-Lipschitz function is one where $|f(x) - f(y)| \leq c\|x-y\|_1$.) In fact, we give a general unified proof for $O(\eps^{-1}n\log k)$-query testers for a class of "bounded-derivative" properties, a class containing both monotonicity and Lipschitz.

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

↑