research-article

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

Authors:

Deeparnab Chakrabarty,

Madhav Jha, and

C. SeshadhriAuthors Info & Claims

ACM Transactions on Algorithms (TALG), Volume 13, Issue 2

Article No.: 20, Pages 1 - 30

https://doi.org/10.1145/3039241

Published: 10 March 2017 Publication History

Abstract

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.

References

[1]

N. Ailon and B. Chazelle. 2006. Information theory in property testing and monotonicity testing in higher dimension. Information and Computation 204, 11, 1704--1717.

Digital Library

[2]

N. Ailon, B. Chazelle, S. Comandur, and D. Liu. 2007. Estimating the distance to a monotone function. Random Structures and Algorithms 31, 3, 371--383.

Digital Library

[3]

P. Awasthi, M. Jha, M. Molinaro, and S. Raskhodnikova. 2012. Testing Lipschitz functions on hypergrid domains. In Proceedings of the International Workshop on Randomization and Computation (RANDOM’12).

[4]

Maria-Florina Balcan, Eric Blais, Avrim Blum, and Liu Yang. 2012. Active property testing. In Symposium on Foundations of Computer Science (FOCS’12). 21--30.

Digital Library

[5]

T. Batu, R. Rubinfeld, and P. White. 2005. Fast approximate PCPs for Multidimensional Bin-Packing Problems. Information and Computation 196, 1, 42--56.

Digital Library

[6]

P. Berman, S. Raskhodnikova, and G. Yaroslavtsev. 2014. Testing with respect to &ell;<sub>p</sub> distances. In Symposium on Theory of Computing (STOC’14). 164--173.

[7]

A. Bhattacharyya, E. Grigorescu, K. Jung, S. Raskhodnikova, and D. Woodruff. 2009. Transitive-closure spanners. In Proceedings of the 18th Annual Symposium on Discrete Algorithms (SODA’09). 531--540.

Digital Library

[8]

E. Blais, J. Brody, and K. Matulef. 2012. Property testing lower bounds via communication complexity. Computational Complexity 21, 2, 311--358.

Digital Library

[9]

E. Blais, S. Raskhodnikova, and G. Yaroslavtsev. 2013. Lower Bounds for Testing Properties of Functions on Hypergrid Domains. Technical Report TR13-036. Electronic Colloquium on Computational Complexity (ECCC). Weizmann Institute of Science, 234 Herzl Street, Rehovot 7610001 Israel.

Digital Library

[10]

J. Briët, S. Chakraborty, D. García-Soriano, and A. Matsliah. 2012. Monotonicity testing and shortest-path routing on the cube. Combinatorica 32, 1, 35--53.

Digital Library

[11]

D. Chakrabarty and C. Seshadhri. 2013a. Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids. In Proceedings of Symposium on Theory of Computing (STOC’13).

Digital Library

[12]

D. Chakrabarty and C. Seshadhri. 2013b. An optimal lower bound for monotonicity testing over hypergrids. In Proceedings of the International Workshop on Randomization and Computation (RANDOM’13).

[13]

Kashyap Dixit, Madhav Jha, Sofya Raskhodnikova, and Abhradeep Thakurta. 2013. Testing the Lipschitz property over product distributions with applications to data privacy. In Proceedings of the Theory of Cryptography Conference (TCC’13). 418--436.

Digital Library

[14]

Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron, and A. Samorodnitsky. 1999. Improved testing algorithms for monotonicity. Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM’99), 97--108.

Digital Library

[15]

E. Dolev and D. Ron. 2011. Distribution-free testing for monomials with a sublinear number of queries. Theory of Computing 7, 1, 155--176.

[16]

F. Ergun, S. Kannan, R. Kumar, R. Rubinfeld, and M. Viswanathan. 2000. Spot-checkers. Journal of Computer Systems and Sciences (JCSS’00) 60, 3, 717--751.

Digital Library

[17]

E. Fischer. 2004. On the strength of comparisons in property testing. Information and Computation 189, 1, 107--116.

Digital Library

[18]

E. Fischer, E. Lehman, I. Newman, S. Raskhodnikova, R. Rubinfeld, and A. Samorodnitsky. 2002. Monotonicity testing over general poset domains. In Proceedings of the 34th Annual ACM Symposium on the Theory of Computing (STOC’02) 474--483.

Digital Library

[19]

D. Glasner and R. Servedio. 2009. Distribution-free testing lower bound for basic Boolean functions. Theory of Computing 5, 1, 191--216.

[20]

O. Goldreich, S. Goldwasser, E. Lehman, D. Ron, and A. Samorodnitsky. 2000. Testing monotonicity. Combinatorica 20, 301--337.

[21]

O. Goldreich, S. Goldwasser, and D. Ron. 1998. Property testing and its connection to learning and approximation. Journal of the ACM 45, 4, 653--750.

Digital Library

[22]

O. Goldreich and D. Ron. 2013. On Sample-based Testers. Technical Report TR13-109. Electronic Colloquium on Computational Complexity (ECCC). Weizmann Institute of Science, 234 Herzl Street, Rehovot 7610001 Israel.

[23]

S. Halevy. 2006. Topics in Property Testing. Ph.D. Dissertation. Tel Aviv University, Tel Aviv, Israel.

[24]

S. Halevy and E. Kushilevitz. 2005. A lower bound for distribution-free monotonicity testing. In International Workshop on Randomization and Computation (RANDOM’05). 330--341.

Digital Library

[25]

S. Halevy and E. Kushilevitz. 2007. Distribution-free property testing. SIAM Journal of Computing 37, 4, 1107--1138.

Digital Library

[26]

S. Halevy and E. Kushilevitz. 2008a. Distribution-free connectivity testing for sparse graphs. Algorithmica 51, 1, 24--48.

Digital Library

[27]

S. Halevy and E. Kushilevitz. 2008b. Testing monotonicity over graph products. Random Structures and Algorithms 33, 1, 44--67.

Digital Library

[28]

M. Jha and S. Raskhodnikova. 2011. Testing and reconstruction of Lipschitz functions with applications to data privacy. In Proceedings of the 52nd Annual Symposium on Foundations of Computer Science (FOCS’11). 433--442.

Digital Library

[29]

D. E. Knuth. 1973. The Art of Computer Programming Vol III: Sorting and Searching. Addison-Wesley, New York, NY.

[30]

Swastik Kopparty and Shubhangi Saraf. 2009. Tolerant linearity testing and locally testable codes. In International Workshop on Randomization and Computation (RANDOM’09). 601--614.

Digital Library

[31]

E. Lehman and D. Ron. 2001. On disjoint chains of subsets. Journal of Combinatorial Theory, Series A 94, 2, 399--404.

Digital Library

[32]

K. Mehlhorn. 1975. Nearly optimal binary search trees. Acta Informatica 5, 287--295.

Digital Library

[33]

M. Parnas, D. Ron, and R. Rubinfeld. 2006. Tolerant property testing and distance approximation. Journal of Computer and System Sciences 6, 72, 1012--1042.

Digital Library

[34]

F. F. Yao. 1982. Speed-up in dynamic programming. SIAM Journal on Algebraic Discrete Methods 3, 532--540.

Cited By

Black HKalemaj IRaskhodnikova S(2024)Isoperimetric inequalities for real‐valued functions with applications to monotonicity testingRandom Structures & Algorithms10.1002/rsa.2121165:1(191-219)Online publication date: 29-Feb-2024
https://doi.org/10.1002/rsa.21211
Black HChakrabarty DSeshadhri CSaha BServedio R(2023)Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity TesterProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585167(233-241)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585167
Black HChakrabarty DSeshadhri C(2023) A d 1/2+o(1) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids* 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00110(1796-1821)Online publication date: 6-Nov-2023
https://doi.org/10.1109/FOCS57990.2023.00110
Show More Cited By

Index Terms

Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties
1. Theory of computation
  1. Design and analysis of algorithms
    1. Streaming, sublinear and near linear time algorithms

Recommendations

Property testing on product distributions: optimal testers for bounded derivative properties
SODA '15: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms

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 ...
Read More
Every monotone graph property is testable
STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many monotone graph properties are some of the most well-studied properties in ...
Read More
Tolerant property testing and distance approximation

In this paper we study a generalization of standard property testing where the algorithms are required to be more tolerant with respect to objects that do not have, but are close to having, the property. Specifically, a tolerant property testing ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Algorithms

ACM Transactions on Algorithms Volume 13, Issue 2

Special Issue on SODA'15 and Regular Papers

April 2017

316 pages

ISSN:1549-6325

EISSN:1549-6333

DOI:10.1145/3040971

Editor:
Aravind Srinivasan
University of Maryland, USA

Issue’s Table of Contents

Copyright © 2017 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 March 2017

Accepted: 01 December 2016

Revised: 01 December 2016

Received: 01 May 2015

Published in TALG Volume 13, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
181
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Black HKalemaj IRaskhodnikova S(2024)Isoperimetric inequalities for real‐valued functions with applications to monotonicity testingRandom Structures & Algorithms10.1002/rsa.2121165:1(191-219)Online publication date: 29-Feb-2024
https://doi.org/10.1002/rsa.21211
Black HChakrabarty DSeshadhri CSaha BServedio R(2023)Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity TesterProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585167(233-241)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585167
Black HChakrabarty DSeshadhri C(2023) A d 1/2+o(1) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids* 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00110(1796-1821)Online publication date: 6-Nov-2023
https://doi.org/10.1109/FOCS57990.2023.00110
Pallavoor RRaskhodnikova SWaingarten E(2021)Approximating the distance to monotonicity of Boolean functionsRandom Structures & Algorithms10.1002/rsa.2102960:2(233-260)Online publication date: 24-Jun-2021
https://doi.org/10.1002/rsa.21029
Dixit KRaskhodnikova SThakurta AVarma N(2018)Erasure-Resilient Property TestingSIAM Journal on Computing10.1137/16M107566147:2(295-329)Online publication date: Jan-2018
https://doi.org/10.1137/16M1075661
Pallavoor RRaskhodnikova SVarma N(2017)Parameterized Property Testing of FunctionsACM Transactions on Computation Theory10.1145/31552969:4(1-19)Online publication date: 14-Dec-2017
https://dl.acm.org/doi/10.1145/3155296

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents