Olivier Teytaud - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

Continuous Lunches Are Free Plus the Design of Optimal Optimization AlgorithmsAnne Auger, Olivier Teytaud. algorithmica, 57(1):121-146, 2010. [doi]

Consistency Modifications for Automatically Tuned Monte-Carlo Tree SearchVincent Berthier, Hassen Doghmen, Olivier Teytaud. lion 2010: 111-124 [doi]

Scalability and Parallelization of Monte-Carlo Tree SearchAmine 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. CG 2011: 48-58 [doi]

Parameter Tuning by Simple Regret Algorithms and Multiple Simultaneous Hypothesis TestingAmine Bourki, Matthieu Coulm, Philippe Rolet, Olivier Teytaud, Paul Vayssière. icinco 2010: 169-173

A Principled Method for Exploiting Opening BooksRomaric Gaudel, Jean-Baptiste Hoock, Julien Perez, Nataliya Sokolovska, Olivier Teytaud. CG 2011: 136-144 [doi]

Intelligent Agents for the Game of GoJean-Baptiste Hoock, Chang-Shing Lee, Arpad Rimmel, Fabien Teytaud, Mei-Hui Wang, Olivier Teytaud. cim, 5(4):28-42, 2010. [doi]

Bandit-Based Genetic ProgrammingJean-Baptiste Hoock, Olivier Teytaud. eurogp 2010: 268-277 [doi]

The Game of Go @ IEEE WCCI 2010 [Society Briefs]Chang-Shing Lee, Mei-Hui Wang, Olivier Teytaud, Yuan-Liang Wang. cim, 5(4):6-7, 2010. [doi]

Special Issue on Monte Carlo Techniques and Computer GoChang-Shing Lee, Martin Müller 0003, Olivier Teytaud. tciaig, 2(4):225-228, 2010. [doi]

Current Frontiers in Computer GoArpad Rimmel, Olivier Teytaud, Chang-Shing Lee, Shi-Jim Yen, Mei-Hui Wang, Shang-Rong Tsai. tciaig, 2(4):229-238, 2010. [doi]

Biasing Monte-Carlo Simulations through RAVE ValuesArpad Rimmel, Fabien Teytaud, Olivier Teytaud. CG 2011: 59-68 [doi]

Complexity Bounds for Batch Active Learning in ClassificationPhilippe Rolet, Olivier Teytaud. pkdd 2010: 293-305 [doi]

Adaptive Noisy OptimizationPhilippe Rolet, Olivier Teytaud. evoW 2010: 592-601 [doi]

Bandit-Based Estimation of Distribution Algorithms for Noisy Optimization: Rigorous Runtime AnalysisPhilippe Rolet, Olivier Teytaud. lion 2010: 97-110 [doi]

Log(lambda) Modifications for Optimal ParallelismFabien Teytaud, Olivier Teytaud. ppsn 2010: 254-263 [doi]

2009

A Statistical Learning Perspective of Genetic ProgrammingNur Merve Amil, Nicolas Bredeche, Christian Gagné, Sylvain Gelly, Marc Schoenauer, Olivier Teytaud. eurogp 2009: 327-338 [doi]

Grid Coevolution for Adaptive Simulations: Application to the Building of Opening Books in the Game of GoPierre Audouard, Guillaume Chaslot, Jean-Baptiste Hoock, Julien Perez, Arpad Rimmel, Olivier Teytaud. evoW 2009: 323-332 [doi]

Adding Expert Knowledge and Exploration in Monte-Carlo Tree SearchGuillaume Chaslot, Christophe Fiter, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud. acg 2010: 1-13 [doi]

Combiner connaissances expertes, hors-ligne, transientes et en ligne pour l exploration Monte-Carlo. Apprentissage et MCGuillaume Chaslot, L. Chatriot, C. Fiter, Sylvain Gelly, Jean-Baptiste Hoock, J. Perez, Arpad Rimmel, Olivier Teytaud. ria, 23(2-3):203-220, 2009. [doi]

