Bayesian inference in Monte-Carlo Tree Search

Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence, UAI 2010

Volumn , Issue , 2010, Pages 580-588

  Tesauro, Gerald ^a   Rajan, V T ^a   Segal, Richard ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BAYESIAN NETWORKS; INFERENCE ENGINES; TREES (MATHEMATICS);

BAYESIAN APPROACHES; BAYESIAN FRAMEWORKS; BAYESIAN INFERENCE; DISTRIBUTION-FREE; GAUSSIAN APPROXIMATION METHOD; MONTE CARLO TREE SEARCH (MCTS); MONTE-CARLO TREE SEARCHES; SIMULATION TRIALS;

MONTE CARLO METHODS;

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

References (17)

1. J.-Y. Audibert, R. Munos, and Cs. Szepesvari. Tuning bandit algorithms in stochastic environments. In Proc. ALT-07, 2007.
2. P. Auer, N. Cesa-Binachi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47:235-256, 2002. (Pubitemid 34126111)
3. E. B. Baum and W. D. Smith. A Bayesian approach to relevance in game playing. Artificial Intelligence, 97:195-242, 1997. (Pubitemid 127401105)
4. B. Bouzy. Associating shallow and selective global tree search with Monte Carlo for 9x9 Go. In Proc. of CG-04, pages 67-80, 2004.
5. S. Bubeck, R. Munos, G. Stoltz, and Cs. Szepesvari. Online optimization in x-armed bandits. In Proc. of NIPS-08, 2008.
6. G. Chaslot et al. Monte-carlo tree search in production management problems. In Proc. of 18th BeNeLux Conf. on AI, pages 91-98, 2006.
7. C. E. Clarke. The greatest of a finite set of random variables. Oper. Res., 9:145-162, 1961.
8. P. Coquelin and R. Munos. Bandit algorithms for tree search. In Proc. of UAI-07, 2007.
9. R. Coulom. Efficient selectivity and backup operators in Monte-Carlo tree search. In 5th Intl. Conf. on Computer and Games, pages 72-83, 2006.
10. H. Finnsson and Y. Björnsson. Simulation-based approach to general game playing. In Proc. of AAAI- 2008, pages 259-264, 2008.
11. S. Gelly, Y. Wang, R. Munos, and O. Teytaud. Modification of UCT with patterns in Monte-Carlo Go. Technical Report 6062, INRIA, 2006.
12. L. P. Kaelbling. Learning in Embedded Systems. MIT Press, 1993.
13. L. Kocsis and C. Szepesvari. Bandit based Monte- Carlo planning. In 15th European Conference on Machine Learning, pages 282-293, 2006. (Pubitemid 44618839)
14. G. Kronberger and R. Braune. Bandit-based monte-carlo planning for the single-machine total weighted tardiness scheduling problem. In Proc. of EUROCAST-07, 2007.
15. S. Russell and E. Wefald. Do the Right Thing. MIT Press, 1991.
16. M. P. Schadd et al. Single-player monte-carlo tree search. In Proc. of 6th Intl. Conf. on Computers and Games, 2008.
17. D. Sinha, H. Zhou, and N. V. Shenoy. Advances in computation of the maximum of a set of gaussian random variables. IEEE TCAD, 26:1522-1533, 2007. (Pubitemid 47117381)