Document Open Access Logo

Property Testing with Online Adversaries

Authors Omri Ben-Eliezer , Esty Kelman , Uri Meir , Sofya Raskhodnikova



PDF
Thumbnail PDF

File

LIPIcs.ITCS.2024.11.pdf
  • Filesize: 3.25 MB
  • 25 pages

Document Identifiers

Author Details

Omri Ben-Eliezer
  • Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA, USA
Esty Kelman
  • Department of Computer Science and Faculty of Computing & Data Sciences, Boston University, MA, USA
  • CSAIL, Massachusetts Institute of Technology, Cambridge, MA, USA
Uri Meir
  • Blavatnik School of Computer Science, Tel Aviv University, Israel
Sofya Raskhodnikova
  • Department of Computer Science, Boston University, MA, USA

Acknowledgements

We thank Shachar Lovett for referring us to [Ben-Eliezer et al., 2012; Keevash and Sudakov, 2005], which led to the result in Section 4.

Cite AsGet BibTex

Omri Ben-Eliezer, Esty Kelman, Uri Meir, and Sofya Raskhodnikova. Property Testing with Online Adversaries. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 11:1-11:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ITCS.2024.11

Abstract

The online manipulation-resilient testing model, proposed by Kalemaj, Raskhodnikova and Varma (ITCS 2022 and Theory of Computing 2023), studies property testing in situations where access to the input degrades continuously and adversarially. Specifically, after each query made by the tester is answered, the adversary can intervene and either erase or corrupt t data points. In this work, we investigate a more nuanced version of the online model in order to overcome old and new impossibility results for the original model. We start by presenting an optimal tester for linearity and a lower bound for low-degree testing of Boolean functions in the original model. We overcome the lower bound by allowing batch queries, where the tester gets a group of queries answered between manipulations of the data. Our batch size is small enough so that function values for a single batch on their own give no information about whether the function is of low degree. Finally, to overcome the impossibility results of Kalemaj et al. for sortedness and the Lipschitz property of sequences, we extend the model to include t < 1, i.e., adversaries that make less than one erasure per query. For sortedness, we characterize the rate of erasures for which online testing can be performed, exhibiting a sharp transition from optimal query complexity to impossibility of testability (with any number of queries). Our online tester works for a general class of local properties of sequences. One feature of our results is that we get new (and in some cases, simpler) optimal algorithms for several properties in the standard property testing model.

Subject Classification

ACM Subject Classification
  • Theory of computation → Streaming, sublinear and near linear time algorithms
Keywords
  • Linearity testing
  • low-degree testing
  • Reed-Muller codes
  • testing properties of sequences
  • erasure-resilience
  • corruption-resilience

Metrics

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

