The geometry of generalized binary search

IEEE Transactions on Information Theory

Volumn 57, Issue 12, 2011, Pages 7893-7906

  Nowak, Robert D ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Binary search; channel coding with feedback; learning theory; query learning; Shannon Fano coding

Indexed keywords

BINARY SEARCH; DISJOINT SUBSETS; GEOMETRIC CONDITIONS; GREEDY ALGORITHMS; HALF SPACES; LEARNING THEORY; NATURAL GENERALIZATION; NOISE-TOLERANT; OPTIMAL QUERY; QUERY LEARNING; SHANNON-FANO CODING;

CODES (SYMBOLS); IMAGE PROCESSING; OPTIMIZATION;

ALGORITHMS;

EID: 83255176241     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2169298     Document Type: Article

References (44)

1. R. M. Goodman and P. Smyth, "Decision tree design from a communication theory standpoint," IEEE Trans. Inf. Theory, vol. 34, no. 5, pp. 979-994, Sep. 1988.
2. M. Horstein, "Sequential decoding using noiseless feedback," IEEE Trans. Inf. Theory, vol. IT-9, no. 3, pp. 136-143, May 1963.
3. M. V. Burnashev and K. S. Zigangirov, "An interval estimation problem for controlled observations," Probl. Inf. Transm., vol. 10, pp. 223-231, 1974.
4. K. S. Zigangirov, "Upper bounds for the error probability of feedback channels," Probl. Peredachi Inform., vol. 6, no. 2, pp. 87-82, 1970.
5. A. Rényi, "On a problem in information theory," MTA Mat. Kut. Int. Kozl., vol. 2, pp. 505-516, 1961.
6. A. Rényi, "On the foundations information theory," Rev. Inst. Statist. Inst., vol. 33, no. 1, 1965.
7. D. W. Loveland, "Performance bounds for binary testing with arbitrary weights," Acta Informatica, vol. 22, pp. 101-114, 1985.
8. U. Feige, E. Raghavan, D. Peleg, and E. Upfal, "Computing with noisy information," SIAM J. Comput., vol. 23, no. 5, pp. 1001-1018, 1994.
9. S. R. Kosaraju, T. M. Przytycka, and R. Borgstrom, "On an optimal split tree problem," Lecture Notes Comput. Sci.: Alg. Data Structures, vol. 1663, pp. 157-168, 1999.
10. A. P. Korostelev, "On minimax rates of convergence in image models under sequential design," Statist. Probab. Lett., vol. 43, pp. 369-375, 1999.
11. A. P. Korostelev and J.-C. Kim, "Rates of convergence fo the sup-norm risk in image models under sequential designs," Statst. Probab. Lett., vol. 46, pp. 391-399, 2000.
12. M. Swain and M. Stricker, "Promising directions in active vision," Int. J. Comput. Vis., vol. 11, no. 2, pp. 109-126, 1993.
13. D. Geman and B. Jedynak, "An active testing model for tracking roads in satellite images," IEEE Trans. Pattern Anal. Mach. Intell., vol. 18, no. 1, pp. 1-14, 1996.
14. E. M. Arkin, H. Meijer, J. S. B. Mitchell, D. Rappaport, and S. Skiena, "Decision trees for geometric models," Intl. J. Comput. Geom. Appl., vol. 8, no. 3, pp. 343-363, 1998.
15. Y. Freund, H. S. Seung, E. Shamir, and N. Tishby, "Selective sampling using the query by committee algorithm," Mach. Learn., vol. 28, pp. 133-168, 1997.
16. S. Dasgupta, "Analysis of a greedy active learning strategy," Neural Inf. Process. Syst., 2004.
17. M.-F. Balcan, A. Broder, and T. Zhang, "Margin based active learning," presented at the Conf. on Learning Theory (COLT), 2007.
18. R. Nowak, "Generalized binary search," presented at the Allerton Conf., Monticello, IL, 2008 [Online]. Available: http//:www.ece.wisc. edu/nowak/gbs.pdf
19. L. Hyafil and R. L. Rivest, "Constructing optimal binary decision trees is NP-complete," Inf. Process. Lett., vol. 5, pp. 15-17, 1976.
20. M. R. Garey and R. L. Graham, "Performance bounds on the splitting algorithm for binary testing," Acta Inf., vol. 3, pp. 347-355, 1974.
21. C. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, 3rd ed. Cambridge, MA: MIT Press, 2009.
22. A. Pelc, "Searching games with erro r-Fifty years of coping with liars," Theoret. Comput. Sci., vol. 270, pp. 71-109, 2002.
23. D. Angluin, "Queries and concept learning," Mach. Learn., vol. 2, pp. 319-342, 1988.
24. D. Angluin, "Queries revisited," Springer Lecture Notes Comput. Sci.: Alg. Learn. Theory, pp. 12-31, 2001.
25. S. R. Kulkarni, S. K. Mitter, and J. N. Tsitsiklis, "Active learning using arbitrary binary valued queries," Mach. Learn., pp. 23-35, 1993.
26. T. Hegedüs, "Generalized teaching dimensions and the query complexity of learning," in Proc. 8th Annu. Conf. Computational Learning Theory, 1995, pp. 108-117.
27. L. Hellerstein, K. Pillaipakkamnatt, V. Raghavan, and D. Wilkins, "How many queries are needed to learn?," J. ACM, vol. 43, no. 5, pp. 840-862, 1996.
28. J. F. Traub, G. W. Wasilkowski, and H. Wozniakowski, Information- Based Complexity. New York: Academic, 1988.
29. K. S. Zigangirov, "Message transmission in a binary symmetric channel with noiseless feedback 9random transmission time)," Probl. Peredachi Inf., vol. 4, no. 3, pp. 88-97, 1968.
30. R. Karp and R. Kleinberg, "Noisy binary search and its applications," in Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 881-890.
31. R. Castro and R. Nowak, "Minimax bounds for active learning," IEEE Trans. Inf. Theory, vol. 54, no. 5, pp. 2339-2353, Jul. 2008.
32. R. L. Rivest, A. R. Meyer, and D. J. Kleitman, "Coping with errors in binary search procedure," J. Comput. Syst. Sci., pp. 396-404, 1980.
33. J. Spencer, "Ulam's searching game with a fixed number of lies," Theoret. Comput. Sci., vol. 95, pp. 307-321, 1992.
34. A. Dhagat, P. Gacs, and P. Winkler, "On playing 'twenty questions' with a liar," in Proc. ACM Symp. Discrete Algorithms (SODA), 1992, pp. 16-22.
35. J. Aslam and A. Dhagat, "Searching in the presence of linearly bounded errors," in Proc. ACM Symp. Theory of Computing (STOC), 1991, pp. 486-493.
36. M. Kääriäinen, "Active learning in the non-realizable case," Alg. Learn. Theory, pp. 63-77, 2006.
37. P. Brémaud, Markov Chains, Gibbs Fields, Monte Carlo Simulations, and Queues. New York: Springer, 1998.
38. C. Scotté, personal communication.
39. E. J. Candés, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006.
40. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
41. S. Dasgupta, "Coarse sample complexity bounds for active learning," Neural Inf. Process. Syst., 2005.
42. R. C. Buck, "Partition of space," Amer. Math. Monthly, vol. 50, no. 9, pp. 541-544, 1943.
43. V. Vapnik, The Nature of Statistical Learning Theory. New York: Springer, 1995.
44. , P. Turan, Ed., Selected Papers of Alfred Rényi. Budapest, Hungary: Akademiai Kiado, 1976, pp. 631-638.