Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester
Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester
复制标题
超网格上布尔函数的有向等周定理和 Õ(n√d) 单调性测试器
DOI:
--
复制
发表时间:
2023
期刊:
影响因子:
--
通讯作者:
C. Seshadhri
中科院分区:
文献类型:
--
作者:
Hadley Black;Deeparnab Chakrabarty;C. Seshadhri
The problem of testing monotonicity for Boolean functions on the hypergrid, f:[n]d → {0,1} is a classic topic in property testing. When n=2, the domain is the hypercube. For the hypercube case, a breakthrough result of Khot-Minzer-Safra (FOCS 2015) gave a non-adaptive, one-sided tester making O(ε−2√d) queries. Up to polylog d and ε factors, this bound matches the Ω(√d)-query non-adaptive lower bound (Chen-De-Servedio-Tan (STOC 2015), Chen-Waingarten-Xie (STOC 2017)). For any n > 2, the optimal non-adaptive complexity was unknown. A previous result of the authors achieves a O(d5/6)-query upper bound (SODA 2020), quite far from the √d bound for the hypercube. In this paper, we resolve the non-adaptive complexity of monotonicity testing for all constant n, up to poly(ε−1logd) factors. Specifically, we give a non-adaptive, one-sided monotonicity tester making O(ε−2n√d) queries. From a technical standpoint, we prove new directed isoperimetric theorems over the hypergrid [n]d. These results generalize the celebrated directed Talagrand inequalities that were only known for the hypercube.
DOI:
10.5555/3458064.3458085
发表时间:
2021
期刊:
Proceedings of the 32th Annual ACM-SIAM Symposium on Discrete Algorithms
影响因子:
--
作者:
Canonne, Clement;Chen, Xi;Kamath, Gautam;Levi, Amit;Waingarten, Erik
通讯作者:
Waingarten, Erik
DOI:
--
发表时间:
2019
期刊:
ITCS 2019
影响因子:
--
作者:
Chakrabarty, Deeparnab;Seshadhri, C.
通讯作者:
Seshadhri, C.