References

  1. Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, and Dana Ron. Testing Reed-Muller codes. IEEE Transactions on Information Theory, 51(11):4032-4039, 2005. URL: https://doi.org/10.1109/TIT.2005.856958.
  2. Sanjeev Arora and Madhu Sudan. Improved low-degree testing and its applications. Combinatorica, 23(3):365-426, 2003. URL: https://doi.org/10.1007/s00493-003-0025-0.
  3. Pranjal Awasthi, Madhav Jha, Marco Molinaro, and Sofya Raskhodnikova. Testing Lipschitz functions on hypergrid domains. Algorithmica, 74(3):1055-1081, 2016. URL: https://doi.org/10.1007/s00453-015-9984-y.
  4. László Babai, Lance Fortnow, Leonid A. Levin, and Mario Szegedy. Checking computations in polylogarithmic time. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 21-31, 1991. URL: https://doi.org/10.1145/103418.103428.
  5. László Babai, Lance Fortnow, and Carsten Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1:3-40, 1991. URL: https://doi.org/10.1007/BF01200056.
  6. József Beck. Combinatorial Games: Tic-Tac-Toe Theory. Cambridge: Cambridge University Press, 2008. Google Scholar
  7. Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, and Madhu Sudan. Linearity testing in characteristic two. IEEE Transactions on Information Theory, 42(6):1781-1795, 1996. URL: https://doi.org/10.1109/18.556674.
  8. Mihir Bellare, Oded Goldreich, and Madhu Sudan. Free bits, PCPs, and nonapproximability-towards tight results. SIAM Journal on Computing (SICOMP), 27(3):804-915, 1998. URL: https://doi.org/10.1137/S0097539796302531.
  9. Mihir Bellare, Shafi Goldwasser, Carsten Lund, and Alexander Russell. Efficient probabilistically checkable proofs and applications to approximations. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 294-304, 1993. URL: https://doi.org/10.1145/167088.167174.
  10. Mihir Bellare and Madhu Sudan. Improved non-approximability results. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 184-193, 1994. URL: https://doi.org/10.1145/195058.195129.
  11. Aleksandrs Belovs. Adaptive lower bound for testing monotonicity on the line. In Proceedings of Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), pages 31:1-31:10, 2018. URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.31.
  12. Ido Ben-Eliezer, Rani Hod, and Shachar Lovett. Random low-degree polynomials are hard to approximate. Computational Complexity, 21(1):63-81, 2012. Google Scholar
  13. Omri Ben-Eliezer. Testing local properties of arrays. In 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, pages 11:1-11:20, 2019. Google Scholar
  14. Omri Ben-Eliezer, Eldar Fischer, Amit Levi, and Ron D. Rothblum. Hard properties with (very) short PCPPs and their applications. In Proceedings, Innovations in Theoretical Computer Science (ITCS), pages 9:1-9:27, 2020. URL: https://doi.org/10.4230/LIPIcs.ITCS.2020.9.
  15. Omri Ben-Eliezer, Esty Kelman, Uri Meir, and Sofya Raskhodnikova. Property testing with online adversaries, 2023. URL: https://arxiv.org/abs/2311.16566.
  16. Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, and Avi Wigderson. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 612-621, 2003. URL: https://doi.org/10.1145/780542.780631.
  17. Piotr Berman, Sofya Raskhodnikova, and Grigory Yaroslavtsev. L_p-testing. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 164-173, 2014. URL: https://doi.org/10.1145/2591796.2591887.
  18. Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, and David P. Woodruff. Transitive-closure spanners. SIAM Journal on Computing (SICOMP), 41(6):1380-1425, 2012. URL: https://doi.org/10.1137/110826655.
  19. Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, and David Zuckerman. Optimal testing of Reed-Muller codes. In Proceedings, IEEE Symposium on Foundations of Computer Science (FOCS), pages 488-497, 2010. URL: https://doi.org/10.1109/FOCS.2010.54.
  20. Manuel Blum, Michael Luby, and Ronitt Rubinfeld. Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences, 47(3):549-595, 1993. URL: https://doi.org/10.1016/0022-0000(93)90044-W.
  21. Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, and C. Seshadhri. Property testing on product distributions: Optimal testers for bounded derivative properties. ACM Transactions on Algorithms (TALG), 13(2):20:1-20:30, 2017. URL: https://doi.org/10.1145/3039241.
  22. Deeparnab Chakrabarty and C. Seshadhri. Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 419-428, 2013. URL: https://doi.org/10.1145/2488608.2488661.
  23. Deeparnab Chakrabarty and C. Seshadhri. An optimal lower bound for monotonicity testing over hypergrids. Theory of Computing, 10:453-464, 2014. URL: https://doi.org/10.4086/toc.2014.v010a017.
  24. Irit Dinur and Venkatesan Guruswami. PCPs via low-degree long code and hardness for constrained hypergraph coloring. In Proceedings, IEEE Symposium on Foundations of Computer Science (FOCS), pages 340-349, 2013. URL: https://doi.org/10.1109/FOCS.2013.44.
  25. Kashyap Dixit, Madhav Jha, Sofya Raskhodnikova, and Abhradeep Thakurta. Testing the Lipschitz property over product distributions with applications to data privacy. In Theory of Cryptography Conference (TCC), pages 418-436, 2013. URL: https://doi.org/10.1007/978-3-642-36594-2_24.
  26. Kashyap Dixit, Sofya Raskhodnikova, Abhradeep Thakurta, and Nithin Varma. Erasure-resilient property testing. SIAM Journal on Computing (SICOMP), 47(2):295-329, 2018. URL: https://doi.org/10.1137/16M1075661.
  27. Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, and Alex Samorodnitsky. Improved testing algorithms for monotonicity. In Proceedings of Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), pages 97-108, 1999. URL: https://doi.org/10.1007/978-3-540-48413-4_10.
  28. Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, and Mahesh Viswanathan. Spot-checkers. Journal of Computer and System Sciences, 60(3):717-751, 2000. URL: https://doi.org/10.1006/jcss.1999.1692.
  29. Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, and Mario Szegedy. Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 43(2):268-292, 1996. URL: https://doi.org/10.1145/226643.226652.
  30. Katalin Friedl and Madhu Sudan. Some improvements to total degree tests. In Third Israel Symposium on Theory of Computing and Systems (ISTCS), pages 190-198, 1995. URL: https://doi.org/10.1109/ISTCS.1995.377032.
  31. Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan, and Avi Wigderson. Self-testing/correcting for polynomials and for approximate functions. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 32-42, 1991. URL: https://doi.org/10.1145/103418.103429.
  32. Oded Goldreich and Dana Ron. On learning and testing dynamic environments. Journal of the ACM (JACM), 64(3):1-90, 2017. Google Scholar
  33. Elad Haramaty, Amir Shpilka, and Madhu Sudan. Optimal testing of multivariate polynomials over small prime fields. SIAM Journal on Computing (SICOMP), 42(2):536-562, 2013. URL: https://doi.org/10.1137/120879257.
  34. Johan Håstad and Avi Wigderson. Simple analysis of graph tests for linearity and PCP. Random Structures and Algorithms, 22(2):139-160, 2003. URL: https://doi.org/10.1002/rsa.10068.
  35. Dan Hefetz, Michael Krivelevich, Miloš Stojaković, and Tibor Szabó. Positional Games. Oberwolfach Seminars. Vol. 44. Basel: Birkhäuser Verlag GmbH, 2014. Google Scholar
  36. Madhav Jha and Sofya Raskhodnikova. Testing and reconstruction of Lipschitz functions with applications to data privacy. SIAM Journal on Computing (SICOMP), 42(2):700-731, 2013. URL: https://doi.org/10.1137/110840741.
  37. Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, and David Zuckerman. Testing low-degree polynomials over prime fields. Random Structures and Algorithms, 35(2):163-193, 2009. URL: https://doi.org/10.1002/rsa.20262.
  38. Iden Kalemaj, Sofya Raskhodnikova, and Nithin Varma. Sublinear-time computation in the presence of online erasures. Theory of Computing, 19(1):1-48, 2023. URL: http://theoryofcomputing.org/articles/v019a001/.
  39. Tali Kaufman, Simon Litsyn, and Ning Xie. Breaking the epsilon-soundness bound of the linearity test over GF(2). SIAM Journal on Computing (SICOMP), 39(5):1988-2003, 2010. URL: https://doi.org/10.1137/080715548.
  40. Tali Kaufman and Dor Minzer. Improved optimal testing results from global hypercontractivity. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pages 98-109. IEEE, 2022. Google Scholar
  41. Tali Kaufman and Dana Ron. Testing polynomials over general fields. SIAM Journal on Computing (SICOMP), 36(3):779-802, 2006. URL: https://doi.org/10.1137/S0097539704445615.
  42. Tali Kaufman and Madhu Sudan. Algebraic property testing: the role of invariance. In Proceedings of the fortieth annual ACM symposium on Theory of computing, pages 403-412, 2008. Google Scholar
  43. Peter Keevash and Benny Sudakov. Set systems with restricted cross-intersections and the minimum rank ofinclusion matrices. SIAM Journal on Discrete Mathematics, 18(4):713-727, 2005. Google Scholar
  44. Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, and Nithin Varma. Erasure-resilient sublinear-time graph algorithms. In Proceedings, Innovations in Theoretical Computer Science (ITCS), pages 80:1-80:20, 2021. URL: https://doi.org/10.4230/LIPIcs.ITCS.2021.80.
  45. Dor Minzer and Kai Zheng. Adversarial low degree testing. arXiv, 2308.15441, 2023. URL: https://arxiv.org/abs/2308.15441.
  46. Dana Moshkovitz. Low-degree test with polynomially small error. Computational Complexity, 26(3):531-582, 2017. URL: https://doi.org/10.1007/s00037-016-0149-4.
  47. Dana Moshkovitz and Ran Raz. Sub-constant error low degree test of almost-linear size. SIAM Journal on Computing (SICOMP), 38(1):140-180, 2008. URL: https://doi.org/10.1137/060656838.
  48. Yonatan Nakar and Dana Ron. Testing Dynamic Environments: Back to Basics. In Nikhil Bansal, Emanuela Merelli, and James Worrell, editors, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), volume 198 of Leibniz International Proceedings in Informatics (LIPIcs), pages 98:1-98:20, Dagstuhl, Germany, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ICALP.2021.98.
  49. Ilan Newman and Nithin Varma. New sublinear algorithms and lower bounds for LIS estimation. In Proceedings, International Colloquium on Automata, Languages and Programming (ICALP), pages 100:1-100:20, 2021. URL: https://doi.org/10.4230/LIPIcs.ICALP.2021.100.
  50. Ryan O'Donnell. Analysis of Boolean Functions. Cambridge University Press, 2014. URL: http://www.cambridge.org/de/academic/subjects/computer-science/algorithmics-complexity-computer-algebra-and-computational-g/analysis-boolean-functions.
  51. Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, and Nithin Varma. Parameterized property testing of functions. ACM Transactions on Computation Theory, 9(4):17:1-17:19, 2018. URL: https://doi.org/10.1145/3155296.
  52. Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, and Erik Waingarten. Approximating the distance to monotonicity of boolean functions. Random Struct. Algorithms, 60(2):233-260, 2022. URL: https://doi.org/10.1002/rsa.21029.
  53. Sofya Raskhodnikova. Monotonicity testing. Masters Thesis, MIT, 1999. Google Scholar
  54. Sofya Raskhodnikova. Testing if an array is sorted. Encyclopedia of Algorithms, pages 2219-2222, 2016. URL: https://doi.org/10.1007/978-1-4939-2864-4_700.
  55. Sofya Raskhodnikova, Noga Ron-Zewi, and Nithin Varma. Erasures versus errors in local decoding and property testing. Random Structures and Algorithms, 59(4):640-670, 2021. URL: https://doi.org/10.1002/rsa.21031.
  56. Sofya Raskhodnikova and Ronitt Rubinfeld. Linearity testing/testing Hadamard codes. In Encyclopedia of Algorithms, pages 1107-1110. Springer, 2016. URL: https://doi.org/10.1007/978-1-4939-2864-4_202.
  57. Sofya Raskhodnikova and Nithin Varma. Brief announcement: Erasure-resilience versus tolerance to errors. In Proceedings, International Colloquium on Automata, Languages and Programming (ICALP), pages 111:1-111:3, 2018. URL: https://doi.org/10.4230/LIPIcs.ICALP.2018.111.
  58. Ran Raz and Shmuel Safra. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 475-484, 1997. URL: https://doi.org/10.1145/258533.258641.
  59. Noga Ron-Zewi and Madhu Sudan. A new upper bound on the query complexity of testing generalized Reed-Muller codes. Theory of Computing, 9:783-807, 2013. URL: https://doi.org/10.4086/toc.2013.v009a025.
  60. Ronitt Rubinfeld and Madhu Sudan. Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing (SICOMP), 25(2):252-271, 1996. URL: https://doi.org/10.1137/S0097539793255151.
  61. Alex Samorodnitsky. Low-degree tests at large distances. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 506-515, 2007. URL: https://doi.org/10.1145/1250790.1250864.
  62. Alex Samorodnitsky and Luca Trevisan. A PCP characterization of NP with optimal amortized query complexity. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 191-199, 2000. URL: https://doi.org/10.1145/335305.335329.
  63. Alex Samorodnitsky and Luca Trevisan. Gowers uniformity, influence of variables, and PCPs. SIAM Journal on Computing (SICOMP), 39(1):323-360, 2009. URL: https://doi.org/10.1137/070681612.
  64. Amir Shpilka and Avi Wigderson. Derandomizing homomorphism testing in general groups. SIAM Journal on Computing (SICOMP), 36(4):1215-1230, 2006. URL: https://doi.org/10.1137/S009753970444658X.
  65. Madhu Sudan and Luca Trevisan. Probabilistically checkable proofs with low amortized query complexity. In Proceedings, IEEE Symposium on Foundations of Computer Science (FOCS), pages 18-27, 1998. URL: https://doi.org/10.1109/SFCS.1998.743425.
  66. Luca Trevisan. Recycling queries in PCPs and in linearity tests (extended abstract). In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 299-308, 1998. URL: https://doi.org/10.1145/276698.276769.
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