Sylvain Gelly, Olivier Teytaud (2006). Bayesian networks : a better than frequentist approach for parametrization, and a more accurate structural complexity measure than the number of parameters. pdf (draft)
Sylvain Gelly, Jérémie Mary, Olivier Teytaud (2006). On the ultimate convergence rates for isotropic algorithms and the best choices among various forms of isotropy. PPSN, 2006, pdf
a French computer scientist and researcher in TAO [1] , INRIA Saclay-IDF, CNRS, Laboratoire de Recherche en Informatique (LRI), Paris-Sud University. His research covers planning, machine learning, dynamic and genetic programming, optimization, and operational research. Olivier Teytaud is co-author of the Havannah programs Shakti and Shakty, and co-author of the top level Go playing program Mogo, using Monte-Carlo Tree Search which uses patterns in the simulations and improvements in UCT [2][3].
Table of Contents
Selected Publications
[5] [6] [7] [8]2006 ...
- Sylvain Gelly, Olivier Teytaud, Nicolas Bredèche, Marc Schoenauer (2006). Universal Consistency and Bloat in GP. Some theoretical considerations about Genetic Programming from a Statistical Learning Theory viewpoint. pdf (draft)
- Sylvain Gelly, Olivier Teytaud (2006). Bayesian networks : a better than frequentist approach for parametrization, and a more accurate structural complexity measure than the number of parameters. pdf (draft)
- Sylvain Gelly, Jérémie Mary, Olivier Teytaud (2006). Learning for stochastic dynamic programming. pdf
- Sylvain Gelly, Jérémie Mary, Olivier Teytaud (2006). On the ultimate convergence rates for isotropic algorithms and the best choices among various forms of isotropy. PPSN, 2006, pdf
- Olivier Teytaud, Sylvain Gelly (2006). General lower bounds for evolutionary algorithms. pdf
- Sylvain Gelly, Yizao Wang, Rémi Munos, Olivier Teytaud (2006). Modification of UCT with Patterns in Monte-Carlo Go. INRIA
2007- Sylvain Gelly, Olivier Teytaud, Jérémie Mary (2007). Active learning in regression, with application to stochastic dynamic programming. ICINCO and CAP, 2007, pdf
2008- Sylvain Gelly, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Yann Kalemkarian (2008). The Parallelization of Monte-Carlo Planning - Parallelization of MC-Planning. ICINCO-ICSO 2008: 244-249, pdf, slides as pdf
- Guillaume Chaslot, Louis Chatriot, Christophe Fiter, Sylvain Gelly, Jean-Baptiste Hoock, Julien Pérez, Arpad Rimmel, Olivier Teytaud (2008). Combining expert, offline, transient and online knowledge in Monte-Carlo exploration. pdf
- Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Chang-Shing Lee, Mei-Hui Wang, Shang-Rong Tsai, Shun-Chin Hsu (2008). Human-Computer Go Revolution 2008. ICGA Journal, Vol. 31, No. 3
20092010 ...
- Jean-Baptiste Hoock, Olivier Teytaud (2010). Bandit-Based Genetic Programming. 13th European Conference on Genetic Programming (2010), pdf
- Amine Bourki, Guillaume Chaslot, Matthieu Coulm, Vincent Danjean, Hassen Doghmen, Thomas Hérault, Jean-Baptiste Hoock, Arpad Rimmel, Fabien Teytaud, Olivier Teytaud, Paul Vayssière, Ziqin Yu (2010). Scalability and Parallelization of Monte-Carlo Tree Search. CG 2010, pdf
- Arpad Rimmel, Fabien Teytaud, Olivier Teytaud (2010). Biasing Monte-Carlo Simulations through RAVE Values. CG 2010, pdf
- Romaric Gaudel, Jean-Baptiste Hoock, Julien Pérez, Nataliya Sokolovska, Olivier Teytaud (2010). A Principled Method for Exploiting Opening Books. CG 2010, pdf
- Fabien Teytaud, Olivier Teytaud (2010). On the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms. pdf
- Amine Bourki, Matthieu Coulm, Philippe Rolet, Olivier Teytaud, Paul Vayssière (2010). Parameter Tuning by Simple Regret Algorithms and Multiple Simultaneous Hypothesis Testing. pdf
- Vincent Berthier, Hassen Doghmen, Olivier Teytaud (2010). Consistency Modifications for Automatically Tuned Monte-Carlo Tree Search. pdf
- Arpad Rimmel, Olivier Teytaud, Chang-Shing Lee, Shi-Jim Yen, Mei-Hui Wang, Shang-Rong Tsai (2010). Current Frontiers in Computer Go. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 2
2011- Rémi Coulom, Philippe Rolet, Nataliya Sokolovska, Olivier Teytaud (2011). Handling Expensive Optimization with Large Noise. pdf
- Cheng-Wei Chou, Olivier Teytaud, Shi-Jim Yen (2011). Revisiting Monte-Carlo Tree Search on a Normal Form Game: NoGo. EvoApplications 2011 [9]
- Cheng-Wei Chou, Ping-Chiang Chou, Hassen Doghmen, Chang-Shing Lee, Tsan-Cheng Su, Fabien Teytaud, Olivier Teytaud, Hui-Ming Wang, Mei-Hui Wang, Li-Wen Wu, Shi-Jim Yen (2011). Towards a Solution of 7x7 Go with Meta-MCTS. Advances in Computer Games 13
- David L. St-Pierre, Quentin Louveaux, Olivier Teytaud (2011). Online Sparse Bandit for Card Games. Advances in Computer Games 13
2012- Sylvain Gelly, Marc Schoenauer, Michèle Sebag, Olivier Teytaud, Levente Kocsis, David Silver, Csaba Szepesvári (2012). The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions. Communications of the ACM, Vol. 55, No. 3, pdf preprint
- Adrien Couetoux, Olivier Teytaud, Hassen Doghmen (2012). Learning a Move-Generator for Upper Confidence Trees. ICS 2012, Hualien, Taiwan, December 2012
- Chang-Shing Lee, Mei-Hui Wang, Olivier Teytaud, Shi-Jim Yen (2012). Human vs. Machine Go Competitions in IEEE WCCI 2012. ICGA Journal, Vol. 35, No. 4
- Ping-Chiang Chou, Shi-Jim Yen, Cheng-Wei Chou, Ching-Nung Lin, Chang-Shing Lee, Olivier Teytaud, Hassen Doghmen (2012). A simple Tsumego Generator. GPW 2012
20132015 ...
External Links
Saclay - Île-de-France - MoGo leads the game! - National Institute for Research in Computer Science and Control translated by translate.google.com
References
What links here?
Up one level