Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Property Testing with Online Adversaries (2311.16566v1)

Published 28 Nov 2023 in cs.DS, cs.CC, and cs.DM

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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (65)
  1. Testing Lipschitz functions on hypergrid domains. Algorithmica, 74(3):1055–1081, 2016.
  2. Testing Reed-Muller codes. IEEE Transactions on Information Theory, 51(11):4032–4039, 2005.
  3. Improved low-degree testing and its applications. Combinatorica, 23(3):365–426, 2003.
  4. Linearity testing in characteristic two. IEEE Transactions on Information Theory, 42(6):1781–1795, 1996.
  5. József Beck. Combinatorial Games: Tic-Tac-Toe Theory. Cambridge: Cambridge University Press, 2008.
  6. Random low-degree polynomials are hard to approximate. Computational Complexity, 21(1):63–81, 2012.
  7. 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.
  8. Omri Ben-Eliezer. Testing local properties of arrays. In 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, pages 11:1–11:20, 2019.
  9. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1:3–40, 1991.
  10. Hard properties with (very) short PCPPs and their applications. In Proceedings, Innovations in Theoretical Computer Science (ITCS), pages 9:1–9:27, 2020.
  11. Checking computations in polylogarithmic time. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 21–31, 1991.
  12. Transitive-closure spanners. SIAM Journal on Computing (SICOMP), 41(6):1380–1425, 2012.
  13. Efficient probabilistically checkable proofs and applications to approximations. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 294–304, 1993.
  14. Free bits, PCPs, and nonapproximability-towards tight results. SIAM Journal on Computing (SICOMP), 27(3):804–915, 1998.
  15. Optimal testing of Reed-Muller codes. In Proceedings, IEEE Symposium on Foundations of Computer Science (FOCS), pages 488–497, 2010.
  16. Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences, 47(3):549–595, 1993.
  17. Lpsubscript𝐿𝑝L_{p}italic_L start_POSTSUBSCRIPT italic_p end_POSTSUBSCRIPT-testing. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 164–173, 2014.
  18. Improved non-approximability results. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 184–193, 1994.
  19. 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.
  20. Property testing on product distributions: Optimal testers for bounded derivative properties. ACM Transactions on Algorithms (TALG), 13(2):20:1–20:30, 2017.
  21. 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.
  22. Deeparnab Chakrabarty and C. Seshadhri. An optimal lower bound for monotonicity testing over hypergrids. Theory of Computing, 10:453–464, 2014.
  23. 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.
  24. Improved testing algorithms for monotonicity. In Proceedings of Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), pages 97–108, 1999.
  25. Testing the Lipschitz property over product distributions with applications to data privacy. In Theory of Cryptography Conference (TCC), pages 418–436, 2013.
  26. Erasure-resilient property testing. SIAM Journal on Computing (SICOMP), 47(2):295–329, 2018.
  27. Spot-checkers. Journal of Computer and System Sciences, 60(3):717–751, 2000.
  28. Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 43(2):268–292, 1996.
  29. Some improvements to total degree tests. In Third Israel Symposium on Theory of Computing and Systems (ISTCS), pages 190–198, 1995.
  30. Self-testing/correcting for polynomials and for approximate functions. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 32–42, 1991.
  31. On learning and testing dynamic environments. Journal of the ACM (JACM), 64(3):1–90, 2017.
  32. Positional Games. Oberwolfach Seminars. Vol. 44. Basel: Birkhäuser Verlag GmbH, 2014.
  33. Optimal testing of multivariate polynomials over small prime fields. SIAM Journal on Computing (SICOMP), 42(2):536–562, 2013.
  34. Simple analysis of graph tests for linearity and PCP. Random Structures and Algorithms, 22(2):139–160, 2003.
  35. Testing low-degree polynomials over prime fields. Random Structures and Algorithms, 35(2):163–193, 2009.
  36. Testing and reconstruction of Lipschitz functions with applications to data privacy. SIAM Journal on Computing (SICOMP), 42(2):700–731, 2013.
  37. Breaking the epsilon-soundness bound of the linearity test over GF(2). SIAM Journal on Computing (SICOMP), 39(5):1988–2003, 2010.
  38. Improved optimal testing results from global hypercontractivity. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pages 98–109. IEEE, 2022.
  39. Testing polynomials over general fields. SIAM Journal on Computing (SICOMP), 36(3):779–802, 2006.
  40. Sublinear-time computation in the presence of online erasures. Theory of Computing, 19(1):1–48, 2023.
  41. Set systems with restricted cross-intersections and the minimum rank ofinclusion matrices. SIAM Journal on Discrete Mathematics, 18(4):713–727, 2005.
  42. Algebraic property testing: the role of invariance. In Proceedings of the fortieth annual ACM symposium on Theory of computing, pages 403–412, 2008.
  43. Erasure-resilient sublinear-time graph algorithms. In Proceedings, Innovations in Theoretical Computer Science (ITCS), pages 80:1–80:20, 2021.
  44. Dana Moshkovitz. Low-degree test with polynomially small error. Computational Complexity, 26(3):531–582, 2017.
  45. Sub-constant error low degree test of almost-linear size. SIAM Journal on Computing (SICOMP), 38(1):140–180, 2008.
  46. Adversarial low degree testing. arXiv, 2308.15441, 2023.
  47. 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.
  48. 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.
  49. Ryan O’Donnell. Analysis of Boolean Functions. Cambridge University Press, 2014.
  50. Parameterized property testing of functions. ACM Transactions on Computation Theory, 9(4):17:1–17:19, 2018.
  51. Approximating the distance to monotonicity of boolean functions. Random Struct. Algorithms, 60(2):233–260, 2022.
  52. Sofya Raskhodnikova. Monotonicity testing. Masters Thesis, MIT, 1999.
  53. Sofya Raskhodnikova. Testing if an array is sorted. Encyclopedia of Algorithms, pages 2219–2222, 2016.
  54. Linearity testing/testing Hadamard codes. In Encyclopedia of Algorithms, pages 1107–1110. Springer, 2016.
  55. Erasures versus errors in local decoding and property testing. Random Structures and Algorithms, 59(4):640–670, 2021.
  56. Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing (SICOMP), 25(2):252–271, 1996.
  57. 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.
  58. A new upper bound on the query complexity of testing generalized Reed-Muller codes. Theory of Computing, 9:783–807, 2013.
  59. Brief announcement: Erasure-resilience versus tolerance to errors. In Proceedings, International Colloquium on Automata, Languages and Programming (ICALP), pages 111:1–111:3, 2018.
  60. Alex Samorodnitsky. Low-degree tests at large distances. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 506–515, 2007.
  61. Probabilistically checkable proofs with low amortized query complexity. In Proceedings, IEEE Symposium on Foundations of Computer Science (FOCS), pages 18–27, 1998.
  62. A PCP characterization of NP with optimal amortized query complexity. In Proceedings, ACM Symposium on Theory of Computing (STOC), pages 191–199, 2000.
  63. Gowers uniformity, influence of variables, and PCPs. SIAM Journal on Computing (SICOMP), 39(1):323–360, 2009.
  64. Derandomizing homomorphism testing in general groups. SIAM Journal on Computing (SICOMP), 36(4):1215–1230, 2006.
  65. 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.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets