Document Open Access Logo

Relative-Error Testing of Conjunctions and Decision Lists

Authors Xi Chen , William Pires , Toniann Pitassi , Rocco A. Servedio

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.ICALP.2025.52.pdf
  • Filesize: 0.86 MB
  • 18 pages
HTML5 Logo HTML (experimental)
LIPIcs.ICALP.2025.52.html

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Streaming, sublinear and near linear time algorithms
Keywords
  • Property Testing
  • Relative Error

Metrics

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

Abstract

We study the relative-error property testing model for Boolean functions that was recently introduced in the work of [X. Chen et al., 2025]. In relative-error testing, the testing algorithm gets uniform random satisfying assignments as well as black-box queries to f, and it must accept f with high probability whenever f has the property that is being tested and reject any f that is relative-error far from having the property. Here the relative-error distance from f to a function g is measured with respect to |f^{-1}(1)| rather than with respect to the entire domain size 2ⁿ as in the Hamming distance measure that is used in the standard model; thus, unlike the standard model, relative-error testing allows us to study the testability of sparse Boolean functions that have few satisfying assignments. It was shown in [X. Chen et al., 2025] that relative-error testing is at least as difficult as standard-model property testing, but for many natural and important Boolean function classes the precise relationship between the two notions is unknown.
In this paper we consider the well-studied and fundamental properties of being a conjunction and being a decision list. In the relative-error setting, we give an efficient one-sided error tester for conjunctions with running time and query complexity O(1/ε). 
Secondly, we give a two-sided relative-error Õ(1/ε) tester for decision lists, matching the query complexity of the state-of-the-art algorithm in the standard model [Nader H. Bshouty, 2020; I. Diakonikolas et al., 2007].

Cite As Get BibTex

Xi Chen, William Pires, Toniann Pitassi, and Rocco A. Servedio. Relative-Error Testing of Conjunctions and Decision Lists. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 52:1-52:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICALP.2025.52

Author Details

Xi Chen
  • Columbia University, New York, NY, USA
William Pires
  • Columbia University, New York, NY, USA
Toniann Pitassi
  • Columbia University, New York, NY, USA
Rocco A. Servedio
  • Columbia University, New York, NY, USA

Funding

  • Chen, Xi: Supported by NSF awards CCF-2106429 and CCF-2107187.
  • Pitassi, Toniann: Supported by NSF award CCF-2212136.
  • Servedio, Rocco A.: Supported by NSF awards CCF-2106429 and CCF-2211238.

