no code implementations • 19 Jul 2021 • Konstantinos Kamnitsas, Stefan Winzeck, Evgenios N. Kornaropoulos, Daniel Whitehouse, Cameron Englman, Poe Phyu, Norman Pao, David K. Menon, Daniel Rueckert, Tilak Das, Virginia F. J. Newcombe, Ben Glocker
It focuses on the quality of predictions made on the unlabeled data of interest when they are included for optimization during training, rather than improving generalization.
1 code implementation • IEEE Transactions on Computational Intelligence and AI in Games 2012 • Cameron B. Browne, Edward Powley, Daniel Whitehouse, Simon M. Lucas, Peter I. Cowling, Philipp Rohlfshagen, Stephen Tavener, Diego Perez, Spyridon Samothrakis, Simon Colton
Monte Carlo Tree Search (MCTS) is a recently proposed search method that combines the precision of tree search with the generality of random sampling.