Selecting computations: Theory and applications

Uncertainty in Artificial Intelligence - Proceedings of the 28th Conference, UAI 2012

Volumn , Issue , 2012, Pages 346-355

  Hay, Nicholas ^a   Russell, Stuart ^a   Tolpin, David ^b   Shimony, Solomon Eyal ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION PROCEDURE; DISTRIBUTION-FREE; EXPECTED IMPROVEMENTS; HEURISTIC APPROXIMATIONS; MONTE-CARLO TREE SEARCHES; SELECTION PROBLEMS; SEQUENTIAL DECISIONS; STATISTICAL FRAMEWORK;

OPTIMIZATION;

ARTIFICIAL INTELLIGENCE;

EID: 84886054445     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. J. Audibert, S. Bubeck, et al. Best arm identification in multi-armed bandits. In COLT, 2010.
2. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 2002.
3. R. Bechhofer. A single-sample multiple decision procedure for ranking means of normal populations with known variances. The Annals of Mathematical Statistics, 25(1):16-39, 1954.
4. D. Berry and B. Fristedt. Bandit problems: sequential allocation of experiments. Chapman and Hall London, 1985.
5. P. Braudi?s and J. Loup Gailly. Pachi: State of the art open source Go program. In ACG 13, 2011.
6. S. Bubeck, R. Munos, and G. Stoltz. Pure exploration in finitely-armed and continuous-armed bandits. Theor. Comput. Sci., 412(19):1832-1852, 2011.
7. G. Chaslot, S. Bakkes, I. Szita, and P. Spronck. Monte-Carlo tree search: A new framework for game AI. In AIIDE, 2008.
8. T. Dean and M. Boddy. An analysis of time-dependent planning. In AAAI-88, pages 49-54, 1988.
9. J. Doyle. Artificial intelligence and rational selfgovernment. Technical Report CMU-CS-88-124, Computer Science Department, Carnegie-Mellon University, Pittsburgh, PA, 1988.
10. M. Fehling and J. Breese. A computational model for the decision-theoretic control of problem solving under uncertainty. In Proceedings of the Fourth Workshop on Uncertainty in Artificial Intelligence, Minneapolis, MN: AAAI, 1988.
11. P. Frazier and W. Powell. Paradoxes in learning and the marginal value of information. Decision Analysis, 2010.
12. S. Gelly and D. Silver. Monte-carlo tree search and rapid action value estimation in computer go. Artificial Intelligence, 2011.
13. S. Gelly and Y. Wang. Exploration exploitation in Go: UCT for Monte-Carlo Go. Computer, 2006.
14. J. Gittins. Bandit processes and dynamic allocation indices. Journal of the Royal Statistical Society. Series B (Methodological), pages 148-177, 1979.
15. J. Gittins. Multi-armed bandit allocation indices. John Wiley &Sons, 1989.
16. I. J. Good. A five-year plan for automatic chess. In E. Dale and D. Michie, editors, Machine Intelligence 2, pages 89-118. Oliver and Boyd, 1968.
17. D. Harada. Reinforcement learning with time. In Proc. Fourteenth National Conference on Artificial Intelligence, pages 577-582. AAAI Press, 1997.
18. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):pp. 13-30, 1963. ISSN 01621459.
19. E. J. Horvitz. Reasoning about beliefs and actions under computational resource constraints. In UAI. American Association for Artificial Intelligence, July 1987.
20. Also in L. Kanal, T. Levitt, and J. Lemmer, ed., Uncertainty in Artificial Intelligence 3, Elsevier, 1988, pps. 301-324.
21. R. A. Howard. Information value theory. IEEE Transactions on Systems Science and Cybernetics, 1966.
22. L. Kocsis and C. Szepesvari. Bandit based monte-carlo planning. ECML, 2006.
23. O. Madani, D. Lizotte, and R. Greiner. Active model selection. In Proceedings of the 20th conference on Uncertainty in artificial intelligence, pages 357-365. AUAI Press, 2004.
24. J. E. Matheson. The economic value of analysis and computation. Systems Science and Cybernetics, 4: 325-332, 1968.
25. A. Maurer and M. Pontil. Empirical Bernstein bounds and sample-variance penalization. In COLT, 2009.
26. M. Puterman. Markov decision processes: Discrete stochastic dynamic programming. John Wiley &Sons, Inc., 1994.
27. S. Russell and E. Wefald. Do The Right Thing. The MIT Press, 1991a.
28. S. Russell and E. Wefald. Principles of metareasoning. Artificial Intelligence, 1991b.
29. S. J. Russell and E. H. Wefald. Decision-theoretic control of search: General theory and an application to game-playing. Technical Report UCB/CSD 88/435, Computer Science Division, University of California, Berkeley, 1988.
30. J. R. Swisher, S. H. Jacobson, and E. Yucesan. Discrete-event simulation optimization using ranking, selection, and multiple comparison procedures: A survey. ACM Transactions on Modeling and Computer Simulation, 2003.
31. D. Tolpin and S. E. Shimony. MCTS based on simple regret. In AAAI. AAAI Press, 2012a. To appear.
32. D. Tolpin and S. E. Shimony. Semimyopic measurement selection for optimization under uncertainty. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 42(2):565-579, 2012b.
33. A.Wald. Sequential tests of statistical hypotheses. Annals of Mathematical Statistics, 16:117-186, 1945.