Sharp Noisy Binary Search with Monotonic Probabilities

Authors Lucas Gretta, Eric Price



PDF
Thumbnail PDF

File

LIPIcs.ICALP.2024.75.pdf
  • Filesize: 0.9 MB
  • 19 pages

Document Identifiers

Author Details

Lucas Gretta
  • University of California, Berkeley, CA, USA
Eric Price
  • University of Texas at Austin, TX, USA

Cite AsGet BibTex

Lucas Gretta and Eric Price. Sharp Noisy Binary Search with Monotonic Probabilities. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 75:1-75:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ICALP.2024.75

Abstract

We revisit the noisy binary search model of [Karp and Kleinberg, 2007], in which we have n coins with unknown probabilities p_i that we can flip. The coins are sorted by increasing p_i, and we would like to find where the probability crosses (to within ε) of a target value τ. This generalized the fixed-noise model of [Burnashev and Zigangirov, 1974], in which p_i = 1/2 ± ε, to a setting where coins near the target may be indistinguishable from it. It was shown in [Karp and Kleinberg, 2007] that Θ(1/ε² log n) samples are necessary and sufficient for this task. We produce a practical algorithm by solving two theoretical challenges: high-probability behavior and sharp constants. We give an algorithm that succeeds with probability 1-δ from 1/C_{τ, ε} ⋅ (log₂ n + O(log^{2/3} n log^{1/3} 1/(δ) + log 1/(δ))) samples, where C_{τ, ε} is the optimal such constant achievable. For δ > n^{-o(1)} this is within 1 + o(1) of optimal, and for δ ≪ 1 it is the first bound within constant factors of optimal.

Subject Classification

ACM Subject Classification
  • Theory of computation → Randomness, geometry and discrete structures
  • Theory of computation → Streaming, sublinear and near linear time algorithms
  • Theory of computation → Lower bounds and information complexity
Keywords
  • fine-grained algorithms
  • randomized/probabilistic methods
  • sublinear/streaming algorithms
  • noisy binary search

Metrics

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

References

  1. Michael Ben-Or and Avinatan Hassidim. The bayesian learner is optimal for noisy binary search (and pretty good for quantum as well). In 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pages 221-230, 2008. URL: https://doi.org/10.1109/FOCS.2008.58.
  2. Marat Valievich Burnashev and Kamil'Shamil'evich Zigangirov. An interval estimation problem for controlled observations. Problemy Peredachi Informatsii, 10(3):51-61, 1974. Google Scholar
  3. Adam Crume. Robust binary search. https://github.com/adamcrume/robust-binary-search, 2020.
  4. Dariusz Dereniowski, Daniel Graf, Stefan Tiegel, and Przemyslaw Uznanski. A framework for searching in graphs in the presence of errors. CoRR, abs/1804.02075, 2018. URL: https://arxiv.org/abs/1804.02075.
  5. Dariusz Dereniowski, Aleksander Lukasiewicz, and Przemyslaw Uznanski. Noisy searching: simple, fast and correct. CoRR, abs/2107.05753, 2021. URL: https://arxiv.org/abs/2107.05753.
  6. Ilias Diakonikolas, Themis Gouleakis, John Peebles, and Eric Price. Sample-optimal identity testing with high probability. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. Google Scholar
  7. Ehsan Emamjomeh-Zadeh, David Kempe, and Vikrant Singhal. Deterministic and probabilistic binary search in graphs. In Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, STOC '16, pages 519-532, New York, NY, USA, 2016. Association for Computing Machinery. URL: https://doi.org/10.1145/2897518.2897656.
  8. Robert G Gallager. Information theory and reliable communication, volume 2. Springer, 1968. Google Scholar
  9. Yuzhou Gu and Yinzhan Xu. Optimal bounds for noisy sorting. STOC, 2023. URL: https://doi.org/10.48550/arXiv.2302.12440.
  10. Richard M. Karp and Robert Kleinberg. Noisy binary search and its applications. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '07, pages 881-890, USA, 2007. Society for Industrial and Applied Mathematics. Google Scholar
  11. Robert Nowak. Noisy generalized binary search. In Y. Bengio, D. Schuurmans, J. Lafferty, C. Williams, and A. Culotta, editors, Advances in Neural Information Processing Systems, volume 22. Curran Associates, Inc., 2009. URL: https://proceedings.neurips.cc/paper/2009/file/556f391937dfd4398cbac35e050a2177-Paper.pdf.
  12. Andrzej Pelc. Searching games with errors—fifty years of coping with liars. Theoretical Computer Science, 270(1):71-109, 2002. URL: https://doi.org/10.1016/S0304-3975(01)00303-6.
  13. Bernard Teo and Jonathan Scarlett. Noisy adaptive group testing via noisy binary search. IEEE Trans. Inf. Theory, 68(5):3340-3353, 2022. URL: https://doi.org/10.1109/TIT.2022.3140604.
  14. Rolf Waeber, Peter I. Frazier, and Shane G. Henderson. Bisection search with noisy responses. SIAM Journal on Control and Optimization, 51(3):2261-2279, 2013. URL: https://doi.org/10.1137/120861898.
  15. Ziao Wang, Nadim Ghaddar, Banghua Zhu, and Lele Wang. Noisy sorting capacity. In 2022 IEEE International Symposium on Information Theory (ISIT), pages 2541-2546. IEEE, 2022. Google Scholar