The Computational Intelligence of MoGo Revealed in Taiwan s Computer Go TournamentsChang-Shing Lee, Mei-Hui Wang, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Shang-Rong Tsai, Shun-chin Hsu, Tzung-Pei Hong. tciaig, 1(1):73-89, 2009. [doi]

Optimizing low-discrepancy sequences with an evolutionary algorithmFranÃ§ois-Michel De Rainville, Christian GagnÃ©, Olivier Teytaud, Denis Laurendeau. gecco 2009: 1491-1498 [doi]

Optimal robust expensive optimization is tractablePhilippe Rolet, MichÃ¨le Sebag, Olivier Teytaud. gecco 2009: 1951-1956 [doi]

Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based AlgorithmPhilippe Rolet, MichÃ¨le Sebag, Olivier Teytaud. pkdd 2009: 302-317 [doi]

On the Parallel Speed-Up of Estimation of Multivariate Normal Algorithm and Evolution StrategiesFabien Teytaud, Olivier Teytaud. evoW 2009: 655-664 [doi]

Why one must use reweighting in estimation of distribution algorithmsFabien Teytaud, Olivier Teytaud. gecco 2009: 453-460 [doi]

Creating an Upper-Confidence-Tree Program for HavannahFabien Teytaud, Olivier Teytaud. acg 2010: 65-74 [doi]

2008

The Parallelization of Monte-Carlo Planning - Parallelization of MC-PlanningSylvain Gelly, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Y. Kalemkarian. icinco 2008: 244-249

Lower Bounds for Evolution Strategies Using VC-DimensionOlivier Teytaud, Hervé Fournier. ppsn 2008: 102-111 [doi]

When Does Quasi-random Work?Olivier Teytaud. ppsn 2008: 325-336 [doi]

2007

Continuous lunches are free!Anne Auger, Olivier Teytaud. gecco 2007: 916-922 [doi]

Comparison-Based Algorithms Are Robust and Randomized Algorithms Are AnytimeSylvain Gelly, Sylvie Ruette, Olivier Teytaud. ec, 15(4):411-434, 2007. [doi]

Association Rule Interestingness: Measure and Statistical ValidationStéphane Lallich, Olivier Teytaud, Elie Prudhomme. In Fabrice Guillet, Howard J. Hamilton, editors, Quality Measures in Data Mining. Volume 43 of Studies in Computational Intelligence, pages 251-275, Springer, 2007. [doi]

DCMA: yet another derandomization in covariance-matrix-adaptationOlivier Teytaud, Sylvain Gelly. gecco 2007: 955-963 [doi]

Conditioning, Halting Criteria and Choosing lambdaOlivier Teytaud. ae 2008: 196-206 [doi]

On the Hardness of Offline Multi-objective OptimizationOlivier Teytaud. ec, 15(4):475-491, 2007. [doi]

On the adaptation of noise level for stochastic optimizationOlivier Teytaud, Anne Auger. cec 2007: 3027-3034 [doi]

Active learning in regression, with application to stochastic dynamic programmingOlivier Teytaud, Sylvain Gelly, Jérémie Mary. icinco 2007: 198-205

Slightly Beyond Turing s Computability for Studying Genetic ProgrammingOlivier Teytaud. mcu 2007: 279-290 [doi]

Nonlinear programming in approximate dynamic programming - bang-bang solutions, stock-management and unsmooth penaltiesOlivier Teytaud, Sylvain Gelly. icinco 2007: 47-54

2006

Universal Consistency and Bloat in GP Some theoretical considerations about Genetic Programming from a Statistical Learning Theory viewpointSylvain Gelly, Olivier Teytaud, Nicolas Bredeche, Marc Schoenauer. ria, 20(6):805-827, 2006. [doi]

Learning for stochastic dynamic programmingSylvain Gelly, Jérémie Mary, Olivier Teytaud. esann 2006: 191-196 [doi]

Bayesian Networks: a Non-Frequentist Approach for Parametrization, and a more Accurate Structural Complexity Measure Bayesian Networks LearningSylvain Gelly, Olivier Teytaud. ria, 20(6):717-755, 2006. [doi]

