Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 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

Equivalence Testing: The Power of Bounded Adaptivity (2403.04230v1)

Published 7 Mar 2024 in cs.DS

Abstract: Equivalence testing, a fundamental problem in the field of distribution testing, seeks to infer if two unknown distributions on $[n]$ are the same or far apart in the total variation distance. Conditional sampling has emerged as a powerful query model and has been investigated by theoreticians and practitioners alike, leading to the design of optimal algorithms albeit in a sequential setting (also referred to as adaptive tester). Given the profound impact of parallel computing over the past decades, there has been a strong desire to design algorithms that enable high parallelization. Despite significant algorithmic advancements over the last decade, parallelizable techniques (also termed non-adaptive testers) have $\tilde{O}(\log{12}n)$ query complexity, a prohibitively large complexity to be of practical usage. Therefore, the primary challenge is whether it is possible to design algorithms that enable high parallelization while achieving efficient query complexity. Our work provides an affirmative answer to the aforementioned challenge: we present a highly parallelizable tester with a query complexity of $\tilde{O}(\log n)$, achieved through a single round of adaptivity, marking a significant stride towards harmonizing parallelizability and efficiency in equivalence testing.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (28)
  1. Learning with limited rounds of adaptivity: Coin tossing, multi-armed bandits, and ranking from pairwise comparisons. In Conference on Learning Theory, pages 39–75. PMLR, 2017.
  2. A chasm between identity and equivalence testing with conditional queries. Theory of Computing, 14(19):1–46, 2018.
  3. Property testing of joint distributions using conditional samples. ACM Transactions on Computation Theory (TOCT), 10(4):1–20, 2018.
  4. Testing closeness of discrete distributions. Journal of the ACM (JACM), 60(1):1–25, 2013.
  5. The adaptive complexity of maximizing a submodular function. In Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, pages 1138–1151, 2018.
  6. Random restrictions of high dimensional distributions and uniformity testing with subcube conditioning. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 2021.
  7. Tight lower bound on equivalence testing in conditional sampling model. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 4371–4394. SIAM, 2024.
  8. Optimal algorithms for testing closeness of discrete distributions. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pages 1193–1203. SIAM, 2014.
  9. On the power of conditional samples in distribution testing. In Proceedings of the 4th conference on Innovations in Theoretical Computer Science, pages 561–580, 2013.
  10. An adaptivity hierarchy theorem for property testing. computational complexity, 27:671–716, 2018.
  11. Learning and testing junta distributions with sub cube conditioning. In Conference on Learning Theory, pages 1060–1113. PMLR, 2021.
  12. Support size estimation: The power of conditioning. In Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 - September 01, 2023, 2023.
  13. On testing of uniform samplers. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 33-01, pages 7777–7784, 2019.
  14. Parallelizing greedy for submodular set function maximization in matroids and beyond. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 78–89, 2019.
  15. Testing equivalence between distributions using conditional samples. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pages 1174–1192. SIAM, 2014.
  16. Combinatorial group testing and its applications, volume 12. World Scientific, 2000.
  17. Two new perspectives on multi-stage group testing. Algorithmica, 67:324–354, 2013.
  18. Multi-stage group testing improves efficiency of large-scale covid-19 screening. Journal of Clinical Virology, 128:104382, 2020.
  19. Faster algorithms for testing under conditional sampling. In Conference on Learning Theory, pages 607–636. PMLR, 2015.
  20. Property testing and its connection to learning and approximation. Journal of the ACM (JACM), 45(4):653–750, 1998.
  21. A scalable Shannon entropy estimator. In Computer Aided Verification: 34th International Conference, CAV 2022, Haifa, Israel, August 7–10, 2022, Proceedings, Part I, pages 363–384. Springer, 2022.
  22. On testing expansion in bounded-degree graphs. Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation: In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman, pages 68–75, 2011.
  23. Adaptive sparse recovery with limited adaptivity. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2729–2744. SIAM, 2019.
  24. Anaconda: A non-adaptive conditional sampling algorithm for distribution testing. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 679–693. SIAM, 2019.
  25. On testing of samplers. Advances in Neural Information Processing Systems, 33:5753–5763, 2020.
  26. Shyam Narayanan. On tolerant distribution testing in the conditional sampling model. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 357–373. SIAM, 2021.
  27. Improved algorithms for adaptive compressed sensing. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018.
  28. Paul Valiant. Testing symmetric properties of distributions. SIAM Journal on Computing, 40(6):1927–1968, 2011.

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