Continuous Upper Confidence Trees
暂无分享,去创建一个
Nataliya Sokolovska | Olivier Teytaud | Jean-Baptiste Hoock | Adrien Couëtoux | Nicolas Bonnard | O. Teytaud | Jean-Baptiste Hoock | Adrien Couëtoux | Nataliya Sokolovska | Nicolas Bonnard
[1] Peter Auer,et al. Using Confidence Bounds for Exploitation-Exploration Trade-offs , 2003, J. Mach. Learn. Res..
[2] Rémi Coulom,et al. Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search , 2006, Computers and Games.
[3] Csaba Szepesvári,et al. Bandit Based Monte-Carlo Planning , 2006, ECML.
[4] Neil D. Lawrence,et al. Missing Data in Kernel PCA , 2006, ECML.
[5] David Silver,et al. Combining online and offline knowledge in UCT , 2007, ICML '07.
[6] Rémi Coulom,et al. Computing "Elo Ratings" of Move Patterns in the Game of Go , 2007, J. Int. Comput. Games Assoc..
[7] Sylvain Gelly,et al. Modifications of UCT and sequence-like simulations for Monte-Carlo Go , 2007, 2007 IEEE Symposium on Computational Intelligence and Games.
[8] Rémi Munos,et al. Algorithms for Infinitely Many-Armed Bandits , 2008, NIPS.
[9] Yngvi Björnsson,et al. Simulation-Based Approach to General Game Playing , 2008, AAAI.
[10] H. Jaap van den Herik,et al. Progressive Strategies for Monte-Carlo Tree Search , 2008 .
[11] Tzung-Pei Hong,et al. The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments , 2009, IEEE Transactions on Computational Intelligence and AI in Games.
[12] Martin Müller,et al. Monte-Carlo Exploration for Deterministic Planning , 2009, IJCAI.
[13] Michèle Sebag,et al. Optimal robust expensive optimization is tractable , 2009, GECCO.
[14] T. L. Lai Andherbertrobbins. Asymptotically Efficient Adaptive Allocation Rules , 2022 .