Olivier Teytaud

Orcid: 0000-0001-5570-5209

Affiliations:
  • Meta, France


According to our database1, Olivier Teytaud authored at least 183 papers between 2000 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
PrivacyGAN: robust generative image privacy.
CoRR, 2023

Diverse Diffusion: Enhancing Image Diversity in Text-to-Image Generation.
CoRR, 2023

Optimizing with Low Budgets: a Comparison on the Black-box Optimization Benchmarking Suite and OpenAI Gym.
CoRR, 2023

Interactive Latent Diffusion Model.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

2022
Black-Box Optimization Revisited: Improving Algorithm Selection Wizards Through Massive Benchmarking.
IEEE Trans. Evol. Comput., 2022

Fairness in generative modeling.
CoRR, 2022

Improving Nevergrad's Algorithm Selection Wizard NGOpt Through Automated Algorithm Configuration.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Fairness in generative modeling: do it unsupervised!
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

Multi-objective Genetic Programming for Explainable Reinforcement Learning.
Proceedings of the Genetic Programming - 25th European Conference, 2022

CompilerGym: Robust, Performant Compiler Optimization Environments for AI Research.
Proceedings of the IEEE/ACM International Symposium on Code Generation and Optimization, 2022

2021
Inspirational Adversarial Image Generation.
IEEE Trans. Image Process., 2021

Seed Optimization Framework on Draughts.
J. Inf. Sci. Eng., 2021

Deep learning for general game playing with Ludii and Polygames.
J. Int. Comput. Games Assoc., 2021

Transfer of Fully Convolutional Policy-Value Networks Between Games and Game Variants.
CoRR, 2021

Asymptotic convergence rates for averaging strategies.
Proceedings of the FOGA '21: Foundations of Genetic Algorithms XVI, 2021

2020
Polygames: Improved zero learning.
J. Int. Comput. Games Assoc., 2020

Proving μ>1.
CoRR, 2020

Variance Reduction for Better Sampling in Continuous Domains.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

On Averaging the Best Samples in Evolutionary Computation.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

Adversarial Attacks on Linear Contextual Bandits.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Tarsier: Evolving Noise Injection in Super-Resolution GANs.
Proceedings of the 25th International Conference on Pattern Recognition, 2020

Fully Parallel Hyperparameter Search: Reshaped Space-Filling.
Proceedings of the 37th International Conference on Machine Learning, 2020

Evolutionary super-resolution.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Open source evolutionary structured optimization.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Population control meets doob's martingale theorems: the noise-free multimodal case.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Versatile black-box optimization.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

EvolGAN: Evolutionary Generative Adversarial Networks.
Proceedings of the Computer Vision - ACCV 2020 - 15th Asian Conference on Computer Vision, Kyoto, Japan, November 30, 2020

2019
Fully Parallel Hyperparameter Search: Reshaped Space-Filling.
CoRR, 2019

Yet another but more efficient black-box adversarial attack: tiling and evolution strategies.
CoRR, 2019

Inspirational Adversarial Image Generation.
CoRR, 2019

Efficient Decision Making under Uncertainty in a Power System Investment Problem.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2019

A Simple Yet Effective Resampling Rule in Noisy Evolutionary Optimization.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2019

Exploring the MLDA benchmark on the nevergrad platform.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Openly revisiting derivative-free optimization.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Consistent population control: generate plenty of points, but with a bit of resampling.
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

2018
PSO-Based Fuzzy Markup Language for Student Learning Performance Evaluation and Educational Application.
IEEE Trans. Fuzzy Syst., 2018

Exact Distributed Training: Random Forest with Billions of Examples.
CoRR, 2018

Surprising Strategies Obtained by Stochastic Optimization in Partially Observable Games.
Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

2017
Le bridge, nouveau défi de l'intelligence artificielle ?
Rev. d'Intelligence Artif., 2017

Better Text Understanding Through Image-To-Text Transfer.
CoRR, 2017

Critical Hyper-Parameters: No Random, No Cry.
CoRR, 2017

Toward Optimal Run Racing: Application to Deep Learning Calibration.
CoRR, 2017

Boosting a Bridge Artificial Intelligence.
Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

2016
Simple and cumulative regret for continuous noisy optimization.
Theor. Comput. Sci., 2016

Automatically Reinforcing a Game AI.
CoRR, 2016

Scenario-based decision-making for power systems investment planning.
CoRR, 2016

Algorithm portfolios for noisy optimization.
Ann. Math. Artif. Intell., 2016

Multivariate bias reduction in capacity expansion planning.
Proceedings of the Power Systems Computation Conference, 2016

QR Mutations Improve Many Evolution Strategies: A Lot On Highly Multimodal Problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2016

Analysis of Different Types of Regret in Continuous Noisy Optimization.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Noisy Optimization: Fast Convergence Rates with Comparison-Based Algorithms.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Learning opening books in partially observable games: Using random seeds in Phantom Go.
Proceedings of the IEEE Conference on Computational Intelligence and Games, 2016

Fast Seed-Learning Algorithms for Games.
Proceedings of the Computers and Games - 9th International Conference, 2016

2015
T2FS-Based Adaptive Linguistic Assessment System for Semantic Analysis and Human Performance Evaluation on Game of Go.
IEEE Trans. Fuzzy Syst., 2015

Analysis of runtime of optimization algorithms for noisy functions over discrete codomains.
Theor. Comput. Sci., 2015

Criteria and Convergence Rates in Noisy Optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Variance Reduction in Population-Based Optimization: Application to Unit Commitment.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Item response theory with fuzzy markup language for parameter estimation and validation.
Proceedings of the 2015 IEEE International Conference on Fuzzy Systems, 2015

Evolution Strategies with Additive Noise: A Convergence Rate Lower Bound.
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17, 2015

Parallel Evolutionary Algorithms Performing Pairwise Comparisons.
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17, 2015

The rectangular seeds of Domineering.
Proceedings of the 2015 IEEE Conference on Computational Intelligence and Games, 2015

Depth, balancing, and limits of the Elo model.
Proceedings of the 2015 IEEE Conference on Computational Intelligence and Games, 2015

Nash reweighting of Monte Carlo simulations: Tsumego.
Proceedings of the IEEE Congress on Evolutionary Computation, 2015

Differential evolution for strongly noisy optimization: Use 1: 01<sup>n</sup> resamplings at iteration n and Reach the -1/2 slope.
Proceedings of the IEEE Congress on Evolutionary Computation, 2015

Quasi-random Numbers Improve the CMA-ES on the BBOB Testbed.
Proceedings of the Artificial Evolution, 2015

Variance Reduction in Population-Based Optimization: Application to Unit Commitment.
Proceedings of the Artificial Evolution, 2015

On the Codimension of the Set of Optima: Large Scale Optimisation with Few Relevant Variables.
Proceedings of the Artificial Evolution, 2015

Go Complexities.
Proceedings of the Advances in Computer Games - 14th International Conference, 2015

2014
Designing an Optimal Search Algorithm with Respect to Prior Information.
Proceedings of the Theory and Principled Methods for the Design of Metaheuristics, 2014

Convergence Rates of Evolutionary Algorithms and Parallel Evolutionary Algorithms.
Proceedings of the Theory and Principled Methods for the Design of Metaheuristics, 2014

Strategic Choices in Optimization.
J. Inf. Sci. Eng., 2014

Exploration vs Exploitation vs Safety: Risk-averse Multi-Armed Bandits.
CoRR, 2014

Algorithm Portfolios for Noisy Optimization: Compare Solvers Early.
Proceedings of the Learning and Intelligent Optimization, 2014

A mathematically derived number of resamplings for noisy optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Sharing Information in Adversarial Bandit.
Proceedings of the Applications of Evolutionary Computation - 17th European Conference, 2014

Meta Online Learning: Experiments on a Unit Commitment Problem.
Proceedings of the 22th European Symposium on Artificial Neural Networks, 2014

Direct Model-Predictive Control.
Proceedings of the 22th European Symposium on Artificial Neural Networks, 2014

The Nash and the bandit approaches for adversarial portfolios.
Proceedings of the 2014 IEEE Conference on Computational Intelligence and Games, 2014

Sparse binary zero-sum games.
Proceedings of the Sixth Asian Conference on Machine Learning, 2014

2013
Continuous Upper Confidence Trees with Polynomial Exploration - Consistency.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013

Noisy optimization convergence rates.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

T2FML-based adaptive assessment system for computer game of Go.
Proceedings of the FUZZ-IEEE 2013, 2013

Noisy optimization complexity under locality assumption.
Proceedings of the Foundations of Genetic Algorithms XII, 2013

Fuzzy Ontologies for the Game of Go.
Proceedings of the On Fuzziness - A Homage to Lotfi A. Zadeh - Volume 1, 2013

Log-log Convergence for Noisy Optimization.
Proceedings of the Artificial Evolution, 2013

Linear Convergence of Evolution Strategies with Derandomized Sampling Beyond Quasi-Convex Functions.
Proceedings of the Artificial Evolution, 2013

Exploration vs Exploitation vs Safety: Risk-Aware Multi-Armed Bandits.
Proceedings of the Asian Conference on Machine Learning, 2013

2012
Evolutionary optimization of low-discrepancy sequences.
ACM Trans. Model. Comput. Simul., 2012

Genetic fuzzy markup language for game of NoGo.
Knowl. Based Syst., 2012

The Frontier of Decidability in Partially Observable Recursive Games.
Int. J. Found. Comput. Sci., 2012

Human vs. Machine Go Competition in IEEE WCCCI 2012.
J. Int. Comput. Games Assoc., 2012

Computational Intelligence Meets Game of Go @ IEEE WCCI 2012 [Society Briefs].
IEEE Comput. Intell. Mag., 2012

The grand challenge of computer Go: Monte Carlo tree search and extensions.
Commun. ACM, 2012

Strategic Choices: Small Budgets and Simple Regret.
Proceedings of the Conference on Technologies and Applications of Artificial Intelligence, 2012

Upper Confidence Tree-Based Consistent Reactive Planning Application to MineSweeper.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

Improving the Exploration in Upper Confidence Trees.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

2011
Continuous RAVE.
Proceedings of the 3rd Asian Conference on Machine Learning, 2011

The IEEE SSCI 2011 Human vs. Computer Go Competition.
J. Int. Comput. Games Assoc., 2011

Human vs. Computer Go Competition in FUZZ-IEEE 2011.
J. Int. Comput. Games Assoc., 2011

Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns.
Algorithmica, 2011

Continuous Upper Confidence Trees.
Proceedings of the Learning and Intelligent Optimization - 5th International Conference, 2011

Intelligent agents for games and computer Go.
Proceedings of the 2011 IEEE Symposium on Intelligent Agent, 2011

Q-Learning with Double Progressive Widening: Application to Robotics.
Proceedings of the Neural Information Processing - 18th International Conference, 2011

Comparison-based complexity of multiobjective optimization.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Simple tools for multimodal optimization.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Handling expensive optimization with large noise.
Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

Upper Confidence Trees with Short Term Partial Information.
Proceedings of the Applications of Evolutionary Computation, 2011

Revisiting Monte-Carlo Tree Search on a Normal Form Game: NoGo.
Proceedings of the Applications of Evolutionary Computation, 2011

Lemmas on partial observation, with application to phantom games.
Proceedings of the 2011 IEEE Conference on Computational Intelligence and Games, 2011

Random positions in Go.
Proceedings of the 2011 IEEE Conference on Computational Intelligence and Games, 2011

Computational and human intelligence in blind Go.
Proceedings of the 2011 IEEE Conference on Computational Intelligence and Games, 2011

A Rigorous Runtime Analysis for Quasi-Random Restarts and Decreasing Stepsize.
Proceedings of the Artificial Evolution, 2011

Online Sparse Bandit for Card Games.
Proceedings of the Advances in Computer Games - 13th International Conference, 2011

Towards a Solution of 7x7 Go with Meta-MCTS.
Proceedings of the Advances in Computer Games - 13th International Conference, 2011

Lower Bounds for Evolution Strategies.
Proceedings of the Theory of Randomized Search Heuristics: Foundations and Recent Developments., 2011

2010
Current Frontiers in Computer Go.
IEEE Trans. Comput. Intell. AI Games, 2010

Special Issue on Monte Carlo Techniques and Computer Go.
IEEE Trans. Comput. Intell. AI Games, 2010

The Game of Go @ IEEE WCCI 2010 [Society Briefs].
IEEE Comput. Intell. Mag., 2010

Intelligent Agents for the Game of Go.
IEEE Comput. Intell. Mag., 2010

Continuous Lunches Are Free Plus the Design of Optimal Optimization Algorithms.
Algorithmica, 2010

Log(lambda) Modifications for Optimal Parallelism.
Proceedings of the Parallel Problem Solving from Nature, 2010

Complexity Bounds for Batch Active Learning in Classification.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2010

Bandit-Based Estimation of Distribution Algorithms for Noisy Optimization: Rigorous Runtime Analysis.
Proceedings of the Learning and Intelligent Optimization, 4th International Conference, 2010

Consistency Modifications for Automatically Tuned Monte-Carlo Tree Search.
Proceedings of the Learning and Intelligent Optimization, 4th International Conference, 2010

Parameter Tuning by Simple Regret Algorithms and Multiple Simultaneous Hypothesis Testing.
Proceedings of the ICINCO 2010, 2010

Adaptive Noisy Optimization.
Proceedings of the Applications of Evolutionary Computation, 2010

Bandit-Based Genetic Programming.
Proceedings of the Genetic Programming, 13th European Conference, 2010

On the huge benefit of decisive moves in Monte-Carlo Tree Search algorithms.
Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games, 2010

Biasing Monte-Carlo Simulations through RAVE Values.
Proceedings of the Computers and Games - 7th International Conference, 2010

A Principled Method for Exploiting Opening Books.
Proceedings of the Computers and Games - 7th International Conference, 2010

Scalability and Parallelization of Monte-Carlo Tree Search.
Proceedings of the Computers and Games - 7th International Conference, 2010

2009
The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments.
IEEE Trans. Comput. Intell. AI Games, 2009

Combiner connaissances expertes, hors-ligne, transientes et en ligne pour l'exploration Monte-Carlo. Apprentissage et MC.
Rev. d'Intelligence Artif., 2009

Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2009

Why one must use reweighting in estimation of distribution algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Optimal robust expensive optimization is tractable.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Optimizing low-discrepancy sequences with an evolutionary algorithm.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

A novel ontology for computer go knowledge management.
Proceedings of the FUZZ-IEEE 2009, 2009

On the Parallel Speed-Up of Estimation of Multivariate Normal Algorithm and Evolution Strategies.
Proceedings of the Applications of Evolutionary Computing, 2009

Grid Coevolution for Adaptive Simulations: Application to the Building of Opening Books in the Game of Go.
Proceedings of the Applications of Evolutionary Computing, 2009

A Statistical Learning Perspective of Genetic Programming.
Proceedings of the Genetic Programming, 12th European Conference, 2009

On the huge benefit of quasi-random mutations for multimodal optimization with application to grid-based tuning of neurocontrollers.
Proceedings of the 17th European Symposium on Artificial Neural Networks, 2009

Creating an Upper-Confidence-Tree Program for Havannah.
Proceedings of the Advances in Computer Games, 12th International Conference, 2009

Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search.
Proceedings of the Advances in Computer Games, 12th International Conference, 2009

2008
Lower Bounds for Evolution Strategies Using VC-Dimension.
Proceedings of the Parallel Problem Solving from Nature, 2008

When Does Quasi-random Work?.
Proceedings of the Parallel Problem Solving from Nature, 2008

The Parallelization of Monte-Carlo Planning - Parallelization of MC-Planning.
Proceedings of the ICINCO 2008, 2008

2007
Association Rule Interestingness: Measure and Statistical Validation.
Proceedings of the Quality Measures in Data Mining, 2007

On the Hardness of Offline Multi-objective Optimization.
Evol. Comput., 2007

Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime.
Evol. Comput., 2007

Slightly Beyond Turing's Computability for Studying Genetic Programming.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

Active learning in regression, with application to stochastic dynamic programming.
Proceedings of the ICINCO 2007, 2007

Nonlinear programming in approximate dynamic programming - bang-bang solutions, stock-management and unsmooth penalties.
Proceedings of the ICINCO 2007, 2007

DCMA: yet another derandomization in covariance-matrix-adaptation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

Continuous lunches are free!
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

On the adaptation of noise level for stochastic optimization.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007

Conditioning, Halting Criteria and Choosing lambda.
Proceedings of the Artificial Evolution, 2007

2006
Universal Consistency and Bloat in GP Some theoretical considerations about Genetic Programming from a Statistical Learning Theory viewpoint.
Rev. d'Intelligence Artif., 2006

Bayesian Networks: a Non-Frequentist Approach for Parametrization, and a more Accurate Structural Complexity Measure Bayesian Networks Learning.
Rev. d'Intelligence Artif., 2006

Optimal estimation for Large-Eddy Simulation of turbulence and application to the analysis of subgrid models
CoRR, 2006

On the Ultimate Convergence Rates for Isotropic Algorithms and the Best Choices Among Various Forms of Isotropy.
Proceedings of the Parallel Problem Solving from Nature, 2006

General Lower Bounds for Evolutionary Algorithms.
Proceedings of the Parallel Problem Solving from Nature, 2006

Learning for stochastic dynamic programming.
Proceedings of the 14th European Symposium on Artificial Neural Networks, 2006

Why Simulation-Based Approachs with Combined Fitness are a Good Approach for Mining Spaces of Turing-equivalent Functions.
Proceedings of the IEEE International Conference on Evolutionary Computation, 2006

Resource-Aware Parameterizations of EDA.
Proceedings of the IEEE International Conference on Evolutionary Computation, 2006

2005
Adaptive estimation of normals and surface area for discrete 3-D objects: application to snow binary data from X-ray tomography.
IEEE Trans. Image Process., 2005

A Multi-Objective Multi-Modal Optimization Approach for Mining Stable Spatio-Temporal Patterns.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

A statistical learning theory approach of bloat.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005

Local and global order 3/2 convergence of a surrogate evolutionary algorithm.
Proceedings of the Genetic and Evolutionary Computation Conference, 2005

Multi-objective Multi-modal Optimization for Mining Spatio-temporal Patterns.
Proceedings of the Actes de CAP 05, Conférence francophone sur l'apprentissage automatique, 2005

Apprentissage statistique et programmation génétique: la croissance du code est-elle inévitable?
Proceedings of the Actes de CAP 05, Conférence francophone sur l'apprentissage automatique, 2005

Statistical asymptotic and non-asymptotic consistency of bayesian networks: convergence to the right structure and consistent probability estimates.
Proceedings of the Actes de CAP 05, Conférence francophone sur l'apprentissage automatique, 2005

Taylor-based pseudo-metrics for random process fitting in dynamic programming: expected loss minimization and risk management.
Proceedings of the Actes de CAP 05, Conférence francophone sur l'apprentissage automatique, 2005

Systèmes inductifs-déductifs: une approche statistique.
Proceedings of the Actes de CAP 05, Conférence francophone sur l'apprentissage automatique, 2005

Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies.
Proceedings of the Artificial Evolution, 2005

2004
Contrôle du risque multiple pour la sélection de règles d'association significatives.
Proceedings of the Extraction et gestion des connaissances (EGC'2004), 2004

2002
Multigrid Convergence and Surface Area Estimation.
Proceedings of the Geometry, 2002

Lower Bounds for Training and Leave-One-Out Estimates of the Generalization Error.
Proceedings of the Artificial Neural Networks, 2002

2001
Decidability of the halting problem for Matiyasevich deterministic machines.
Theor. Comput. Sci., 2001

Kernel Based Image Classification.
Proceedings of the Artificial Neural Networks, 2001

Bounds on the Generalization Ability of Bayesian Inference and Gibbs Algorithms.
Proceedings of the Artificial Neural Networks, 2001

Identification de la langue et catégorisation de textes basées sur les N-grammes.
Proceedings of the Extraction et gestion des connaissances (EGC'2001), 2001

2000
Segmentation and Length Estimation of 3D Discrete Curves.
Proceedings of the Digital and Image Geometry, 2000


  Loading...