Difference between revisions of "Olivier Teytaud"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * People * Olivier Teytaud''' border|right|thumb|Olivier Teytaud <ref>Image from Biography in [[Chang-Shing Lee, Mei-Hui Wang...")
 
 
(12 intermediate revisions by the same user not shown)
Line 4: Line 4:
  
 
'''Olivier Teytaud''',<br/>
 
'''Olivier Teytaud''',<br/>
a French computer scientist and researcher in TAO <ref>[http://tao.lri.fr/tiki-index.php TikiWiki : Welcome to TAO Web site]</ref> , [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>[http://www.lri.fr/~teytaud/mogo.html MoGo: a software for the Game of Go]</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=  
<ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/t/Teytaud:Olivier.html dblp: Olivier Teytaud]</ref>  
+
<ref>[https://dblp.uni-trier.de/pid/53/2584.html dblp: Olivier Teytaud]</ref>  
 
==2006 ...==
 
==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.'' [http://www.lri.fr/%7Egelly/paper/riabloat.pdf pdf (draft)]
 
* [[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.'' [http://www.lri.fr/%7Egelly/paper/riabloat.pdf pdf (draft)]
Line 44: Line 44:
 
* [[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'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_8 Towards a Solution of 7x7 Go with Meta-MCTS]''. [[Advances in Computer Games 13]]
 
* [[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'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_8 Towards a Solution of 7x7 Go with Meta-MCTS]''. [[Advances in Computer Games 13]]
 
* [[David L. St-Pierre]], [[Quentin Louveaux]], [[Olivier Teytaud]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_25 Online Sparse Bandit for Card Games]''. [[Advances in Computer Games 13]]
 
* [[David L. St-Pierre]], [[Quentin Louveaux]], [[Olivier Teytaud]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_25 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''. [https://dblp.uni-trier.de/db/conf/lion/lion2011.html LION 2011], [https://hal.archives-ouvertes.fr/hal-00542673v1/document pdf]
 
'''2012'''
 
'''2012'''
 
* [[Sylvain Gelly]], [[Marc Schoenauer]], [[Michèle Sebag]], [[Olivier Teytaud]], [[Levente Kocsis]], [[David Silver]], [[Csaba Szepesvári]] ('''2012'''). ''[http://dl.acm.org/citation.cfm?id=2093548.2093574 The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions]''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3, [http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/grand-challenge.pdf pdf preprint]
 
* [[Sylvain Gelly]], [[Marc Schoenauer]], [[Michèle Sebag]], [[Olivier Teytaud]], [[Levente Kocsis]], [[David Silver]], [[Csaba Szepesvári]] ('''2012'''). ''[http://dl.acm.org/citation.cfm?id=2093548.2093574 The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions]''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3, [http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/grand-challenge.pdf pdf preprint]
Line 49: Line 50:
 
* [[Chang-Shing Lee]], [[Mei-Hui Wang]], [[Olivier Teytaud]], [[Shi-Jim Yen]] ('''2012'''). ''Human vs. Machine Go Competitions in IEEE WCCI 2012''. [[ICGA Journal#35_4|ICGA Journal, Vol. 35, No. 4]]
 
* [[Chang-Shing Lee]], [[Mei-Hui Wang]], [[Olivier Teytaud]], [[Shi-Jim Yen]] ('''2012'''). ''Human vs. Machine Go Competitions in IEEE WCCI 2012''. [[ICGA Journal#35_4|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'''). ''[https://hal.inria.fr/hal-00766190 A simple Tsumego Generator]''. [[Conferences#GPW17|GPW 2012]]
 
* [[Ping-Chiang Chou]], [[Shi-Jim Yen]], [[Cheng-Wei Chou]], [[Ching-Nung Lin]], [[Chang-Shing Lee]], [[Olivier Teytaud]], [[Hassen Doghmen]] ('''2012'''). ''[https://hal.inria.fr/hal-00766190 A simple Tsumego Generator]''. [[Conferences#GPW17|GPW 2012]]
'''2013'''
+
* [[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]], [http://www.csie.ndhu.edu.tw/csieweb/en/node/685 Excellent Paper Award], [https://hal.inria.fr/hal-00753145v2/document pdf]
* [[Cheng-Wei Chou]], [[Ping-Chiang Chou]], [[Chang-Shing Lee]], [[David L. Saint-Pierre]], [[Olivier Teytaud]], [[Mei-Hui Wang]], [[Li-Wen Wu]], [[Shi-Jim Yen]] ('''2013'''). ''Strategic Choices: Small Budgets and Simple Regret''. [[TAAI|TAAI 2012]], [http://www.csie.ndhu.edu.tw/csieweb/en/node/685 Excellent Paper Award], [https://hal.inria.fr/hal-00753145v2/document pdf]
 
 
==2015 ...==
 
==2015 ...==
 +
* [[Marie-Liesse Cauwet]], [[Olivier Teytaud]], [[Hua-Min Liang]], [[Shi-Jim Yen]], [[Hung-Hsuan Lin]], [[I-Chen Wu]], [[Tristan Cazenave]], [[Abdallah Saffidine]] ('''2015'''). ''Depth, balancing, and limits of the Elo model''. [[IEEE#CIG|IEEE Conference on Computational Intelligence and Games]] 2015, [https://arxiv.org/abs/1511.02006 arXiv:1511.02006]
 
* [[Olivier Teytaud]], [[Abdallah Saffidine]], [[Shi-Jim Yen]] ('''2015'''). ''The complexities of Go''. [[Advances in Computer Games 14]]
 
* [[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]]
 
* [[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''. [https://arxiv.org/abs/1607.08100 arXiv:1607.0810] » [[Monte-Carlo Tree Search|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''. [https://arxiv.org/abs/1706.03199 arXiv:1706.03199]
 +
* [[Jeremy Rapin]], [[Olivier Teytaud]] ('''2018'''). ''Nevergrad - A gradient-free optimization platform''. [https://github.com/facebookresearch/nevergrad 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''. [https://arxiv.org/abs/2004.14014 arXiv:2004.14014]
 +
* [[Tristan Cazenave]], [[Yen-Chi Chen]], [[Guan-Wei Chen]], [[Shi-Yu Chen]], [[Xian-Dong Chiu]], [[Julien Dehos]], [[Maria Elsa]], [[Qucheng Gong]], [[Hengyuan Hu]], [[Vasil Khalidov]], [[Cheng-Ling Li]], [[Hsin-I Lin]], [[Yu-Jin Lin]], [[Xavier Martinet]], [[Vegard Mella]], [[Jeremy Rapin]], [[Baptiste Roziere]], [[Gabriel Synnaeve]], [[Fabien Teytaud]], [[Olivier Teytaud]], [[Shi-Cheng Ye]], [[Yi-Jun Ye]], [[Shi-Jim Yen]], [[Sergey Zagoruyko]] ('''2020''').  ''Polygames: Improved zero learning''. [[ICGA Journal#42_4|ICGA Journal, Vol. 42, No. 4]], [https://arxiv.org/abs/2001.09832 arXiv:2001.09832]
 +
* [[Dennis Soemers]], [[Vegard Mella]], [[Cameron Browne]], [[Olivier Teytaud]] ('''2021'''). ''Deep learning for general game playing with Ludii and Polygames''. [[ICGA Journal#43_3|ICGA Journal, Vol. 43, No. 3]]
  
 
=External Links=  
 
=External Links=  
* [http://www.lri.fr/%7Eteytaud/ Olivier Teytaud's home page]
+
* [https://www.facebook.com/notes/olivier-teytaud/optimization-machine-learning-artificial-intelligence-games-electricity/10162959845390472/ Facebook | Olivier Teytaud]
* [http://www.lri.fr/~teytaud/cv/cv.html O.Teytaud Research Homepage - CR2 Tao(Inria) - Lri(Univ. Paris-Sud, Umr Cnrs-8623)]
 
 
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=633 Olivier Teytaud's ICGA Tournaments]
 
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=633 Olivier Teytaud's ICGA Tournaments]
 
* [http://www.computer-go.info/db/operson.php?a=Teytaud%2C+Olivier Teytaud, Olivier] from [http://www.computer-go.info/ computer-go.info]
 
* [http://www.computer-go.info/db/operson.php?a=Teytaud%2C+Olivier Teytaud, Olivier] from [http://www.computer-go.info/ computer-go.info]
* [http://videolectures.net/olivier_teytaud/ Olivier Teytaud - INRIA - The French National Institute for Research in Computer Science and Control - VideoLectures]
+
* [https://scholar.google.com/citations?user=xsCcLZ8AAAAJ&hl=en Olivier Teytaud‬ - ‪Google Scholar‬]
 +
* [https://github.com/teytaud teytaud (Teytaud) · GitHub]
  
 
=References=  
 
=References=  
 
<references />
 
<references />
 
 
'''[[People|Up one level]]'''
 
'''[[People|Up one level]]'''
 +
[[Category:Go Programmer|Teytaud]]
 +
[[Category:Havannah Programmer|Teytaud]]
 +
[[Category:Researcher|Teytaud]]

Latest revision as of 11:32, 14 March 2022

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].

Selected Publications

[3]

2006 ...

2007

2008

2009

2010 ...

2011

2012

2015 ...

2020 ...

External Links

References

Up one level