Difference between revisions of "Olivier Teytaud"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 4: | Line 4: | ||
'''Olivier Teytaud''',<br/> | '''Olivier Teytaud''',<br/> | ||
| − | a French computer scientist and researcher at [https://en.wikipedia.org/wiki/Facebook Facebook], previously affiliated with [https://en.wikipedia.org/wiki/National_Institute_for_Research_in_Computer_Science_and_Control INRIA] [https://en.wikipedia.org/wiki/Saclay Saclay]-[https://en.wikipedia.org/wiki/%C3%8Ele-de-France_%28region%29 IDF], [https://en.wikipedia.org/wiki/French_National_Centre_for_Scientific_Research CNRS], [http://fr.wikipedia.org/wiki/Laboratoire_de_recherche_en_informatique Laboratoire de Recherche en Informatique (LRI)], [[University of Paris#11|Paris-Sud University]]. His research covers [[Planning|planning]], [[Learning|machine learning]], [[Dynamic Programming|dynamic]] and [[Genetic Programming|genetic programming]], optimization, and [https://en.wikipedia.org/wiki/Operations_research operational research]. Olivier Teytaud is co-author of the [[Havannah]] programs [https://www.game-ai-forum.org/icga-tournaments/program.php?id=600 Shakti] and [https://www.game-ai-forum.org/icga-tournaments/program.php?id=626 Shakty], and co-author of the [[Go]] playing program [https://www.game-ai-forum.org/icga-tournaments/program.php?id=515 Mogo], using [[Monte-Carlo Tree Search]] which uses patterns in the simulations and improvements in [[UCT]] <ref>[ | + | a French computer scientist and researcher at [https://en.wikipedia.org/wiki/Facebook Facebook], previously affiliated with [https://en.wikipedia.org/wiki/National_Institute_for_Research_in_Computer_Science_and_Control INRIA] [https://en.wikipedia.org/wiki/Saclay Saclay]-[https://en.wikipedia.org/wiki/%C3%8Ele-de-France_%28region%29 IDF], [https://en.wikipedia.org/wiki/French_National_Centre_for_Scientific_Research CNRS], [http://fr.wikipedia.org/wiki/Laboratoire_de_recherche_en_informatique Laboratoire de Recherche en Informatique (LRI)], [[University of Paris#11|Paris-Sud University]]. His research covers [[Planning|planning]], [[Learning|machine learning]], [[Dynamic Programming|dynamic]] and [[Genetic Programming|genetic programming]], optimization, and [https://en.wikipedia.org/wiki/Operations_research operational research]. Olivier Teytaud is co-author of the [[Havannah]] programs [https://www.game-ai-forum.org/icga-tournaments/program.php?id=600 Shakti] and [https://www.game-ai-forum.org/icga-tournaments/program.php?id=626 Shakty], and co-author of the [[Go]] playing program [https://www.game-ai-forum.org/icga-tournaments/program.php?id=515 Mogo], using [[Monte-Carlo Tree Search]] which uses patterns in the simulations and improvements in [[UCT]] <ref>[https://senseis.xmp.net/?MoGo MoGo at Sensei's Library]</ref>. |
=Selected Publications= | =Selected Publications= | ||
Revision as of 21:01, 7 January 2021
Home * People * Olivier Teytaud
Olivier Teytaud [1]
Olivier Teytaud,
a French computer scientist and researcher at Facebook, previously affiliated with 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 Go playing program Mogo, using Monte-Carlo Tree Search which uses patterns in the simulations and improvements in UCT [2].
Contents
Selected Publications
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
2009
- Nur Merve Amil, Nicolas Bredèche, Christian Gagné, Sylvain Gelly, Marc Schoenauer, Olivier Teytaud (2009). A Statistical Learning Perspective of Genetic Programming. EuroGP 2009, pdf
- Guillaume Chaslot, Christophe Fiter, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud (2009). Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search. Advances in Computer Games 12, pdf
- Fabien Teytaud, Olivier Teytaud (2009). Creating an Upper-Confidence-Tree program for Havannah. Advances in Computer Games 12, pdf
- Chang-Shing Lee, Mei-Hui Wang, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Shang-Rong Tsai, Shun-Chin Hsu, Tzung-Pei Hong (2009). The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments. pdf
- Chang-Shing Lee, Mei-Hui Wang, Tzung-Pei Hong, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Yau-Hwang Kuo (2009). A Novel Ontology for Computer Go Knowledge Management. IEEE FUZZ (2009), pdf
- Pierre Audouard, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Julien Pérez, Olivier Teytaud (2009). Grid co-evolution for adaptive simulations; application to the building of opening books in the game of Go. pdf
- Guillaume Chaslot, Jean-Baptiste Hoock, Julien Pérez, Arpad Rimmel, Olivier Teytaud, Mark Winands (2009). Meta Monte-Carlo Tree Search for Automatic Opening Book Generation. pdf
- Vincent Berthier, Amine Bourki, Matthieu Coulm, Guillaume Chaslot, Christophe Fiter, Sylvain Gelly, Jean-Baptiste Hoock, Rémi Munos, Julien Pérez, Arpad Rimmel, Philippe Rolet, Olivier Teytaud, Paul Vayssière, Yizao Wang, Ziqin Yu (et al.) (2009). Computer-Go is not only for Go. Korea, August 2009 slides as pdf
2010 ...
- 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 [4]
- 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
- Adrien Couëtoux, Jean-Baptiste Hoock, Nataliya Sokolovska, Olivier Teytaud, Nicolas Bonnard (2011). Continuous Upper Confidence Trees. LION 2011, pdf
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
- Cheng-Wei Chou, Ping-Chiang Chou, Chang-Shing Lee, David L. Saint-Pierre, Olivier Teytaud, Mei-Hui Wang, Li-Wen Wu, Shi-Jim Yen (2012). Strategic Choices: Small Budgets and Simple Regret. TAAI 2012, Excellent Paper Award, pdf
2015 ...
- Olivier Teytaud, Abdallah Saffidine, Shi-Jim Yen (2015). The complexities of Go. Advances in Computer Games 14
- Jialin Liu, Olivier Teytaud, Tristan Cazenave (2016). Fast seed-learning algorithms for games. CG 2016
- David L. St-Pierre, Jean-Baptiste Hoock, Jialin Liu, Fabien Teytaud, Olivier Teytaud (2016). Automatically Reinforcing a Game AI. arXiv:1607.0810 » MCTS
- Olivier Bousquet, Sylvain Gelly, Karol Kurach, Marc Schoenauer, Michèle Sebag, Olivier Teytaud, Damien Vincent (2017). Toward Optimal Run Racing: Application to Deep Learning Calibration. arXiv:1706.03199
- Jeremy Rapin, Olivier Teytaud (2018). Nevergrad - A gradient-free optimization platform. GitHub - facebookresearch/nevergrad: A Python toolbox for performing gradient-free optimization
2020 ...
- Jialin Liu, Antoine Moreau, Mike Preuss, Baptiste Roziere, Jeremy Rapin, Fabien Teytaud, Olivier Teytaud (2020). Versatile Black-Box Optimization. arXiv:2004.14014
External Links
- Facebook | Olivier Teytaud
- Olivier Teytaud's ICGA Tournaments
- Teytaud, Olivier from computer-go.info
- Olivier Teytaud - Google Scholar
- teytaud (Teytaud) · GitHub
References
- ↑ Image from Biography in Chang-Shing Lee, Mei-Hui Wang, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Shang-Rong Tsai, Shun-Chin Hsu, Tzung-Pei Hong (2009). The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments. pdf
- ↑ MoGo at Sensei's Library
- ↑ dblp: Olivier Teytaud
- ↑ NoGo (ICGA Tournaments)