References

  1. A. Belovs and E. Blais. A polynomial lower bound for testing monotonicity. In Proceedings of the 48th ACM Symposium on Theory of Computing, pages 1021-1032, 2016. Google Scholar
  2. Arnab Bhattacharyya and Yuichi Yoshida. Property Testing - Problems and Techniques. Springer, 2022. URL: https://doi.org/10.1007/978-981-16-8622-1.
  3. Manuel Blum, Michael Luby, and Ronitt Rubinfeld. Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences, 47:549-595, 1993. Earlier version in STOC'90. URL: https://doi.org/10.1016/0022-0000(93)90044-W.
  4. Nader H. Bshouty. Almost optimal testers for concise representations. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM, pages 5:1-5:20, 2020. URL: https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2020.5.
  5. Nader H. Bshouty and Oded Goldreich. On properties that are non-trivial to test. Electron. Colloquium Comput. Complex., TR22-013, 2022. URL: https://eccc.weizmann.ac.il/report/2022/013.
  6. Deeparnab Chakrabarty and C. Seshadhri. A o(n) monotonicity tester for boolean functions over the hypercube. In Proceedings of the 45th ACM Symposium on Theory of Computing, pages 411-418, 2013. URL: https://doi.org/10.1145/2488608.2488660.
  7. Deeparnab Chakrabarty and C. Seshadhri. Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids. In Symposium on Theory of Computing Conference, STOC, pages 419-428, 2013. URL: https://doi.org/10.1145/2488608.2488661.
  8. Deeparnab Chakrabarty and C. Seshadhri. A Õ(n) non-adaptive tester for unateness. CoRR, abs/1608.06980, 2016. URL: https://arxiv.org/abs/1608.06980.
  9. Sourav Chakraborty, David García-Soriano, and Arie Matsliah. Efficient sample extractors for juntas with applications. In Automata, Languages and Programming - 38th International Colloquium, ICALP, pages 545-556, 2011. URL: https://doi.org/10.1007/978-3-642-22006-7_46.
  10. X. Chen, A. De, Y. Huang, S. Nadimpalli, R. Servedio, and T. Yang. Relative error monotonicity testing. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025. Google Scholar
  11. Xi Chen, Anindya De, Rocco A. Servedio, and Li-Yang Tan. Boolean Function Monotonicity Testing Requires (Almost) n^1/2 Non-adaptive Queries. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, pages 519-528, 2015. URL: https://doi.org/10.1145/2746539.2746570.
  12. Xi Chen, Yumou Fei, and Shyamal Patel. Distribution-free testing of decision lists with a sublinear number of queries. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC), pages 1051-1062, 2024. URL: https://doi.org/10.1145/3618260.3649717.
  13. Xi Chen and Shyamal Patel. Distribution-free testing for halfspaces (almost) requires PAC learning. In Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1715-1743, 2022. URL: https://doi.org/10.1137/1.9781611977073.70.
  14. Xi Chen, Rocco A. Servedio, and Li-Yang Tan. New algorithms and lower bounds for testing monotonicity. In Proceedings of the 55th IEEE Symposium on Foundations of Computer Science, pages 286-295, 2014. Google Scholar
  15. Xi Chen and Erik Waingarten. Testing unateness nearly optimally. In Proceedings of the 51th ACM Symposium on Theory of Computing, 2019. Google Scholar
  16. Xi Chen, Erik Waingarten, and Jinyu Xie. Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 523-536, 2017. URL: https://doi.org/10.1145/3055399.3055461.
  17. Xi Chen, Erik Waingarten, and Jinyu Xie. Boolean unateness testing with Õ(n^3/4) adaptive queries. In Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 868-879, 2017. URL: https://doi.org/10.1109/FOCS.2017.85.
  18. Xi Chen and Jinyu Xie. Tight bounds for the distribution-free testing of monotone conjunctions. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 54-71, 2016. URL: https://doi.org/10.1137/1.9781611974331.CH5.
  19. I. Diakonikolas, H. Lee, K. Matulef, K. Onak, R. Rubinfeld, R. Servedio, and A. Wan. Testing for concise representations. In Proc. 48th Ann. Symposium on Computer Science (FOCS), pages 549-558, 2007. Google Scholar
  20. E. Fischer, E. Lehman, I. Newman, S. Raskhodnikova, R. Rubinfeld, and A. Samorodnitsky. Monotonicity testing over general poset domains. In Proc. 34th Annual ACM Symposium on the Theory of Computing, pages 474-483, 2002. Google Scholar
  21. Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan, and Avi Wigderson. Self-testing/correcting for polynomials and for approximate functions. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC), pages 32-42. ACM, 1991. URL: https://doi.org/10.1145/103418.103429.
  22. Dana Glasner and Rocco A. Servedio. Distribution-free testing lower bound for basic boolean functions. Theory of Computing, 5(1):191-216, 2009. URL: https://doi.org/10.4086/toc.2009.v005a010.
  23. O. Goldreich. Introduction to Property Testing. Cambridge University Press, 2017. Google Scholar
  24. Oded Goldreich, editor. Computational Complexity and Property Testing - On the Interplay Between Randomness and Computation, volume 12050 of Lecture Notes in Computer Science. Springer, 2020. URL: https://doi.org/10.1007/978-3-030-43662-9.
  25. Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, and Alex Samordinsky. Testing monotonicity. Combinatorica, 20(3):301-337, 2000. URL: https://doi.org/10.1007/S004930070011.
  26. Oded Goldreich, Shafi Goldwasser, and Dana Ron. Property testing and its connection to learning and approximation. Journal of the ACM, 45:653-750, 1998. URL: https://doi.org/10.1145/285055.285060.
  27. Oded Goldreich and Dana Ron. One-sided error testing of monomials and affine subspaces. Electron. Colloquium Comput. Complex., TR20-068, 2020. URL: https://eccc.weizmann.ac.il/report/2020/068.
  28. S. Halevy and E. Kushilevitz. Distribution-Free Property Testing. In Proceedings of the Seventh International Workshop on Randomization and Computation, pages 302-317, 2003. Google Scholar
  29. S. Halevy and E. Kushilevitz. A lower bound for distribution-free monotonicity testing. In Proceedings of the Ninth International Workshop on Randomization and Computation, pages 330-341, 2005. Google Scholar
  30. Subhash Khot, Dor Minzer, and Muli Safra. On monotonicity testing and boolean isoperimetric-type theorems. SIAM J. Comput., 47(6):2238-2276, 2018. URL: https://doi.org/10.1137/16M1065872.
  31. Subhash Khot and Igor Shinkar. An o(n) queries adaptive tester for unateness. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), pages 37:1-37:7, 2016. Google Scholar
  32. Amit Levi and Erik Waingarten. Lower bounds for tolerant junta and unateness testing via rejection sampling of graphs. In Avrim Blum, editor, 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, January 10-12, 2019, San Diego, California, USA, volume 124 of LIPIcs, pages 52:1-52:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPICS.ITCS.2019.52.
  33. Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, and Rocco A. Servedio. Testing halfspaces. SIAM Journal on Computing, 39(5):2004-2047, 2010. URL: https://doi.org/10.1137/070707890.
  34. R. O'Donnell. Analysis of Boolean Functions. Cambridge University Press, 2014. Google Scholar
  35. M. Parnas, D. Ron, and A. Samorodnitsky. Testing Basic Boolean Formulae. SIAM J. Disc. Math., 16:20-46, 2002. URL: https://doi.org/10.1137/S0895480101407444.
  36. D. Ron. Property Testing: A Learning Theory Perspective. Foundations and Trends in Machine Learning, 1(3):307-402, 2008. URL: https://doi.org/10.1561/2200000004.
  37. L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984. URL: https://doi.org/10.1145/1968.1972.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact