default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabien Teytaud
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c40]Mariia Zameshina, Olivier Teytaud, Fabien Teytaud, Vlad Hosu, Nathanaël Carraz Rakotonirina, Laurent Najman
, Markus Wagner:
Fairness in generative modeling: do it unsupervised! GECCO Companion 2022: 320-323- [c39]Risto Trajanov, Ana Nikolikj, Gjorgjina Cenikj, Fabien Teytaud, Mathurin Videau, Olivier Teytaud, Tome Eftimov, Manuel López-Ibáñez, Carola Doerr:
Improving Nevergrad's Algorithm Selection Wizard NGOpt Through Automated Algorithm Configuration. PPSN (1) 2022: 18-31 - [i10]Risto Trajanov, Ana Nikolikj, Gjorgjina Cenikj, Fabien Teytaud, Mathurin Videau, Olivier Teytaud, Tome Eftimov, Manuel López-Ibáñez, Carola Doerr:
Improving Nevergrad's Algorithm Selection Wizard NGOpt through Automated Algorithm Configuration. CoRR abs/2209.04412 (2022) - [i9]Mariia Zameshina, Olivier Teytaud, Fabien Teytaud, Vlad Hosu, Nathanaël Carraz, Laurent Najman, Markus Wagner:
Fairness in generative modeling. CoRR abs/2210.03517 (2022) - 2021
- [j6]Amaury Dubois, Fabien Teytaud, Sébastien Vérel:
Short term soil moisture forecasts for potato crop farming: A machine learning approach. Comput. Electron. Agric. 180: 105902 (2021) - [j5]Amaury Dubois, Julien Dehos, Fabien Teytaud:
Upper confidence tree for planning restart strategies in multi-modal optimization. Soft Comput. 25(2): 1007-1015 (2021) - [c38]Jérôme Buisine, Fabien Teytaud, Samuel Delepoulle, Christophe Renaud:
Guided-Generative Network for noise detection in Monte-Carlo rendering. ICMLA 2021: 61-66 - 2020
- [j4]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, Jérémy Rapin, Baptiste Rozière, Gabriel Synnaeve, Fabien Teytaud, Olivier Teytaud, Shi-Cheng Ye, Yi-Jun Ye, Shi-Jim Yen, Sergey Zagoruyko:
Polygames: Improved zero learning. J. Int. Comput. Games Assoc. 42(4): 244-256 (2020) - [c37]Baptiste Rozière, Fabien Teytaud, Vlad Hosu, Hanhe Lin, Jérémy Rapin, Mariia Zameshina, Olivier Teytaud:
EvolGAN: Evolutionary Generative Adversarial Networks. ACCV (4) 2020: 679-694 - [c36]Jialin Liu, Antoine Moreau, Mike Preuss, Jérémy Rapin, Baptiste Rozière, Fabien Teytaud, Olivier Teytaud:
Versatile black-box optimization. GECCO 2020: 620-628 - [c35]Marie-Liesse Cauwet, Camille Couprie, Julien Dehos, Pauline Luc, Jérémy Rapin, Morgane Rivière, Fabien Teytaud, Olivier Teytaud, Nicolas Usunier:
Fully Parallel Hyperparameter Search: Reshaped Space-Filling. ICML 2020: 1338-1348 - [i8]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, Jérémy Rapin, Baptiste Rozière, Gabriel Synnaeve, Fabien Teytaud, Olivier Teytaud, Shi-Cheng Ye, Yi-Jun Ye, Shi-Jim Yen, Sergey Zagoruyko:
Polygames: Improved Zero Learning. CoRR abs/2001.09832 (2020) - [i7]Jialin Liu, Antoine Moreau, Mike Preuss, Baptiste Rozière, Jérémy Rapin, Fabien Teytaud, Olivier Teytaud:
Versatile Black-Box Optimization. CoRR abs/2004.14014 (2020) - [i6]Baptiste Rozière, Fabien Teytaud, Vlad Hosu, Hanhe Lin, Jérémy Rapin, Mariia Zameshina, Olivier Teytaud:
EvolGAN: Evolutionary Generative Adversarial Networks. CoRR abs/2009.13311 (2020)
2010 – 2019
- 2019
- [c34]Amaury Dubois, Fabien Teytaud, Éric Ramat, Sébastien Vérel:
Automatic Calibration of a Farm Irrigation Model: A Multi-Modal Optimization Approach. EA 2019: 192-204 - [i5]Eric Benhamou, David Saltiel, Sébastien Vérel, Fabien Teytaud:
BCMA-ES: A Bayesian approach to CMA-ES. CoRR abs/1904.01401 (2019) - [i4]Marie-Liesse Cauwet, Camille Couprie, Julien Dehos, Pauline Luc, Jérémy Rapin, Morgane Rivière, Fabien Teytaud, Olivier Teytaud:
Fully Parallel Hyperparameter Search: Reshaped Space-Filling. CoRR abs/1910.08406 (2019) - 2018
- [c33]Ahmad Mazyad, Fabien Teytaud, Cyril Fonlupt:
Generating term weighting schemes through genetic programming. GECCO (Companion) 2018: 268-269 - [c32]Amaury Dubois, Julien Dehos, Fabien Teytaud:
Improving Multi-modal Optimization Restart Strategy Through Multi-armed Bandit. ICMLA 2018: 338-343 - [c31]Ahmad Mazyad, Fabien Teytaud, Cyril Fonlupt:
Information Gain Based Term Weighting Method for Multi-label Text Classification Task. IntelliSys (1) 2018: 607-615 - [c30]Ahmad Mazyad, Fabien Teytaud, Cyril Fonlupt:
Generating Term Weighting Schemes Through Genetic Programming. LOD 2018: 92-103 - 2017
- [c29]Ahmad Mazyad, Fabien Teytaud, Cyril Fonlupt:
A Comparative Study on Term Weighting Schemes for Text Classification. MOD 2017: 100-108 - [c28]Florian Leprêtre, Fabien Teytaud, Julien Dehos:
Multi-Armed Bandit for Stratified Sampling: Application to Numerical Integration. TAAI 2017: 190-195 - 2016
- [c27]Joris Duguépéroux, Ahmad Mazyad, Fabien Teytaud, Julien Dehos:
Pruning Playouts in Monte-Carlo Tree Search for the Game of Havannah. Computers and Games 2016: 47-57 - [c26]Tristan Cazenave, Jialin Liu, Fabien Teytaud, Olivier Teytaud:
Learning opening books in partially observable games: Using random seeds in Phantom Go. CIG 2016: 1-7 - [c25]Fabien Teytaud, Olivier Teytaud:
QR Mutations Improve Many Evolution Strategies: A Lot On Highly Multimodal Problems. GECCO (Companion) 2016: 35-36 - [i3]Tristan Cazenave, Jialin Liu, Fabien Teytaud, Olivier Teytaud:
Learning opening books in partially observable games: using random seeds in Phantom Go. CoRR abs/1607.02431 (2016) - [i2]David Lupien St-Pierre, Jean-Baptiste Hoock, Jialin Liu, Fabien Teytaud, Olivier Teytaud:
Automatically Reinforcing a Game AI. CoRR abs/1607.08100 (2016) - 2015
- [j3]Fabien Teytaud, Julien Dehos:
On the Tactical and Strategic Behaviour of MTCS when Biasing Random Simulations. J. Int. Comput. Games Assoc. 38(2): 67-80 (2015) - [c24]Shih-Yuan Chiu, Ching-Nung Lin, Jialin Liu, Tsan-Cheng Su, Fabien Teytaud, Olivier Teytaud, Shi-Jim Yen:
Differential evolution for strongly noisy optimization: Use 1: 01n resamplings at iteration n and Reach the -1/2 slope. CEC 2015: 338-345 - [c23]Marie-Liesse Cauwet, Olivier Teytaud, Shih-Yuan Chiu, Kuo-Min Lin, Shi-Jim Yen, David Lupien St-Pierre, Fabien Teytaud:
Parallel Evolutionary Algorithms Performing Pairwise Comparisons. FOGA 2015: 99-113 - 2014
- [c22]Denis Robilliard, Cyril Fonlupt, Fabien Teytaud:
Monte-Carlo Tree Search for the Game of "7 Wonders". CGW@ECAI 2014: 64-77 - [c21]Arpad Rimmel, Fabien Teytaud:
A Survey of Meta-heuristics Used for Computing Maximin Latin Hypercube. EvoCOP 2014: 25-36 - [p1]Fabien Teytaud, Olivier Teytaud:
Convergence Rates of Evolutionary Algorithms and Parallel Evolutionary Algorithms. Theory and Principled Methods for the Design of Metaheuristics 2014: 25-39 - [i1]Fabien Teytaud, Cyril Fonlupt:
A Critical Reassessment of Evolutionary Algorithms on the cryptanalysis of the simplified data encryption standard algorithm. CoRR abs/1407.1993 (2014) - 2013
- [c20]Stefan Edelkamp, Max Gath, Tristan Cazenave, Fabien Teytaud:
Algorithm and knowledge engineering for the TSPTW problem. CISched 2013: 44-51 - [c19]Shalom Eliahou, Cyril Fonlupt, Jean Fromentin, Virginie Marion-Poty, Denis Robilliard, Fabien Teytaud:
Investigating Monte-Carlo Methods on the Weak Schur Problem. EvoCOP 2013: 191-201 - 2012
- [c18]Tristan Cazenave, Fabien Teytaud:
Application of the Nested Rollout Policy Adaptation Algorithm to the Traveling Salesman Problem with Time Windows. LION 2012: 42-54 - 2011
- [b1]Fabien Teytaud:
Introduction of statistics in optimization. (Introduction de statistiques en optimisation). University of Paris-Sud, Orsay, France, 2011 - [j2]Shi-Jim Yen, Shih-Yuan Chiu, Cheng-Wei Chou, Chang-Shing Lee, Hassen Doghmen, Fabien Teytaud, Olivier Teytaud:
Human vs. Computer Go Competition in FUZZ-IEEE 2011. J. Int. Comput. Games Assoc. 34(4): 243-247 (2011) - [c17]Cheng-Wei Chou, Ping-Chiang Chou, Hassen Doghmen, Chang-Shing Lee, Tsan-Cheng Su, Fabien Teytaud, Olivier Teytaud, Hui-Min Wang, Mei-Hui Wang, Li-Wen Wu, Shi-Jim Yen:
Towards a Solution of 7x7 Go with Meta-MCTS. ACG 2011: 84-95 - [c16]Marc Schoenauer, Fabien Teytaud, Olivier Teytaud:
A Rigorous Runtime Analysis for Quasi-Random Restarts and Decreasing Stepsize. Artificial Evolution 2011: 37-48 - [c15]Ping-Chiang Chou, Hassen Doghmen, Chang-Shing Lee, Fabien Teytaud, Olivier Teytaud, Hui-Min Wang, Mei-Hui Wang, Li-Wen Wu, Shi-Jim Yen:
Computational and human intelligence in blind Go. CIG 2011: 235-242 - [c14]Fabien Teytaud, Olivier Teytaud:
Lemmas on partial observation, with application to phantom games. CIG 2011: 243-249 - [c13]Bernard Helmstetter, Chang-Shing Lee, Fabien Teytaud, Olivier Teytaud, Mei-Hui Wang, Shi-Jim Yen:
Random positions in Go. CIG 2011: 250-257 - [c12]Arpad Rimmel, Fabien Teytaud, Tristan Cazenave:
Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows. EvoApplications (2) 2011: 501-510 - [c11]Marc Schoenauer, Fabien Teytaud, Olivier Teytaud:
Simple tools for multimodal optimization. GECCO (Companion) 2011: 267-268 - 2010
- [j1]Jean-Baptiste Hoock, Chang-Shing Lee, Arpad Rimmel, Fabien Teytaud, Mei-Hui Wang, Olivier Teytaud:
Intelligent Agents for the Game of Go. IEEE Comput. Intell. Mag. 5(4): 28-42 (2010) - [c10]Amine Bourki, Guillaume Chaslot, Matthieu Coulm, Vincent Danjean, Hassen Doghmen, Jean-Baptiste Hoock, Thomas Hérault, Arpad Rimmel, Fabien Teytaud, Olivier Teytaud, Paul Vayssière, Ziqin Yut:
Scalability and Parallelization of Monte-Carlo Tree Search. Computers and Games 2010: 48-58 - [c9]Arpad Rimmel, Fabien Teytaud, Olivier Teytaud:
Biasing Monte-Carlo Simulations through RAVE Values. Computers and Games 2010: 59-68 - [c8]Fabien Teytaud, Olivier Teytaud:
On the huge benefit of decisive moves in Monte-Carlo Tree Search algorithms. CIG 2010: 359-364 - [c7]Arpad Rimmel, Fabien Teytaud:
Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search. EvoApplications (1) 2010: 201-210 - [c6]Fabien Teytaud:
A New Selection Ratio for Large Population Sizes. EvoApplications (1) 2010: 452-460 - [c5]Fabien Teytaud, Olivier Teytaud:
Log(lambda) Modifications for Optimal Parallelism. PPSN (1) 2010: 254-263
2000 – 2009
- 2009
- [c4]Fabien Teytaud, Olivier Teytaud:
Creating an Upper-Confidence-Tree Program for Havannah. ACG 2009: 65-74 - [c3]Guillaume Chaslot, Jean-Baptiste Hoock, Fabien Teytaud, Olivier Teytaud:
On the huge benefit of quasi-random mutations for multimodal optimization with application to grid-based tuning of neurocontrollers. ESANN 2009 - [c2]Fabien Teytaud, Olivier Teytaud:
On the Parallel Speed-Up of Estimation of Multivariate Normal Algorithm and Evolution Strategies. EvoWorkshops 2009: 655-664 - [c1]Fabien Teytaud, Olivier Teytaud:
Why one must use reweighting in estimation of distribution algorithms. GECCO 2009: 453-460
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
