Document Open Access Logo

Testing k-Monotonicity

Authors Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer



PDF
Thumbnail PDF

File

LIPIcs.ITCS.2017.29.pdf
  • Filesize: 0.64 MB
  • 21 pages

Document Identifiers

Author Details

Clément L. Canonne
Elena Grigorescu
Siyao Guo
Akash Kumar
Karl Wimmer

Cite AsGet BibTex

Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, and Karl Wimmer. Testing k-Monotonicity. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 67, pp. 29:1-29:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/LIPIcs.ITCS.2017.29

Abstract

A Boolean k-monotone function defined over a finite poset domain D alternates between the values 0 and 1 at most k times on any ascending chain in D. Therefore, k-monotone functions are natural generalizations of the classical monotone functions, which are the 1-monotone functions. Motivated by the recent interest in k-monotone functions in the context of circuit complexity and learning theory, and by the central role that monotonicity testing plays in the context of property testing, we initiate a systematic study of k-monotone functions, in the property testing model. In this model, the goal is to distinguish functions that are k-monotone (or are close to being k-monotone) from functions that are far from being k-monotone. Our results include the following: 1. We demonstrate a separation between testing k-monotonicity and testing monotonicity, on the hypercube domain {0,1}^d, for k >= 3; 2. We demonstrate a separation between testing and learning on {0,1}^d, for k=\omega(\log d): testing k-monotonicity can be performed with 2^{O(\sqrt d . \log d . \log{1/\eps})} queries, while learning k-monotone functions requires 2^{\Omega(k . \sqrt d .{1/\eps})} queries (Blais et al. (RANDOM 2015)). 3. We present a tolerant test for functions f\colon[n]^d\to \{0,1\}$with complexity independent of n, which makes progress on a problem left open by Berman et al. (STOC 2014). Our techniques exploit the testing-by-learning paradigm, use novel applications of Fourier analysis on the grid [n]^d, and draw connections to distribution testing techniques. Our techniques exploit the testing-by-learning paradigm, use novel applications of Fourier analysis on the grid [n]^d, and draw connections to distribution testing techniques.
Keywords
  • Boolean Functions
  • Learning
  • Monotonicity
  • Property Testing

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Nir Ailon and Bernard Chazelle. Information theory in property testing and monotonicity testing in higher dimension. Inf. Comput., 204(11):1704-1717, 2006. Google Scholar
  2. Kazuyuki Amano and Akira Maruoka. A superpolynomial lower bound for a circuit computing the Clique function with at most (1/6) log log n negation gates. SIAM Journal on Computing, 35(1):201-216, 2005. Google Scholar
  3. Dana Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, 1987. Google Scholar
  4. Maria-Florina Balcan, Eric Blais, Avrim Blum, and Liu Yang. Active property testing. In FOCS, pages 21-30. IEEE Computer Society, 2012. Google Scholar
  5. Tŭgkan Batu, Ronitt Rubinfeld, and Patrick White. Fast approximate PCPs for multidimensional bin-packing problems. Inf. Comput., 196(1):42-56, 2005. Google Scholar
  6. Aleksandrs Belovs and Eric Blais. A polynomial lower bound for testing monotonicity. In STOC, pages 1021-1032. ACM, 2016. Google Scholar
  7. Piotr Berman, Sofya Raskhodnikova, and Grigory Yaroslavtsev. L_p-testing. In STOC, pages 164-173. ACM, 2014. Google Scholar
  8. Eric Blais, Joshua Brody, and Kevin Matulef. Property testing lower bounds via communication complexity. Computational Complexity, 21(2):311-358, 2012. Google Scholar
  9. Eric Blais, Clément L. Canonne, Igor Carboni Oliveira, Rocco A. Servedio, and Li-Yang Tan. Learning circuits with few negations. In APPROX-RANDOM, volume 40 of LIPIcs, pages 512-527. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. Google Scholar
  10. Jop Briët, Sourav Chakraborty, David García-Soriano, and Arie Matsliah. Monotonicity testing and shortest-path routing on the cube. Combinatorica, 32(1):35-53, 2012. Google Scholar
  11. Nader H. Bshouty and Christino Tamon. On the Fourier spectrum of monotone functions. J. ACM, 43(4):747-770, 1996. Google Scholar
  12. Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, and Karl Wimmer. Testing k-monotonicity. Electronic Colloquium on Computational Complexity (ECCC), 23:136, 2016. Google Scholar
  13. Clément L. Canonne and Ronitt Rubinfeld. Testing probability distributions underlying aggregated data. In ICALP (1), volume 8572 of Lecture Notes in Computer Science, pages 283-295. Springer, 2014. Google Scholar
  14. Deeparnab Chakrabarty and C. Seshadhri. An o(n) monotonicity tester for boolean functions over the hypercube. In STOC, pages 411-418. ACM, 2013. Journal version as [17]. Google Scholar
  15. Deeparnab Chakrabarty and C. Seshadhri. Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids. In STOC, pages 419-428, 2013. Google Scholar
  16. Deeparnab Chakrabarty and C. Seshadhri. An optimal lower bound for monotonicity testing over hypergrids. Theory of Computing, 10:453-464, 2014. Google Scholar
  17. Deeparnab Chakrabarty and C. Seshadhri. An o(n) Monotonicity Tester for Boolean Functions over the Hypercube. SIAM J. Comput., 45(2):461-472, 2016. Google Scholar
  18. Xi Chen, Anindya De, Rocco A. Servedio, and Li-Yang Tan. Boolean function monotonicity testing requires (almost) n^1/2 non-adaptive queries. In STOC, pages 519-528. ACM, 2015. Google Scholar
  19. Xi Chen, Rocco A. Servedio, and Li-Yang Tan. New algorithms and lower bounds for monotonicity testing. In FOCS, pages 286-295. IEEE Computer Society, 2014. Google Scholar
  20. Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, and Alex Samorodnitsky. Improved testing algorithms for monotonicity. In RANDOM-APPROX, volume 1671 of Lecture Notes in Computer Science, pages 97-108. Springer, 1999. Google Scholar
  21. Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, and Mahesh Viswanathan. Spot-checkers. J. Comput. Syst. Sci., 60(3):717-751, 2000. Google Scholar
  22. Shahar Fattal and Dana Ron. Approximating the distance to monotonicity in high dimensions. ACM Trans. Algorithms, 6(3), 2010. Google Scholar
  23. Eldar Fischer. On the strength of comparisons in property testing. Inf. Comput., 189(1):107-116, 2004. Google Scholar
  24. Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, and Alex Samorodnitsky. Monotonicity testing over general poset domains. In Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pages 474-483, 2002. Google Scholar
  25. Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, and Alex Samorodnitsky. Testing monotonicity. Combinatorica, 20(3):301-337, 2000. Google Scholar
  26. Siyao Guo and Ilan Komargodski. Negation-limited formulas. In APPROX-RANDOM, volume 40 of LIPIcs, pages 850-866. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. Google Scholar
  27. Siyao Guo, Tal Malkin, Igor Carboni Oliveira, and Alon Rosen. The power of negations in cryptography. In TCC (1), volume 9014 of Lecture Notes in Computer Science, pages 36-65. Springer, 2015. Google Scholar
  28. Shirley Halevy and Eyal Kushilevitz. Testing monotonicity over graph products. Random Struct. Algorithms, 33(1):44-67, 2008. Google Scholar
  29. Stasys Jukna. Boolean Function Complexity. Springer, 2012. Google Scholar
  30. Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, and Rocco A. Servedio. Agnostically learning halfspaces. SIAM J. Comput., 37(6):1777-1805, 2008. Google Scholar
  31. Michael J. Kearns and Dana Ron. Testing problems with sublearning sample complexity. J. Comput. Syst. Sci., 61(3):428-456, 2000. Google Scholar
  32. Michael J. Kearns and Leslie G. Valiant. Cryptographic limitations on learning Boolean formulae and finite automata. J. ACM, 41(1):67-95, 1994. Google Scholar
  33. Subhash Khot, Dor Minzer, and Muli Safra. On monotonicity testing and Boolean isoperimetric type theorems. In FOCS, pages 52-58. IEEE Computer Society, 2015. Google Scholar
  34. Pravesh Kothari, Amir Nayyeri, Ryan O'Donnell, and Chenggang Wu. Testing surface area. In SODA, pages 1204-1214. SIAM, 2014. Google Scholar
  35. Chengyu Lin and Shengyu Zhang. Sensitivity conjecture and log-rank conjecture for functions with small alternating numbers. CoRR, abs/1602.06627, 2016. Google Scholar
  36. A. A. Markov. On the inversion complexity of systems of functions. Doklady Akademii Nauk SSSR, 116:917-919, 1957. English translation in [37]. Google Scholar
  37. A. A. Markov. On the inversion complexity of a system of functions. Journal of the ACM, 5(4):331-334, October 1958. Google Scholar
  38. Joe Neeman. Testing surface area with arbitrary accuracy. In STOC, pages 393-397. ACM, 2014. Google Scholar
  39. Ryan O'Donnell. Analysis of Boolean Functions. Cambridge University Press, 2014. Google Scholar
  40. Ryan O'Donnell and Rocco A. Servedio. Learning monotone decision trees in polynomial time. SIAM J. Comput., 37(3):827-844, 2007. Google Scholar
  41. Ryan O'Donnell and Karl Wimmer. KKL, Kruskal-Katona, and monotone nets. In FOCS, pages 725-734. IEEE Computer Society, 2009. Google Scholar
  42. Michal Parnas, Dana Ron, and Ronitt Rubinfeld. Tolerant property testing and distance approximation. Journal of Computer and System Sciences, 72(6):1012-1042, 2006. Google Scholar
  43. Ran Raz and Avi Wigderson. Monotone circuits for matching require linear depth. J. ACM, 39(3):736-744, 1992. Google Scholar
  44. Alexander A Razborov. Lower bounds on the monotone complexity of some Boolean functions. Doklady Akademii Nauk SSSR, 281(4):798-801, 1985. Google Scholar
  45. Benjamin Rossman. Correlation bounds against monotone NC¹. In Conference on Computational Complexity (CCC), 2015. Google Scholar
  46. Rocco A. Servedio. On learning monotone DNF under product distributions. Inf. Comput., 193(1):57-74, 2004. Google Scholar
  47. List of open problems in sublinear algorithms: Problem 70, 2016. Originally posed in [7]. URL: http://sublinear.info/70.
  48. Leslie G. Valiant. A theory of the learnable. Commun. ACM, 27(11):1134-1142, 1984. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail