Document Open Access Logo

Let’s Try to Be More Tolerant: On Tolerant Property Testing and Distance Approximation (Invited Talk)

Author Dana Ron

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2025.2.pdf
  • Filesize: 0.65 MB
  • 10 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Streaming, sublinear and near linear time algorithms
Keywords
  • Sublinear Algorithms
  • Tolerant Property Testing
  • Distance Approximation

Metrics

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

Abstract

This short paper accompanies an invited talk given at ICALP2025. It is an informal, high-level presentation of tolerant testing and distance approximation. It includes some general results as well as a few specific ones, with the aim of providing a taste of this research direction within the area of sublinear algorithms.

Cite As Get BibTex

Dana Ron. Let’s Try to Be More Tolerant: On Tolerant Property Testing and Distance Approximation (Invited Talk). In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 2:1-2:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICALP.2025.2

Author Details

Dana Ron
  • School of ECE, Tel Aviv University, Israel

References

  1. Nir Ailon, Bernard Chazelle, Seshadhri Comandur, and Ding Liu. Estimating the distance to a monotone function. Random Structures and Algorithms, 31(3):371-383, 2007. URL: https://doi.org/10.1002/RSA.20167.
  2. Tugkan Batu, Funda Ergun, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, and Rahul Sami. A sublinear algorithm for weakly approximating edit distance. In Proceedings of the 35th Annual ACM Symposium on the Theory of Computing (STOC), pages 316-324, 2003. URL: https://doi.org/10.1145/780542.780590.
  3. Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, and Patrick White. Testing closeness of discrete distributions. Journal of the ACM, 60(1):4:1-4:25, 2013. URL: https://doi.org/10.1145/2432622.2432626.
  4. Omri Ben-Eliezer, Eldar Fischer, Amit Levi, and Ron D. Rothblum. Hard properties with (very) short PCPPs and their applications. In Proceedings of the 11th Innovations in Theoretical Computer Science conference (ITCS), pages 9:1-9:27, 2020. URL: https://doi.org/10.4230/LIPICS.ITCS.2020.9.
  5. Piotr Berman, Meiram Murzabulatov, and Sofya Raskhodnikova. Tolerant testers of image properties. ACM Transactions on Algorithms, 18(4):1-39, 2022. Article number 37. URL: https://doi.org/10.1145/3531527.
  6. Piotr Berman, Sofya Raskhodnikova, and Grigory Yaroslavtsev. L_p-testing. In Proceedings of the 46th Annual ACM Symposium on the Theory of Computing (STOC), pages 164-173, 2014. URL: https://doi.org/10.1145/2591796.2591887.
  7. Hadley Black, Iden Kalemaj, and Sofya Raskhodnikova. Isoperimetric inequalities for real-valued functions with applications to monotonicity testing. In Automata, Languages and Programming: 50th International Colloquium (ICALP), pages 25:1-25:20, 2023. URL: https://doi.org/10.4230/LIPICS.ICALP.2023.25.
  8. Eric Blais, Clément Canonne, Talya Eden, Amit Levi, and Dana Ron. Tolerant junta testing and the connection to submodular optimization and function isomorphism. ACM Transactions on Computation Theory, 11(4):1-33, 2019. URL: https://doi.org/10.1145/3337789.
  9. Avrim Blum and Lunjia Hu. Active tolerant testing. In Proceedings of the 31st Conference on Computational Learning Theory (COLT), pages 474-497, 2018. URL: http://proceedings.mlr.press/v75/blum18a.html.
  10. 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.
  11. Andrea Campagna, Alan Guo, and Ronitt Rubinfeld. Local reconstructors and tolerant testers for connectivity and diameter. In Proceedings of the 17th International Workshop on Randomization and Computation (RANDOM), pages 411-424, 2013. URL: https://doi.org/10.1007/978-3-642-40328-6_29.
  12. Clément Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, and Karl Wimmer. Testing k-monotonicity: The rise and fall of boolean functions. Theory of Computing, 15(1):1-55, 2019. URL: https://doi.org/10.4086/TOC.2019.V015A001.
  13. Bernard Chazelle, Ronitt Rubinfeld, and Luca Trevisan. Approximating the minimum spanning tree weight in sublinear time. SIAM Journal on Computing, 34(6):1370-1379, 2005. URL: https://doi.org/10.1137/S0097539702403244.
  14. Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, and Rocco Servedio. Mildly exponential lower bounds on tolerant testers for monotonicity, unateness, and juntas. In Proceedings of the 35th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 4321-4337, 2024. URL: https://doi.org/10.1137/1.9781611977912.151.
  15. Xi Chen, Anindya De, Shivam Nadimpalli, Rocco Servedio, and Erik Waingarten. Lower bounds for convexity testing. In Proceedings of the 36th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 446-488, 2025. URL: https://doi.org/10.1137/1.9781611978322.13.
  16. Xi Chen and Shyamal Patel. New lower bounds for adaptive tolerant junta testing. In Proceedings of the 64th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1778-1786, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00108.
  17. Omer Cohen Sidon and Dana Ron. Sample-based distance-approximation for subsequence-freeness. Algorithmica, 86:2519-2556, 2024. URL: https://doi.org/10.1007/S00453-024-01233-4.
  18. Anindya De, Elchanan Mossel, and Joe Neeman. Robust testing of low dimensional functions. In Proceedings of the 53rd Annual ACM Symposium on the Theory of Computing (STOC), pages 584-597, 2021. URL: https://doi.org/10.1145/3406325.3451115.
  19. Ilias Diakonikolas, Homin Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco Servedio, and Andrew Wan. Testing for concise representations. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 549-557, 2007. URL: https://doi.org/10.1109/FOCS.2007.32.
  20. Kashyap Dixit, Sofya Raskhodnikova, Abhradeep Thakurta, and Nithin Varma. Erasure-resilient property testing. SIAM Journal on Computing, 47(2):295-329, 2018. URL: https://doi.org/10.1137/16M1075661.
  21. Yevgeny Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, and Alex Samorodnitsky. Improved testing algorithms for monotonicity. In Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), pages 97-108, 1999. URL: https://doi.org/10.1007/978-3-540-48413-4_10.
  22. Funda Ergun, Sampath Kannan, S. 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.
  23. Shahar Fattal. Approximating the distance to monotonicity and convexity in sublinear time. Master’s thesis, Tel Aviv University, 2006. Google Scholar
  24. Shahar Fattal and Dana Ron. Approximating the distance to monotonicity in high dimensions. ACM Transactions on Algorithms, 6(3):1-37, 2010. URL: https://doi.org/10.1145/1798596.1798605.
  25. Nimrod Fiat and Dana Ron. On efficient distance approximation for graph properties. In Proceedings of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1618-1637, 2021. URL: https://doi.org/10.1137/1.9781611976465.98.
  26. Eldar Fischer and Lance Fortnow. Tolerant versus intolerant testing for boolean properties. Theory of Computing, 2:173-183, 2006. URL: https://doi.org/10.4086/TOC.2006.V002A009.
  27. Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, and Alex Samorodnitsky. Monotonicity testing over general poset domains. In Proceedings of the 34th Annual ACM Symposium on the Theory of Computing (STOC), pages 474-483, 2002. URL: https://doi.org/10.1145/509907.509977.
  28. Eldar Fischer and Ilan Newman. Testing versus estimation of graph properties. SIAM Journal on Computing, 37(2):482-501, 2007. URL: https://doi.org/10.1137/060652324.
  29. Lior Gishboliner, Nick Kushnir, , and Asaf Shapira. Testing versus estimation of graph properties, revisited. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM, pages 46:1-46:18, 2023. URL: https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2023.46.
  30. Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, and Alex Samorodnitsky. Testing monotonicity. Combinatorica, 20(3):301-337, 2000. URL: https://doi.org/10.1007/S004930070011.
  31. Oded Goldreich, Shafi Goldwasser, and Dana Ron. Property testing and its connections to learning and approximation. Journal of the ACM, 45:653-750, 1998. URL: https://doi.org/10.1145/285055.285060.
  32. Oded Goldreich and Dana Ron. Property testing in bounded degree graphs. Algorithmica, pages 302-343, 2002. URL: https://doi.org/10.1007/S00453-001-0078-7.
  33. Oded Goldreich and Avi Wigderson. Robustly self-ordered graphs: Constructions and applications to property testing. TheoretiCS, 1, 2022. Article number 1. URL: https://doi.org/10.46298/THEORETICS.22.1.
  34. Venkat Guruswami and Atri Rudra. Tolerant locally testable codes. In Proceedings of the 9th International Workshop on Randomization and Computation (RANDOM), pages 306-317, 2005. Google Scholar
  35. Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguyen, and Krzysztof Onak. Local graph partitions for approximation and testing. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 22-31, 2009. URL: https://doi.org/10.1109/FOCS.2009.77.
  36. Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, and Henrique Stagni. Estimating parameters associated with monotone properties. Combinatorics, Probability and Computing, 29(4):616-632, 2020. URL: https://doi.org/10.1017/S0963548320000048.
  37. Vishnu Iyer, Avishay Tal, and Michael Whitmeyer. Junta distance approximation with sub-exponential queries. In Proceedings of the 36th Computational Complexity Conference (CCC), pages 24:1-24:38, 2021. URL: https://doi.org/10.4230/LIPICS.CCC.2021.24.
  38. Subash Khot, Dor Minzer, and Muli Safra. On monotonicity testing and boolean isoperimetric-type theorems. SIAM Journal on Computing, 47(6):2238-2276, 2018. URL: https://doi.org/10.1137/16M1065872.
  39. Swastik Kopparty and Shubhangi Saraf. Tolerant linearity testing and locally testable codes. In Proceedings of the 13th International Workshop on Randomization and Computation (RANDOM), pages 601-614, 2009. URL: https://doi.org/10.1007/978-3-642-03685-9_45.
  40. Jane Lange, Ephraim Linder, Sofya Raskhodnikova, and Arsen Vasilyan. Local lipschitz filters for bounded-range functions with applications to arbitrary real-valued functions. In Proceedings of the 36th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2881-2907, 2025. URL: https://doi.org/10.1137/1.9781611978322.93.
  41. Amit Levi, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, and Nithin Varma. Erasure-resilient sublinear-time graph algorithms. ACM Transactions on Computation Theory, 14(1):1:1-1:22, 2022. URL: https://doi.org/10.1145/3488250.
  42. Amit Levi and Erik Waingarten. Lower bounds for tolerant junta and unateness testing via rejection sampling of graphs. In Proceedings of the 10th Innovations in Theoretical Computer Science conference (ITCS), pages 52:1-52:20, 2019. URL: https://doi.org/10.4230/LIPICS.ITCS.2019.52.
  43. Sharon Marko and Dana Ron. Distance approximation in bounded-degree and general sparse graphs. Transactions on Algorithms, 5(2), 2009. Article number 22. Google Scholar
  44. Shivam Nadimpalli and Shyamal Patel. Optimal non-adaptive tolerant junta testing via local estimators. In Proceedings of the 56th Annual ACM Symposium on the Theory of Computing (STOC), pages 1039-1050, 2024. URL: https://doi.org/10.1145/3618260.3649687.
  45. Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, and Erik Waingarten. Approximating the distance to monotonicity of boolean functions. Random Structures and Algorithms, 60(2):233-260, 2022. URL: https://doi.org/10.1002/RSA.21029.
  46. Michal Parnas and Dana Ron. Testing the diameter of graphs. Random Structures and Algorithms, 20(2):165-183, 2002. URL: https://doi.org/10.1002/RSA.10013.
  47. Michal Parnas, Dana Ron, and Ronitt Rubinfeld. Tolerant property testing and distance approximation. Journal of Computer and System Sciences, 72(6):1012-1042, 2006. URL: https://doi.org/10.1016/J.JCSS.2006.03.002.
  48. Sofya Raskhodnikova, Noga Ron-Zewi, and Nithin Varma. Erasures vs. errors in local decoding and property testing. Random Structures and Algorithms, 59:640-670, 2021. URL: https://doi.org/10.1002/RSA.21031.
  49. Dana Ron and Asaf Rosin. Optimal distribution-free sample-based testing of subsequence-freeness with one-sided error. ACM Transactions on Computation Theory, 14(4):1-31, 2022. URL: https://doi.org/10.1145/3512750.
  50. Ronitt Rubinfeld and Madhu Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996. URL: https://doi.org/10.1137/S0097539793255151.
  51. Michael Saks and C. Seshadhri. Local monotonicity reconstruction. SIAM Journal on Computing, 39)(7):2897-2926, 2010. URL: https://doi.org/10.1137/080728561.
  52. Gregory Valiant and Paul Valiant. Estimating the unseen: an n/log(n)-sample estimator for entropy and support size, shown optimal via new CLTs. In Proceedings of the 43rd Annual ACM Symposium on the Theory of Computing (STOC), pages 685-694, 2011. URL: https://doi.org/10.1145/1993636.1993727.
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
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact