The Bayesian learner is optimal for noisy binary search (and pretty good for quantum as well)

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 221-230

  Or, Michael Ben ^a   Hassidim, Avinatan ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS; CONTROL THEORY; FIBER OPTIC CHEMICAL SENSORS; LEARNING ALGORITHMS;

BAYESIAN; BAYESIAN APPROACHES; BINARY SEARCHES; EXPECTED COMPLEXITIES; LOWER BOUNDS; QUANTUM SEARCH ALGORITHMS;

BAYESIAN NETWORKS;

EID: 57949112800     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.58     Document Type: Conference Paper

References (27)

1. Ambainis. A better lower bound for quantum algorithms searching an ordered list. In FOCS: IEEE Symposium on Foundations of Computer Science (FOCS), 1999.
2. Aslam and Dhagat. Searching in the presence of linearly bounded errors (extended abstract). In STOC: ACM Symposium on Theory of Computing (STOC), 1991.
3. J. A. Aslam. Noise tolerant algorithms for learning and searching. PhD thesis, Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
4. M. Ben-Or and A. Hassidim. Quantum search in an ordered list via adaptive learning, 2007.
5. Borgstrom and Kosaraju. Comparison-based search in the presence of errors (preliminary version). In STOC: ACM Symposium on Theory of Computing (STOC), 1993.
6. H. Buhrman, I. Newman, H. Röhrig, and R. de Wolf. Robust quantum algorithms and polynomials. CoRR, quant-ph/0309220, 2003. informal publication.
7. A. M. Childs, A. J. Landahl, and P. A. Parrilo. Improved quantum, algorithms for the ordered search problem via semidefinite programming, Aug. 21 2006. Comment: 8 pages, 4 figures.
8. A. M. Childs and T. Lee. Optimal quantum adversary lower bounds for ordered search, Aug. 24 2007. Comment: 13 pages, 2 figures.
9. Cicalese, Mundici, and Vaccaro. Least adaptive optimal search with unreliable tests. In SWAT: Scandinavian Workshop on Algorithm Theory, 2000.
10. A. Dhagat, P. Gács, and P. Winkler. On playing "twenty questions" with a liar. In SODA, pages 16-22, 1992.
11. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser. Invariant quantum, algorithms for insertion into an ordered list, Jan. 19 .1999. Comment: 19 pages, LaTeX, amssymb,amsmath packages; email to farhi@mit.edu.
12. Feige, Raghavan, Peleg, and Upfal. Computing with noisy information. SICOMP: SIAM Journal on Computing, 23, 1994.
13. J. Heinemeyer, H. Eubel, D. Wehmhönre, L. Jänsch, and H. Braun. Proteinic approach to characterize the supra-mulecular organization of photosystems in higher plants. Phytochemistry, 65:1683-1692, 2004.
14. Hoyer, Mosca, and de Wolf. Quantum search on bounded-error inputs. In ICALP: Annual International Colloquium on Automata, Languages and Programming, 2003.
15. Hoyer, Neerbek, and Shi. Quantum complexities of ordered searching, sorting and element distinctness. ALGRTH-MICA: Algorithmica, 34, 2002.
16. Jacokes, Landahl, and Brooks. An improved quantum algorithm for searching an ordered list. In preparation, 2006.
17. Karp and Kleinberg. Noisy binary search and its applications. In SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms), 2007.
18. S. Muthukrishnan. On optimal strategies for searching in presence of errors. In SODA, pages 680-689, 1994.
19. G. B. Orr. Removing noise in on-line search using adaptive batch sizes. In M. C. Mozer, M. I. Jordan, and T. Petsche, editors, Advances in Neural Information Processing Systems, volume 9, page 232. The MIT Press, 1997.
20. A. Pedrotti. Searching with a constant rate of malicious lies. In E. Lodi, L. Pagli, and N. Santoro, editors, Proceedings of the International Conference on Fun with Algorithms (FUN-98), pages 137-147, Waterloo, Ontario, June 18-20 1999. Carleton Scientific.
21. Pelc. Searching with known error probability. TCS: Theoretical Computer Science, 63, 1989.
22. Pelc. Searching games with errors-fifty years of coping with liars. TCS: Theoretical Computer Science, 270, 2002.
23. O. Regev and L. Schiff. Impossibility of a quantum speed-up with a faulty oracle. In L. Aceto, I. Damgård, L. A. Goldberg, M. M. Halldórsson, A. Ingólfsdóttir, and I. Walukiewicz, editors, ICALP (1), volume 5125 of Lecture Notes in Computer Science, pages 773-781. Springer, 2008.
24. A. Rényi. On a problem in information theory, 1961.
25. R. L. Rivest, A. R. Meyer, D. J. Kleitman, and K. Winklmann. Coping with errors in binary search procedures. J. Comput Sys. Sci., 20:396-405, 1980.
26. H. Schägger, W. Cramer, and G. von Jagow. Analysis of molecular masses and oligomeric states of protein complexes by blue native electrophoresis and isolation of membrane protein complexes by two-dimensional native electrophoresis. Analytical Biochemiostry, 217:220-230.
27. S. M. Ulam. Adventures of a Mathematician. Scribner's, New York, 1976.