Difference between revisions of "Olivier Teytaud"

From Chessprogramming wiki
Jump to: navigation, search
Line 55: Line 55:
 
* [[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]]
 
* [[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]
  
 
=External Links=  
 
=External Links=  

Revision as of 11:29, 12 September 2019

Home * People * Olivier Teytaud

Olivier Teytaud [1]

Olivier Teytaud,
a French computer scientist and researcher in TAO [2] , 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 [3].

Selected Publications

[4]

2006 ...

2007

2008

2009

2010 ...

2011

2012

2015 ...

External Links

References

Up one level