skip to main content
research-article
Public Access

Parameterized Property Testing of Functions

Published:14 December 2017Publication History
Skip Abstract Section

Abstract

We investigate the parameters in terms of which the complexity of sublinear-time algorithms should be expressed. Our goal is to find input parameters that are tailored to the combinatorics of the specific problem being studied and design algorithms that run faster when these parameters are small. This direction enables us to surpass the (worst-case) lower bounds, expressed in terms of the input size, for several problems. Our aim is to develop a similar level of understanding of the complexity of sublinear-time algorithms to the one that was enabled by research in parameterized complexity for classical algorithms.

Specifically, we focus on testing properties of functions. By parameterizing the query complexity in terms of the size r of the image of the input function, we obtain testers for monotonicity and convexity of functions of the form f:[n]→ R with query complexity O (log r), with no dependence on n. The result for monotonicity circumvents the Ω (log n) lower bound by Fischer (Inf. Comput. 2004) for this problem. We present several other parameterized testers, providing compelling evidence that expressing the query complexity of property testers in terms of the input size is not always the best choice.

References

  1. Nir Ailon and Bernard Chazelle. 2006. Information theory in property testing and monotonicity testing in higher dimension. Inf. Comput. 204, 11 (2006), 1704--171. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, and C. Seshadhri. 2017. Optimal unateness testers for real-valued functions: Adaptivity helps. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP’17). 5:1--5:14.Google ScholarGoogle Scholar
  3. Tugkan Batu, Ronitt Rubinfeld, and Patrick White. 2005. Fast approximate PCPs for multidimensional bin-packing problems. Inf. Comput. 196, 1 (2005), 42--56. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Mihir Bellare and Phillip Rogaway. 2005. Lecture Notes on Modern Cryptography. (2005). https://cseweb.ucsd.edu/mihir/cse207/w-birthday.pdf.Google ScholarGoogle Scholar
  5. Aleksandrs Belovs and Eric Blais. 2015. Quantum algorithm for monotonicity testing on the hypercube. Theory of Computing 11 (2015), 403--412.Google ScholarGoogle ScholarCross RefCross Ref
  6. Aleksandrs Belovs and Eric Blais. 2016. A polynomial lower bound for testing monotonicity. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (STOC’16). 1021--1032. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Sagi Ben-Moshe, Yaron Kanza, Eldar Fischer, Arie Matsliah, Mani Fischer, and Carl Staelin. 2011. Detecting and exploiting near-sortedness for efficient relational query evaluation. In Proceedings of the 14th International Conference on Database Theory (ICDT’11), Uppsala, Sweden, March 21-24, 2011. 256--267. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Piotr Berman, Meiram Murzabulatov, and Sofya Raskhodnikova. 2016. The power and limitations of uniform samples in testing properties of figures. In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India. 45:1--45:14.Google ScholarGoogle Scholar
  9. Piotr Berman, Meiram Murzabulatov, and Sofya Raskhodnikova. 2016. Testing convexity of figures under the uniform distribution. In Proceedings of the 32nd International Symposium on Computational Geometry (SoCG’16). 17:1--17:15.Google ScholarGoogle Scholar
  10. Piotr Berman, Sofya Raskhodnikova, and Grigory Yaroslavtsev. 2014. -testing. In Proceedings of the Symposium on Theory of Computing (STOC’14). 164--173. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, and David P. Woodruff. 2012. Transitive-closure spanners. SIAM J. Comput. 41, 6 (2012), 1380--1425.Google ScholarGoogle ScholarCross RefCross Ref
  12. Eric Blais, Joshua Brody, and Kevin Matulef. 2012. Property testing lower bounds via communication complexity. Computational Complexity 21, 2 (2012), 311--358. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Eric Blais, Sofya Raskhodnikova, and Grigory Yaroslavtsev. 2014. Lower bounds for testing properties of functions over hypergrid domains. In Proceedings of the IEEE 29th Conference on Computational Complexity (CCC’14). 309--320. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Jop Briët, Sourav Chakraborty, David García-Soriano, and Arie Matsliah. 2012. Monotonicity testing and shortest-path routing on the cube. Combinatorica 32, 1 (2012), 35--53. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Deeparnab Chakrabarty. 2016. Monotonicity testing. In Encyclopedia of Algorithms. Springer, 1352--1356.Google ScholarGoogle Scholar
  16. Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, and C. Seshadhri. 2017. Property testing on product distributions: Optimal testers for bounded derivative properties. ACM Trans. Algorithms 13, 2 (2017), 20:1--20:30. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Deeparnab Chakrabarty and C. Seshadhri. 2013. Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids. In Proceedings of the Symposium on Theory of Computing Conference (STOC’13). 419--428. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Deeparnab Chakrabarty and C. Seshadhri. 2014. An optimal lower bound for monotonicity testing over hypergrids. Theory of Computing 10 (2014), 453--464.Google ScholarGoogle ScholarCross RefCross Ref
  19. Deeparnab Chakrabarty and C. Seshadhri. 2016. An monotonicity tester for Boolean functions over the hypercube. SIAM J. Comput. 45, 2 (2016), 461--472.Google ScholarGoogle ScholarCross RefCross Ref
  20. Xi Chen, Anindya De, Rocco A. Servedio, and Li-Yang Tan. 2015. Boolean function monotonicity testing requires (almost) non-adaptive queries. In Proceedings of the 47th Annual ACM on Symposium on Theory of Computing (STOC’15). 519--528. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Xi Chen, Rocco A. Servedio, and Li-Yang Tan. 2014. New algorithms and lower bounds for monotonicity testing. In Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science (FOCS’14). 286--295. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Xi Chen, Erik Waingarten, and Jinyu Xie. Boolean unateness testing with adaptive queries. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS’17). To appear. https://arxiv.org/abs/1708.05786.Google ScholarGoogle Scholar
  23. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2001. Introduction to Algorithms, 2nd ed. MIT Press and McGraw-Hill Book Company. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Kashyap Dixit, Sofya Raskhodnikova, Abhradeep Thakurta, and Nithin M. Varma. 2016. Erasure-resilient property testing. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy. 91:1--91:15.Google ScholarGoogle Scholar
  25. Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, and Alex Samorodnitsky. 1999. Improved testing algorithms for monotonicity. In Proceedings of RANDOM-APPROX’99. 97--108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, and Mahesh Viswanathan. 2000. Spot-checkers. J. Comput. Syst. Sci. 60, 3 (2000), 717--751. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Eldar Fischer. 2004. On the strength of comparisons in property testing. Inf. Comput. 189, 1 (2004), 107--116. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Eldar Fischer, Oded Lachish, and Yadu Vasudev. 2015. Trading query complexity for sample-based testing and multi-testing scalability. In Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS’15). 1163--1182. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, and Alex Samorodnitsky. 2002. Monotonicity testing over general poset domains. In Proceedings on 34th Annual ACM Symposium on Theory of Computing. 474--483. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, and Alex Samorodnitsky. 2000. Testing monotonicity. Combinatorica 20, 3 (2000), 301--337.Google ScholarGoogle ScholarCross RefCross Ref
  31. Oded Goldreich, Shafi Goldwasser, and Dana Ron. 1998. Property testing and its connection to learning and approximation. J. ACM 45, 4 (1998), 653--750. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Oded Goldreich and Dana Ron. 2011. On proximity-oblivious testing. SIAM J. Comput. 40, 2 (2011), 534--566. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Oded Goldreich and Dana Ron. 2016. On sample-based testers. TOCT 8, 2 (2016), 7. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Shirley Halevy and Eyal Kushilevitz. 2007. Distribution-free property-testing. SIAM J. Comput. 37, 4 (2007), 1107--1138. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Shirley Halevy and Eyal Kushilevitz. 2008. Testing monotonicity over graph products. Random Struct. Algorithms 33, 1 (2008), 44--67. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Kazuo Iwama and Yuichi Yoshida. 2014. Parameterized testability. In Proceedings of the Innovations in Theoretical Computer Science Conference (ITCS’14). 507--516. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Madhav Jha and Sofya Raskhodnikova. 2013. Testing and reconstruction of Lipschitz functions with applications to data privacy. SIAM J. Comput. 42, 2 (2013), 700--731.Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Subhash Khot, Dor Minzer, and Muli Safra. 2015. On monotonicity testing and Boolean isoperimetric type theorems. In Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS’15). 52--58. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Eric Lehman and Dana Ron. 2001. On disjoint chains of subsets. J. Comb. Theory, Ser. A 94, 2 (2001), 399--404. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. Ilan Newman. 2010. Property testing of massively parametrized problems - A survey. In Property Testing - Current Research and Surveys {outgrow of a workshop at the Institute for Computer Science (ITCS) at Tsinghua University, January 2010} (Lecture Notes in Computer Science), Oded Goldreich (Ed.), Vol. 6390. Springer, 142--157. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, and Nithin Varma. 2017. Parameterized property testing of functions. In Proceedings of the 8th Innovations in Theoretical Computer Science Conference (ITCS’17).Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. Michal Parnas, Dana Ron, and Ronitt Rubinfeld. 2003. On testing convexity and submodularity. SIAM J. Comput. 32, 5 (2003), 1158--1184. Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. Sofya Raskhodnikova. 2016. Testing if an array is sorted. In Encyclopedia of Algorithms. Springer, 2219--2222.Google ScholarGoogle Scholar
  44. Sofya Raskhodnikova and Adam D. Smith. 2006. A note on adaptivity in testing properties of bounded degree graphs. Electronic Colloquium on Computational Complexity (ECCC) 13, 089 (2006), 1–6.Google ScholarGoogle Scholar
  45. Ronitt Rubinfeld and Madhu Sudan. 1996. Robust characterizations of polynomials with applications to program testing. SIAM J. Comput. 25, 2 (1996), 252--271. Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. Gregory Valiant and Paul Valiant. 2016. Instance optimal learning of discrete distributions. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (STOC’16). 142--155. Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. Gregory Valiant and Paul Valiant. 2017. An automatic inequality prover and instance optimal identity testing. SIAM J. Comput. 46, 1 (2017), 429--455.Google ScholarGoogle ScholarCross RefCross Ref
  48. Andrew Chi-Chih Yao. 1977. Probabilistic computations: Toward a unified measure of complexity (extended abstract). In Proceedings of the 18th Annual Symposium on Foundations of Computer Science. 222--227. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Parameterized Property Testing of Functions

        Recommendations

        Comments

        Login options

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

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!