Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties

被引:11
作者
Chakrabarty, Deeparnab [1 ,6 ]
Dixit, Kashyap [2 ,7 ]
Jha, Madhav [3 ,8 ]
Seshadhri, C. [4 ,5 ]
机构
[1] Microsoft Res, Redmond, WA 98052 USA
[2] Penn State Univ, University Pk, PA 16802 USA
[3] Zenefits Inc, San Francisco, CA USA
[4] Univ Calif Santa Cruz, Baskin Sch Engn, 1156 High St, Santa Cruz, CA 95064 USA
[5] Sandia Natl Labs, Livermore, CA USA
[6] Dartmouth Coll, Dept Comp Sci, 6211 Sudikoff Lab, Hanover, NH 03755 USA
[7] Jet Com Inc, 221 River St,800, Hoboken, NJ 07030 USA
[8] Amazon AWS, 350 W Broadway, New York, NY 10013 USA
基金
美国国家科学基金会;
关键词
Property testing; monotonicity; Lipschitz continuity; MONOTONICITY; APPROXIMATION; DISTANCE;
D O I
10.1145/3039241
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The primary problem in property testing is to decide whether a given function satisfies a certain property or is far from any function satisfying it. This crucially requires a notion of distance between functions. The most prevalent notion is the Hamming distance over the uniform distribution on the domain. This restriction to uniformity is rather limiting, and it is important to investigate distances induced by more general distributions. In this article, we provide simple and optimal testers for bounded derivative properties over arbitrary product distributions. Bounded derivative properties include fundamental properties, such as monotonicity and Lipschitz continuity. Our results subsume almost all known results (upper and lower bounds) on monotonicity and Lipschitz testing over arbitrary ranges. We prove an intimate connection between bounded derivative property testing and binary search trees (BSTs). We exhibit a tester whose query complexity is the sum of expected depths of optimal BSTs for each marginal. Furthermore, we show that this sum-of-depths is also a lower bound. A technical contribution of our work is an optimal dimension reduction theorem for all bounded derivative properties that relates the distance of a function from the property to the distance of restrictions of the function to random lines. Such a theorem has been elusive even for monotonicity, and our theorem is an exponential improvement to the previous best-known result.
引用
收藏
页数:30
相关论文
共 34 条
  • [1] Estimating the distance to a monotone function
    Ailon, Nir
    Chazelle, Bernard
    Comandur, Seshadhri
    Liu, Ding
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2007, 31 (03) : 371 - 383
  • [2] Information theory in property testing and monotonicity testing in higher dimension
    Ailon, Nir
    Chazelle, Bernard
    [J]. INFORMATION AND COMPUTATION, 2006, 204 (11) : 1704 - 1717
  • [3] Awasthi P., 2012, P INT WORKSH RAND CO
  • [4] Active Property Testing
    Balcan, Maria-Florina
    Blais, Eric
    Blum, Avrim
    Yang, Liu
    [J]. 2012 IEEE 53RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2012, : 21 - 30
  • [5] Fast approximate PCPs for multidimensional bin-packing problems
    Batu, T
    Rubinfeld, R
    White, P
    [J]. INFORMATION AND COMPUTATION, 2005, 196 (01) : 42 - 56
  • [6] BERMAN P, 2014, STOC, P164, DOI DOI 10.1145/2591796.2591887
  • [7] Bhattacharyya A., 2009, P 18 ANN S DISCR ALG, P531
  • [8] Blais E., 2013, EL C COMP COMPL ECCC
  • [9] PROPERTY TESTING LOWER BOUNDS VIA COMMUNICATION COMPLEXITY
    Blais, Eric
    Brody, Joshua
    Matulef, Kevin
    [J]. COMPUTATIONAL COMPLEXITY, 2012, 21 (02) : 311 - 358
  • [10] Monotonicity testing and shortest-path routing on the cube
    Briet, Jop
    Chakraborty, Sourav
    Garcia-Soriano, David
    Matsliah, Arie
    [J]. COMBINATORICA, 2012, 32 (01) : 35 - 53