Twenty questions with noise: Bayes optimal policies for entropy loss

Journal of Applied Probability

Volumn 49, Issue 1, 2012, Pages 114-136

  Jedynak, Bruno ^a   Frazier, Peter I ^b   Sznitman, Raphael ^c  

^a Johns Hopkins University   (United States)

^b Cornell University   (United States)

^c JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

Bayesian experimental design; Bisection; Dynamic programming; Entropy loss; Object detection; Search; Sequential experimental design; Twenty questions

Indexed keywords

EID: 84872140026     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1331216837     Document Type: Article

References (33)

1. Ben-Or, M. and Hassidim, A. (2008). The Bayesian learner is optimal for noisy binary search (and pretty good for quantum as well). In 2008 49th Ann. IEEE Symp. Foundations of Computer Science. IEEE Computer Society Press,Washington, DC, pp. 221-230.
2. Berry, D. A. and Fristedt, B. (1985). Bandit Problems. Chapman & Hall, London.
3. Blum, J. R. (1954). Multidimensional stochastic approximation methods. Ann. Math. Statist. 25, 737-744.
4. Burnašhev, M. V. and Zigangirov, K. Š. (1974). A certain problem of interval estimation in observation control. Problemy Peredachi Informatsii 10, 51-61.
5. Castro, R. and Nowak, R. (2008). Active learning and sampling. In Foundations and Applications of Sensor Management, Springer, pp. 177-200.
6. Cover, T. M. and Thomas, J. A. (1991). Elements of Information Theory. JohnWiley, NewYork.
7. DeGroot, M. H. (1970). Optimal Statistical Decisions. McGraw Hill, NewYork.
8. Dynkin, E. B. and Yushkevich, A. A. (1979). Controlled Markov Processes. Springer, NewYork.
9. Frazier, P. I., Powell,W. B. and Dayanik, S. (2008).A knowledge-gradient policy for sequential information collection. SIAM J. Control Optimization 47, 2410-2439.
10. Geman, D. and Jedynak, B. (1996).An active testing model for tracking roads in satellite images. IEEE Trans. Pattern Anal. Machine Intelligence 18, 1-14.
11. Gittins, J. C. (1989). Multi-Armed Bandit Allocation Indices. JohnWiley, Chichester.
12. Horstein, M. (1963). Sequential decoding using noiseless feedback. IEEE Trans. Inf. Theory 9, 136-143.
13. Horstein, M. (2002). Sequential transmission using noiseless feedback. IEEE Trans. Inf. Theory 9, 136-143.
14. Karp, R.M. and Kleinberg, R. (2007). Noisy binary search and its applications. In Proc. 18th Ann. ACM-SIAM Symp. Discrete Algorithms, ACM, NewYork, pp. 881-890.
15. Kushner, H. J. and Yin, G. G. (2003). Stochastic Approximation and Recursive Algorithms and Applications, 2nd edn. Springer, NewYork.
16. Lai, T. L. and Robbins, H. (1985). Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. 6, 4-22.
17. Lampert, C. H., Blaschko, M. B. and Hofmann, T. (2009). Efficient subwindow search: a branch and bound framework for object localization. IEEE Trans. Pattern Anal. Machine Intelligence 31, 2129-2142.
18. Lowe, D. G. (2004). Distinctive image features from scale-invariant keypoints. Internat. J. Comput. Vision 60, 91-110.
19. Nowak, R. (2008). Generalized binary search. In 2008 46th Ann. Allerton Conf. Commun., Control, and Computing, pp. 568-574.
20. Nowak, R. (2009). Noisy generalized binary search. Adv. Neural Inf. Processing Systems 22, 1366-1374.
21. Pelc, A. (2002). Searching games with errors - fifty years of coping with liars. Theoret. Comput. Sci. 270, 71-109.
22. Polyak, B. T. (1990).A new method of stochastic approximation type. Automat. Remote Control 51, 937-946.
23. Robbins, H. (1952). Some aspects of the sequential design of experiments. Bull. Amer. Math. Soc. 58, 527-535.
24. Robbins, H. and Monro, S. (1951). A stochastic approximation method. Ann. Math. Satist. 22, 400-407.
25. Ruppert, D. (1988). Efficient estimators from a slowly convergent Robbins-Monro procedure. Tech. Rep. 781, School of Operations Research and Industrial Engineering, Cornell University.
26. Schapire, R. E. (1990). The strength of weak learnability. Machine Learning 5, 197-227.
27. Sznitman, R. and Jedynak, B. (2010). Active testing for face detection and localization. IEEE Trans. Pattern Anal. Machine Intelligence 32, 1914-1920.
28. Vapnik, V. N. (1995). The Nature of Statistical Learning Theory. Springer, NewYork.
29. Vedaldi, A., Gulshan, V., Varma, M. and Zisserman, A. (2009). Multiple kernels for object detection. In Proc. Internat. Conf. Computer Vision, pp. 606-613.
30. Viola, P. and Jones, M. J. (2004). Robust real-time face detection. Internat. J. Comput. Vision 57, 137-154.
31. Waeber, R., Frazier, P. I. and Henderson, S. G. (2011). A Bayesian approach to stochastic root finding. In Proc. 2011Winter Simulation Conference, eds S. Jain et al., IEEE.
32. Whittle, P. (1981). Arm-acquiring bandits. Ann. Prob. 9, 284-292.
33. Whittle, P. (1988). Restless bandits: activity allocation in a changing world. In A Celebration of Applied Probability (J. Appl. Prob. Spec. Vol. 25A), ed. J. Gani, Applied Probability Trust, Sheffield, pp. 287-298.