On the Ultimate Convergence Rates for Isotropic Algorithms and the Best Choices Among Various Forms of IsotropyOlivier Teytaud, Sylvain Gelly, Jérémie Mary. ppsn 2006: 32-41 [doi]

General Lower Bounds for Evolutionary AlgorithmsOlivier Teytaud, Sylvain Gelly. ppsn 2006: 21-31 [doi]

2005

Local and global order 3/2 convergence of a surrogate evolutionary algorithmAnne Auger, Marc Schoenauer, Olivier Teytaud. gecco 2005: 857-864 [doi]

Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution StrategiesAnne Auger, Mohamed Jebalia, Olivier Teytaud. ae 2006: 296-307 [doi]

Systèmes inductifs-déductifs: une approche statistiqueNicolas Baskiotis, Michèle Sebag, Olivier Teytaud. cfap 2005: 145-146

Adaptive estimation of normals and surface area for discrete 3-D objects: application to snow binary data from X-ray tomographyFrédéric Flin, Jean-Bruno Brzoska, David Coeurjolly, Romeu André Pieritz, Bernard Lesaffre, Cécile Coleou, Pascal Lamboley, Olivier Teytaud, Gérard Vignoles, Jean-François Delesse. TIP, 14(5):585-596, 2005. [doi]

Apprentissage statistique et programmation génétique: la croissance du code est-elle inévitable?Sylvain Gelly, Olivier Teytaud, Nicolas Bredeche, Marc Schoenauer. cfap 2005: 163-178

Statistical asymptotic and non-asymptotic consistency of bayesian networks: convergence to the right structure and consistent probability estimatesSylvain Gelly, Olivier Teytaud. cfap 2005: 147-162

A statistical learning theory approach of bloatSylvain Gelly, Olivier Teytaud, Nicolas Bredeche, Marc Schoenauer. gecco 2005: 1783-1784 [doi]

Taylor-based pseudo-metrics for random process fitting in dynamic programming: expected loss minimization and risk managementSylvain Gelly, Jérémie Mary, Olivier Teytaud. cfap 2005: 183-184

A Multi-Objective Multi-Modal Optimization Approach for Mining Stable Spatio-Temporal PatternsMichèle Sebag, Nicolas Tarrisson, Olivier Teytaud, Julien Lefevre, Sylvain Baillet. IJCAI 2005: 859-864 [doi]

Multi-objective Multi-modal Optimization for Mining Spatio-temporal PatternsNicolas Tarrisson, Michèle Sebag, Olivier Teytaud, Julien Lefevre, Sylvain Baillet. cfap 2005: 217-230

2004

Contrôle du risque multiple pour la sélection de règles d association significativesStéphane Lallich, Elie Prudhomme, Olivier Teytaud. f-egc 2004: 305-316

2002

Multigrid Convergence and Surface Area EstimationDavid Coeurjolly, Frédéric Flin, Olivier Teytaud, Laure Tougne. tfcv 2003: 101-119 [doi]

Lower Bounds for Training and Leave-One-Out Estimates of the Generalization ErrorGérald Gavin, Olivier Teytaud. icann 2002: 583-588 [doi]

2001

Identification de la langue et catégorisation de textes basées sur les N-grammesRadwan Jalam, Olivier Teytaud. f-egc 2001: 227-238

Decidability of the halting problem for Matiyasevich deterministic machinesOlivier Teytaud. TCS, 257(1-2):241-251, 2001. [doi]

Bounds on the Generalization Ability of Bayesian Inference and Gibbs AlgorithmsOlivier Teytaud, Hélène Paugam-Moisy. icann 2001: 265-270 [doi]

Kernel Based Image ClassificationOlivier Teytaud, David Sarrut. icann 2001: 369-375 [doi]

2000

Segmentation and Length Estimation of 3D Discrete CurvesDavid Coeurjolly, Isabelle Debled-Rennesson, Olivier Teytaud. dagstuhl 2001: 299-317 [doi]