Skip to Main content
Number of documents

165

Hal-page O. Teytaud


Journal articles32 documents

  • Laurent Meunier, Herilalaina Rakotoarison, Pak Kan Wong, Baptiste Roziere, Jeremy Rapin, et al.. Black-Box Optimization Revisited: Improving Algorithm Selection Wizards through Massive Benchmarking. IEEE Transactions on Evolutionary Computation, Institute of Electrical and Electronics Engineers, 2022, 26 (3), ⟨10.1109/TEVC.2021.3108185⟩. ⟨hal-03154019⟩
  • Pauline Bennet, Perrine Juillet, Sara Ibrahim, Vincent Berthier, Mamadou Aliou Barry, et al.. Analysis and fabrication of antireflective coating for photovoltaics based on a photonic-crystal concept and generated by evolutionary optimization. Physical Review B, American Physical Society, 2021, 103 (12), ⟨10.1103/PhysRevB.103.125135⟩. ⟨hal-03172152⟩
  • Tristan Cazenave, Yen-Chi Chen, Guan-Wei Chen, Shi-Yu Chen, Xian-Dong Chiu, et al.. Polygames: Improved Zero Learning. International Computer Games Association Journal, ICGA, 2020, 42 (4), pp.244-256. ⟨hal-03117499⟩
  • Veronique Ventos, Véronique Ventos, Olivier Teytaud. Le bridge, nouveau défi de l’intelligence artificielle ?. Revue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle, Lavoisier, 2017, 31 (3), pp.249 - 279. ⟨10.3166/ria.31.249-279⟩. ⟨hal-01665780⟩
  • Sandra Astete-Morales, Marie-Liesse Cauwet, Jialin Liu, Olivier Teytaud. Simple and Cumulative Regret for Continuous Noisy Optimization. Theoretical Computer Science, Elsevier, 2015, 617, pp.12-27. ⟨10.1016/j.tcs.2015.09.032⟩. ⟨hal-01194564⟩
  • Marie-Liesse Cauwet, Jialin Liu, Rozière Baptiste, Olivier Teytaud. Algorithm Portfolios for Noisy Optimization. Annals of Mathematics and Artificial Intelligence, Springer Verlag, 2015, pp.1-30. ⟨10.1007/s10472-015-9486-2⟩. ⟨hal-01223113⟩
  • Chang-Shing Lee, Mei-Hui Wang, Meng-Jhen Wu, Olivier Teytaud, Shi-Jim Yen. T2FS-based Adaptive Linguistic Assessment System for Semantic Analysis and Human Performance Evaluation on Game of Go. IEEE Transactions on Fuzzy Systems, Institute of Electrical and Electronics Engineers, 2015, 23 (2), pp.400-420. ⟨10.1109/TFUZZ.2014.2312989⟩. ⟨hal-01059822⟩
  • Youhei Akimoto, Sandra Astete-Morales, Olivier Teytaud. Analysis of runtime of optimization algorithms for noisy functions over discrete codomains. Theoretical Computer Science, Elsevier, 2015, 605, pp.42:50. ⟨10.1016/j.tcs.2015.04.008⟩. ⟨hal-01194556⟩
  • Nataliya Sokolovska, Olivier Teytaud, Salwa Rizkalla, Karine Clément, Jean-Daniel Zucker. Sparse Zero-Sum Games as Stable Functional Feature Selection. PLoS ONE, Public Library of Science, 2015, 10 (9), pp.e0134683. ⟨10.1371/journal.pone.0134683⟩. ⟨hal-01223887⟩
  • Cheng-Wei Chou, Ping-Chiang Chou, Jean-Joseph Christophe, Adrien Couetoux, Pierre de Freminville, et al.. Strategic Choices in Optimization. Journal of Information Science and Engineering, Academia Sinica, 2013. ⟨hal-00863577⟩
  • Chang-Shing Lee, Mei-Hui Wang, Yu-Jen Chen, Heni Hagras, Meng-Jhen Wu, et al.. Genetic fuzzy markup language for game of NoGo. Knowledge-Based Systems, Elsevier, 2012, 34, pp.64-80. ⟨hal-00766773⟩
  • Olivier Teytaud. Programmation des échecs et d’autres jeux. Interstices, INRIA, 2012. ⟨hal-01350425⟩
  • David Auger, Olivier Teytaud. The Frontier of Decidability in Partially Observable Recursive Games. International Journal of Foundations of Computer Science, World Scientific Publishing, 2012, Special Issue on "Frontier between Decidability and Undecidability", 23 (7), pp.1439-1450. ⟨hal-00710073⟩
  • Chang-Shing Lee, Olivier Teytaud, Mei-Hui Wang, Shi-Jim Yen. Computational Intelligence Meets the Game of Go @ IEEE WCCI 2012. IEEE Computational Intelligence Magazine, Institute of Electrical and Electronics Engineers, 2012, 7 (4), pp.10-12. ⟨hal-00744982⟩
  • Sylvain Gelly, Marc Schoenauer, Michèle Sebag, Olivier Teytaud, Levente Kocsis, et al.. The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions. Communications of the ACM, Association for Computing Machinery, 2012, 55 (3), pp.106-113. ⟨hal-00695370v3⟩
  • François-Michel De Rainville, Christian Gagné, Olivier Teytaud, Denis Laurendeau. Evolutionary Optimization of Low-Discrepancy Sequences. ACM Transactions on Modeling and Computer Simulation, Association for Computing Machinery, 2012, 22 (2), pp.9:1-9:25. ⟨hal-00758158⟩
  • Shih-Yuan Chiu, Hassen Doghmen, Chang-Shing Lee, Fabien Teytaud, Olivier Teytaud, et al.. Human vs. Computer Go Competition in FUZZ-IEEE 2011. International Computer Games Association Journal, ICGA, 2011, 34 (4), pp.243-247. ⟨hal-00766202⟩
  • Shi-Jim Yen, Cheng-Wei Chou, Chang-Shing Lee, Hassen Doghmen, Olivier Teytaud. THE IEEE SSCI 2011 HUMAN VS. COMPUTER-GO COMPETITION. International Computer Games Association Journal, ICGA, 2011, 34 (2), pp.106-107. ⟨hal-00766205⟩
  • Chang-Shing Lee, Mei-Hui Wang, Olivier Teytaud, Yuan-Liang Wang. The Game of Go @ IEEE WCCI 2010. IEEE Computational Intelligence Magazine, Institute of Electrical and Electronics Engineers, 2010, 5 (4), pp.6-7. ⟨10.1109/MCI.2010.938371⟩. ⟨inria-00632302⟩
  • Jean-Baptiste Hoock, Chang-Shing Lee, Arpad Rimmel, Fabien Teytaud, Olivier Teytaud, et al.. Intelligent Agents for the Game of Go. IEEE Computational Intelligence Magazine, Institute of Electrical and Electronics Engineers, 2010. ⟨inria-00544758v2⟩
  • Arpad Rimmel, Olivier Teytaud, Chang-Shing Lee, Shi-Jim Yen, Mei-Hui Wang, et al.. Current Frontiers in Computer Go. IEEE Transactions on Computational Intelligence and AI in games, IEEE Computational Intelligence Society, 2010, in press. ⟨inria-00544622⟩
  • Hervé Fournier, Olivier Teytaud. Lower Bounds for Comparison Based Evolution Strategies using VC-dimension and Sign Patterns. Algorithmica, Springer Verlag, 2010. ⟨inria-00452791⟩
  • Chang-Shing Lee, Mei-Hui Wang, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, et al.. The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments. IEEE Transactions on Computational Intelligence and AI in games, IEEE Computational Intelligence Society, 2009. ⟨inria-00369786⟩
  • Simon Billouet, Jean-Baptiste Hoock, Chang-Shing Lee, Olivier Teytaud, Shi-Jim Yen. 9x9 GO AS BLACK WITH KOMI 7.5: AT LAST SOME GAMES WON AGAINST TOP PLAYERS IN THE DISADVANTAGEOUS SITUATION. International Computer Games Association Journal, ICGA, 2009. ⟨inria-00528770⟩
  • Anne Auger, Olivier Teytaud. Continuous lunches are free plus the design of optimal optimization algorithms. Algorithmica, Springer Verlag, 2009, ⟨10.1007/s00453-008-9244-5⟩. ⟨inria-00369788⟩
  • Louis Chatriot, Christophe Fiter, Guillaume Chaslot, Sylvain Gelly, Jean-Baptiste Hoock, et al.. Combiner connaissances expertes, hors-ligne, transientes et en ligne pour l'exploration Monte-Carlo. Revue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle, Lavoisier, 2008. ⟨inria-00343509⟩
  • Olivier Teytaud. On the hardness of offline multiobjective optimization. Evolutionary Computation, Massachusetts Institute of Technology Press (MIT Press), 2007. ⟨inria-00173239⟩
  • Sylvain Gelly, Sylvie Ruette, Olivier Teytaud. comparison-based algorithms are robust and randomized algorithms are anytime.. Evolutionary Computation, Massachusetts Institute of Technology Press (MIT Press), 2007. ⟨inria-00173221⟩
  • Sylvain Gelly, Olivier Teytaud. Bayesian Networks: a Non-Frequentist Approach for Parametrization, and a more Accurate Structural Complexity Measure. Revue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle, Lavoisier, 2006. ⟨inria-00112838⟩
  • Antoine Moreau, Olivier Teytaud, Jean-Pierre Bertoglio. Optimal estimation for Large-Eddy Simulation of turbulence and application to the analysis of subgrid models. Physics of Fluids, American Institute of Physics, 2006, 18, pp.105101. ⟨hal-00078115v2⟩
  • Sylvain Gelly, Olivier Teytaud, Nicolas Bredeche, Marc Schoenauer. Universal Consistency and Bloat in GP. Revue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle, Lavoisier, 2006. ⟨inria-00112840⟩
  • Frédéric Flin, Jean-Bruno Brzoska, David Coeurjolly, Romeu A. Pieritz, Bernard Lesaffre, et al.. An adaptative filtering method to evalute normal vectors and surface areas of 3d objects. Application to snow images from X-ray tomography. IEEE Transactions on Image Processing, Institute of Electrical and Electronics Engineers, 2005, 14 (5), pp.585-596. ⟨hal-00185086⟩

Conference papers115 documents

  • Laurent Meunier, Carola Doerr, Jeremy Rapin, Olivier Teytaud. Variance Reduction for Better Sampling in Continuous Domains. Parallel Problem Solving from Nature – PPSN XVI (PPSN 2020), Sep 2020, Leiden, Netherlands. pp.154-168, ⟨10.1007/978-3-030-58112-1_11⟩. ⟨hal-02935395⟩
  • Baptiste Rozière, Fabien Teytaud, Vlad Hosu, Hanhe Lin, Jeremy Rapin, et al.. EvolGAN: Evolutionary Generative Adversarial Networks. Asia Conference on Computer Vision (ACCV), Nov 2020, Virtual, Japan. ⟨hal-03091443⟩
  • Jialin Liu, Antoine Moreau, Mike Preuss, Jeremy Rapin, Baptiste Roziere, et al.. Versatile black-box optimization. GECCO '20: Genetic and Evolutionary Computation Conference, Jul 2020, Cancún Mexico, France. pp.620-628, ⟨10.1145/3377930.3389838⟩. ⟨hal-03049284⟩
  • Marie-Liesse Cauwet, Jérémie Decock, Jialin Liu, Olivier Teytaud. Direct Model Predictive Control: A Theoretical and Numerical Analysis. PSCC 2018 - XX Power Systems Computation Conference, Jun 2018, Dublin, Ireland. ⟨hal-01701623⟩
  • Marie-Liesse Cauwet, Olivier Teytaud. Surprising strategies obtained by stochastic optimization in partially observable games. CEC 2018 - IEEE Congress on Evolutionary Computation, Jul 2018, Rio de Janeiro, Brazil. pp.1-8. ⟨hal-01829721⟩
  • Marie-Liesse Cauwet, Olivier Teytaud. Noisy Optimization: Fast Convergence Rates with Comparison-Based Algorithms. Genetic and Evolutionary Computation Conference, Jul 2016, Denver, United States. pp.1101-1106. ⟨hal-01306636v2⟩
  • Fabien Teytaud, Olivier Teytaud. QR mutations improve many evolution strategies -a lot on highly multimodal problems. ACM-GECCO'16, Jul 2016, Denver, United States. pp.35-36, ⟨10.1145/1235⟩. ⟨hal-01406727⟩
  • Sandra Astete-Morales, Marie-Liesse Cauwet, Olivier Teytaud. Analysis of Different Types of Regret in Continuous Noisy Optimization. Genetic and Evolutionary Computation Conference 2016, Jul 2016, Denver, United States. pp.205-212. ⟨hal-01347814v2⟩
  • Tristan Cazenave, Jialin Liu, Fabien Teytaud, Olivier Teytaud. Learning opening books in partially observable games: using random seeds in Phantom Go. CIG 2016 - Computer intelligence and Games, Sep 2016, Santorini, Greece. ⟨hal-01413229⟩
  • Marie-Liesse Cauwet, Olivier Teytaud. Multivariate bias reduction in capacity expansion planning. 19th Power Systems Computation Conference, Jun 2016, Gênes, Italy. ⟨hal-01306643⟩
  • Jean-Joseph Christophe, Jérémie Decock, Jialin Liu, Olivier Teytaud. Variance Reduction in Population-Based Optimization: Application to Unit Commitment. Artificial Evolution (EA2015), 2015, Lyon, France. ⟨hal-01194510⟩
  • Vincent Berthier, Olivier Teytaud. Sieves method in fuzzy control: logarithmically increase the number of rules. IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), Aug 2015, Istanbul, Turkey. pp.1 - 9. ⟨hal-01215806⟩
  • Vincent Berthier, Olivier Teytaud. On the codimension of the set of optima: large scale optimisation with few relevant variables. Artificial Evolution 2015, 2015, Lyon, France. To appear. ⟨hal-01194519⟩
  • Sandra Astete-Morales, Marie-Liesse Cauwet, Olivier Teytaud. Evolution Strategies with Additive Noise: A Convergence Rate Lower Bound. Foundations of Genetic Algorithms, 2015, Aberythswyth, United Kingdom. pp.76--84. ⟨hal-01077625v2⟩
  • Shih-Yuan Chiu, Ching-Nung Lin, Jialin Liu, Tsang-Cheng Su, Fabien Teytaud, et al.. Differential Evolution for Strongly Noisy Optimization: Use 1.01$^n$ Resamplings at Iteration n and Reach the -1/2 Slope. 2015 IEEE Congress on Evolutionary Computation (IEEE CEC), May 2015, Sendai, Japan. ⟨hal-01120892⟩
  • David L. St-Pierre, Jialin Liu, Olivier Teytaud. Nash Reweighting of Monte Carlo Simulations: Tsumego. 2015 IEEE Congress on Evolutionary Computation (IEEE CEC 2015), May 2015, Sendai, Japan. pp.1458 - 1465, ⟨10.1109/CEC.2015.7257060⟩. ⟨hal-01245520⟩
  • Marie-Liesse Cauwet, Olivier Teytaud, Hua-Min Liang, Shi-Jim Yen, Hung-Hsuan Lin, et al.. Depth, balancing, and limits of the Elo model. IEEE Conference on Computational Intelligence and Games 2015, Aug 2015, Tainan, Taiwan. ⟨hal-01223116⟩
  • Jérémie Decock, David L. Saint-Pierre, Olivier Teytaud. Evolutionary Cutting Planes. Artificial Evolution (EA2015), 2015, Lyon, France. ⟨hal-01194540⟩
  • Wang Mei-Hui, Chi-Shiang Wang, Chang-Shing Lee, Olivier Teytaud, Jialin Liu, et al.. Item response theory with fuzzy markup language for parameter estimation and validation. 2015 IEEE Conference on Fuzzy Systems (FUZZ-IEEE), Aug 2015, Istanbul, Turkey. pp.1 - 7, ⟨10.1109/FUZZ-IEEE.2015.7337884⟩. ⟨hal-01245695⟩
  • Vincent Berthier, Adrien Couëtoux, Olivier Teytaud. Combining policies: the best of human expertise and neurocontrol. Artificial Evolution 2015, 2015, Lyon, France. To appear. ⟨hal-01194516⟩
  • Tristan Cazenave, Jialin Liu, Olivier Teytaud. The Rectangular Seeds of Domineering, Atari-Go and Breakthrough. 2015 IEEE Conference on Computational Intelligence and Games (CIG), Aug 2015, Tainan, Taiwan. pp.530 - 531, ⟨10.1109/CIG.2015.7317904⟩. ⟨hal-01245531⟩
  • Abdallah Saffidine, Olivier Teytaud, Shi-Jim Yen. Go Complexities. Advances in Computer Games, 2015, Leiden, Netherlands. ⟨10.1007/978-3-319-27992-3_8⟩. ⟨hal-01256660⟩
  • Shih-Yuan Chiu, Ching-Nung Lin, Jialin Liu, Tsang-Cheng Su, Fabien Teytaud, et al.. Differential evolution for strongly noisy optimization: Use 1.01n resamplings at iteration n and reach the − 1/2 slope. 2015 IEEE Congress on Evolutionary Computation (IEEE CEC 2015), May 2015, Sendai, Japan. pp.338 - 345, ⟨10.1109/CEC.2015.7256911⟩. ⟨hal-01245526⟩
  • Jialin Liu, Olivier Teytaud. Meta online learning: experiments on a unit commitment problem. European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, Apr 2014, Bruges, Belgium. ⟨hal-00973397⟩
  • Marie-Liesse Cauwet, Jialin Liu, Olivier Teytaud. Algorithm Portfolios for Noisy Optimization: Compare Solvers Early. Learning and Intelligent Optimization Conference, Feb 2014, Florida, United States. ⟨hal-00926638⟩
  • David L. Saint-Pierre, Olivier Teytaud. Nash and the Bandit Approach for Adversarial Portfolios. CIG 2014 - Computational Intelligence in Games, IEEE, Aug 2014, Dortmund, Germany. pp.7, ⟨10.1109/CIG.2014.6932897⟩. ⟨hal-01077628⟩
  • David Auger, Jialin Liu, Sylvie Ruette, David L. Saint-Pierre, Olivier Teytaud. Sparse Binary Zero-Sum Games. Asian Conference on Machine Learning, 2014, Ho-Chi-Minh-Ville, Vietnam. pp.16. ⟨hal-01077627⟩
  • Jialin Liu, David L. Saint-Pierre, Olivier Teytaud. A mathematically derived number of resamplings for noisy optimization. Companion - Genetic and Evolutionary Computation Conference (GECCO 2014), Jul 2014, Vancouver, Canada. pp.61-62. ⟨hal-00979442⟩
  • Jean-Joseph Christophe, Jérémie Decock, Olivier Teytaud. Direct model predictive control. European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN), Apr 2014, Bruges, Belgium. ⟨hal-00958192⟩
  • Sandra Astete Morales, Jialin Liu, Olivier Teytaud. Noisy optimization convergence rates. Proceeding of the fifteenth annual conference companion on Genetic and evolutionary computation conference companion, Jul 2013, Amsterdam, Netherlands. pp.223--224, ⟨10.1145/2464576.2464687⟩. ⟨hal-00863584⟩
  • Jérémie Decock, Olivier Teytaud. Noisy Optimization Complexity Under Locality Assumption. FOGA - Foundations of Genetic Algorithms XII - 2013, Jan 2013, Adelaide, Australia. ⟨hal-00755663⟩
  • Nicolas Galichet, Michèle Sebag, Olivier Teytaud. Exploration vs Exploitation vs Safety: Risk-averse Multi-Armed Bandits. Asian Conference on Machine Learning 2013, Nov 2013, Canberra, Australia. pp.245-260. ⟨hal-00924062v2⟩
  • David Auger, Adrien Couetoux, Olivier Teytaud. Continuous Upper Confidence Trees with Polynomial Exploration - Consistency. ECML/PKKD 2013, Sep 2013, Prague, Czech Republic. pp.194-209. ⟨hal-00835352⟩
  • Jérémie Decock, Olivier Teytaud. Linear Convergence of Evolution Strategies with Derandomized Sampling Beyond Quasi-Convex Functions. EA - 11th Biennal International Conference on Artificial Evolution - 2013, Oct 2013, Bordeaux, France. ⟨hal-00907671⟩
  • Ping-Chiang Chou, Shi-Jim Yen, Cheng-Wei Chou, Ching-Nung Lin, Chang-Shing Lee, et al.. A simple Tsumego Generator. GPW, 2012, Kanagawa, Japan. ⟨hal-00766190⟩
  • Olivier Buffet, Chang-Shing Lee, Woanting Lin, Olivier Teytaud. Optimistic Heuristics for MineSweeper. ICS - International Computer Symposium - 2012, Dec 2012, Hualien, Taiwan. pp.199-207, ⟨10.1007/978-3-642-35452-6_22⟩. ⟨hal-00750577v2⟩
  • Michèle Sebag, Olivier Teytaud. Combining Myopic Optimization and Tree Search: Application to MineSweeper. LION6, Learning and Intelligent Optimization, Proc. LION 6, 2012, Paris, France. pp.222-236. ⟨hal-00712417v2⟩
  • Adrien Couetoux, Olivier Teytaud, Hassen Doghmen. Learning a Move-Generator for Upper Con dence Trees. International Computer Symposium 2012, Dec 2012, Hualien, Taiwan. ⟨hal-00759822⟩
  • Adrien Couetoux, Hassen Doghmen, Olivier Teytaud. Improving the exploration in Upper Confidence Trees. Learning and Intelligent OptimizatioN Conference LION 6, Jan 2012, Paris, France. ⟨hal-00745208⟩
  • Cheng-Wei Chou, Ping-Chiang Chou, Chang-Shing Lee, David L. Saint-Pierre, Olivier Teytaud, et al.. Strategic Choices: Small Budgets and Simple Regret. TAAI, 2012, Hualien, Taiwan. ⟨hal-00753145v2⟩
  • Benard Helmstetter, Chang-Shing Lee, Fabien Teytaud, Olivier Teytaud, Wang Mei-Hui, et al.. Random positions in Go. Computational Intelligence and Games, Aug 2011, Seoul, North Korea. ⟨inria-00625815⟩
  • Fabien Teytaud, Olivier Teytaud. Lemmas on Partial Observation, with Application to Phantom Games. Computational Intelligence and Games, Aug 2011, Seoul, North Korea. ⟨inria-00625794⟩
  • C.-W. Chou, Olivier Teytaud, Shi-Jim Yen. Revisiting Monte-Carlo Tree Search on a Normal Form Game: NoGo. EvoGames 2011, Apr 2011, Turino, Italy. pp.73-82, ⟨10.1007/978-3-642-20525-5⟩. ⟨inria-00593154⟩
  • Marc Schoenauer, Fabien Teytaud, Olivier Teytaud. A Rigorous Runtime Analysis for Quasi-Random Restarts and Decreasing Stepsize. Artificial Evolution, Oct 2011, Angers, France. ⟨inria-00625855⟩
  • Adrien Couetoux, Jean-Baptiste Hoock, Nataliya Sokolovska, Olivier Teytaud, Nicolas Bonnard. Continuous Upper Con dence Trees. Learning and Intelligent Optimization: 5th International Conference, LION 5, Jan 2011, Rome, Italy. ⟨hal-00745206⟩
  • Adrien Couetoux, Mario Milone, Olivier Teytaud. Consistent Belief State Estimation, with Application to Mines. Technologies and Applications of Artificial Intelligence, International Conference on, 2011, Hsinchu, Taiwan. pp.280-285. ⟨hal-00712388⟩
  • Adrien Couetoux, Mario Milone, Matyas Brendel, Hassen Doghmen, Michèle Sebag, et al.. Continuous Rapid Action Value Estimates. The 3rd Asian Conference on Machine Learning (ACML2011), Nov 2011, Taoyuan, Taiwan. pp.19-31. ⟨hal-00642459⟩
  • Jean-Baptiste Hoock, Olivier Teytaud. Progress Rate in Noisy Genetic Programming for Choosing λ. Artificial Evolution, Oct 2011, Angers, France. ⟨inria-00622150⟩
  • Rémi Coulom, Philippe Rolet, Nataliya Sokolovska, Olivier Teytaud. Handling Expensive Optimization with Large Noise. Foundations of Genetic Algorithms, Jan 2011, Austria. pp.TBA. ⟨hal-00517157v2⟩
  • Nataliya Sokolovska, Olivier Teytaud, Mario Milone. Q-Learning with Double Progressive Widening : Application to Robotics. ICONIP 2011, Nov 2011, China. pp.103-112. ⟨hal-00624832⟩
  • Olivier Teytaud. Comparison-Based Complexity of Multiobjective Optimization. GECCO 2011, 2011, Dublin, Ireland. pp.801-806. ⟨hal-00786635⟩
  • Adrien Couёtoux, Jean-Baptiste Hoock, Nataliya Sokolovska, Olivier Teytaud, Nicolas Bonnard. Continuous Upper Confidence Trees. LION'11: Proceedings of the 5th International Conference on Learning and Intelligent OptimizatioN, Jan 2011, Italy. pp.TBA. ⟨hal-00542673v2⟩
  • Adrien Couetoux, Olivier Teytaud, Nicolas Bonnard, Nicolas Omont, Olivier Ratier. Monte Carlo Tree Search appliqué à la gestion de stocks. ROADEF 2011, Mar 2011, France. N°241, p.I-149. ⟨hal-00623668⟩
  • Cheng-Wei Chou, Li-Wen Wu, Hui-Min Wang, Fabien Teytaud, Olivier Teytaud, et al.. Towards a solution of 7x7 Go with Meta-MCTS. Advances in Computer Games, 2011, Tilburg, Netherlands. pp.12. ⟨hal-01077624⟩
  • Ping-Chiang Chou, Hassen Doghmen, Chang-Shing Lee, Fabien Teytaud, Olivier Teytaud, et al.. Computational and Human Intelligence in Blind Go.. Computational Intelligence and Games, Aug 2011, Seoul, North Korea. ⟨inria-00625849⟩
  • David L. Saint-Pierre, Quentin Louveaux, Olivier Teytaud. Online Sparse Bandits. The 3rd Asian Conference on Machine Learning (ACML2011), Nov 2011, Taoyuan, Taiwan. ⟨hal-00642461⟩
  • Olivier Teytaud, Sébastien Flory. Upper Confidence Trees with Short Term Partial Information. EvoGames 2011, Apr 2011, Turino, Italy. pp.153-162, ⟨10.1007/978-3-642-20525-5⟩. ⟨inria-00585475v2⟩
  • Amine Bourki, Guillaume Chaslot, Matthieu Coulm, Vincent Danjean, Hassen Doghmen, et al.. Scalability and Parallelization of Monte-Carlo Tree Search. The International Conference on Computers and Games 2010, Sep 2010, Kanazawa, Japan. ⟨inria-00512854⟩
  • Amine Bourki, Matthieu Coulm, Philippe Rolet, Olivier Teytaud, Paul Vayssière. Parameter Tuning by Simple Regret Algorithms and Multiple Simultaneous Hypothesis Testing. ICINCO2010, 2010, funchal madeira, Portugal. pp.10. ⟨inria-00467796⟩
  • Fabien Teytaud, Olivier Teytaud. Du jeu de Go au Havannah : variantes d'UCT et coups décisifs. RFIA, Jan 2010, Caen, France. ⟨inria-00454541⟩
  • Vincent Berthier, Hassen Doghmen, Olivier Teytaud. Consistency Modifications for Automatically Tuned Monte-Carlo Tree Search. Lion4, 2010, venice, Italy. 14 p. ⟨inria-00437146⟩
  • Fabien Teytaud, Olivier Teytaud. On the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms. IEEE Conference on Computational Intelligence and Games, Aug 2010, Copenhagen, Denmark. ⟨inria-00495078⟩
  • Fabien Teytaud, Olivier Teytaud. Log(lambda) Modifications for Optimal Parallelism. Parallel Problem Solving From Nature, Sep 2010, Krakow, Poland. ⟨inria-00495087⟩
  • Arpad Rimmel, Fabien Teytaud, Olivier Teytaud. Biasing Monte-Carlo Simulations through RAVE Values. The International Conference on Computers and Games 2010, Sep 2010, Kanazawa, Japan. ⟨inria-00485555⟩
  • Philippe Rolet, Olivier Teytaud. Complexity Bounds for Batch Active Learning in Classification. ECML 2010, Oct 2010, Barcelone, Spain. ⟨inria-00533318⟩
  • Philippe Rolet, Olivier Teytaud. Bandit-based Estimation of Distribution Algorithms for Noisy Optimization: Rigorous Runtime Analysis. Lion4, 2010, Venice, Italy. ⟨inria-00437140⟩
  • Jean-Baptiste Hoock, Olivier Teytaud. Bandit-Based Genetic Programming. 13th European Conference on Genetic Programming, Apr 2010, Istanbul, Turkey. ⟨inria-00452887v2⟩
  • Philippe Rolet, Olivier Teytaud. Adaptive Noisy Optimization. EvoStar 2010, Apr 2010, Istambul, Turkey. ⟨inria-00459017⟩
  • Romaric Gaudel, Jean-Baptiste Hoock, Julien Pérez, Nataliya Sokolovska, Olivier Teytaud. A Principled Method for Exploiting Opening Books. International Conference on Computers and Games, Sep 2010, Kanazawa, Japan. ⟨inria-00484043⟩
  • Fabien Teytaud, Olivier Teytaud. On the parallel speed-up of Estimation of Multivariate Normal Algorithm and Evolution Strategies. EvoNum (evostar workshop), 2009, Tuebingen, Germany. ⟨inria-00369781⟩
  • Merve Amil, Nicolas Bredeche, Christian Gagné, Sylvain Gelly, Marc Schoenauer, et al.. A Statistical Learning Perspective of Genetic Programming. EuroGP, 2009, Tuebingen, Germany. pp.327-338. ⟨inria-00369782⟩
  • Chang-Shing Lee, Wang Mei-Hui, Tzung-Pei Hong, Guillaume Chaslot, Jean-Baptiste Hoock, et al.. A Novel Ontology for Computer Go Knowledge Management. IEEE FUZZ, 2009, Jeju, South Korea. ⟨inria-00386476⟩
  • Fabien Teytaud, Olivier Teytaud. Bias and variance in continuous EDA. EA 09, Oct 2009, Strasbourg, France. ⟨inria-00451416⟩
  • Fabien Teytaud, Olivier Teytaud. Why one must use reweighting in Estimation Of Distribution Algorithms. GECCO, 2009, Montréal, Canada. ⟨inria-00369780⟩
  • Philippe Rolet, Michèle Sebag, Olivier Teytaud. Optimal robust expensive optimization is tractable. Gecco 2009, ACM, 2009, Montréal, Canada. 8 p. ⟨inria-00374910⟩
  • François-Michel De Rainville, Christian Gagné, Olivier Teytaud, Denis Laurendeau. Optimizing Low-Discrepancy Sequences with an Evolutionary Algorithm. Genetic and Evolutionary Computation Conference, 2009, Montréal, Canada. 8 p. ⟨inria-00386475⟩
  • Philippe Rolet, Michèle Sebag, Olivier Teytaud. Upper Confidence Trees and Billiards for Optimal Active Learning. CAP09, 2009, Hammamet, Tunisie, Tunisia. ⟨inria-00369787⟩
  • Fabien Teytaud, Olivier Teytaud. Creating an Upper-Confidence-Tree program for Havannah. ACG 12, May 2009, Pamplona, Spain. ⟨inria-00380539⟩
  • Philippe Rolet, Michèle Sebag, Olivier Teytaud. Boosting Active Learning to Optimality: a Tractable Monte-Carlo, Billiard-based Algorithm. ECML, 2009, Bled, Slovenia. pp.302-317. ⟨inria-00433866⟩
  • Pierre Audouard, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, J. Perez, et al.. Grid coevolution for adaptive simulations; application to the building of opening books in the game of Go. EvoGames, 2009, Tuebingen, Germany. ⟨inria-00369783⟩
  • Guillaume Chaslot, Christophe Fiter, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud. Adding expert knowledge and exploration in Monte-Carlo Tree Search. Advances in Computer Games, 2009, Pamplona, Spain. ⟨inria-00386477⟩
  • 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, Apr 2009, Bruges, Belgium. ⟨inria-00380125⟩
  • Sylvain Gelly, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Yann Kalemkarian. On the Parallelization of Monte-Carlo planning. ICINCO, May 2008, Madeira, Portugal. ⟨inria-00287867⟩
  • Olivier Teytaud. When does quasi-random work ?. Parallel Problem Solving from Nature, Sep 2008, Dortmund, Germany. ⟨inria-00287863⟩
  • Olivier Teytaud, Hervé Fournier. Lower bounds for evolution strategies using VC-dimension. Parallel Problem Solving from Nature, Sep 2008, Dortmund, Germany. 10 p. ⟨inria-00287845⟩
  • Louis Chatriot, Sylvain Gelly, Jean-Baptiste Hoock, Julien Pérez, Arpad Rimmel, et al.. Introduction de connaissances expertes en Bandit-Based Monte-Carlo Planning avec application au Computer-Go. JFPDA, Jun 2008, Metz, France. ⟨inria-00287883⟩
  • Olivier Teytaud. On the almost optimality of blind active sampling.. CAP 2008, May 2008, Porquerolles, France. ⟨inria-00287874⟩
  • Olivier Teytaud, Sylvain Gelly. DCMA, yet another derandomization in covariance-matrix-adaptation. GECCO, 2007, London, United Kingdom. ⟨inria-00173207⟩
  • Anne Auger, Olivier Teytaud. Continuous lunches are free!. GECCO, 2007, London, United Kingdom. ⟨inria-00173209⟩
  • Olivier Teytaud, Sylvain Gelly, Michèle Sebag. Anytime many-armed bandits. CAP07, 2007, Grenoble, France. ⟨inria-00173263⟩
  • Nicolas Baskiotis, Michèle Sebag, Olivier Teytaud. Inductive-deductive systems: a mathematical logic and statistical learning perspective. CAP, 2007, Grenoble, France. 16 p. ⟨inria-00173259v2⟩
  • Cédric Hartland, Nicolas Baskiotis, Sylvain Gelly, Michèle Sebag, Olivier Teytaud. Change Point Detection and Meta-Bandits for Online Learning in Dynamic Environments. CAp 2007 : 9è Conférence francophone sur l'apprentissage automatique, Jul 2007, Grenoble, France. pp.237-250. ⟨inria-00164033⟩
  • Olivier Teytaud, Sylvain Gelly, Jérémie Mary. Active learning in regression, with an application to stochastic dynamic programming. ICINCO 2007, 2007, Angers, France. ⟨inria-00173204⟩
  • Olivier Teytaud. Conditionning, halting criteria and choosing lambda. EA07, 2007, Tours, France. ⟨inria-00173237⟩
  • Olivier Teytaud. Slightly beyond Turing-Computability for studying Genetic Programming. MCU'07, 2007, Orléans, France. ⟨inria-00173241⟩
  • Olivier Teytaud, Sylvain Gelly. Non linear programming for stochastic dynamic programming. Icinco 2007, 2007, Angers, France. ⟨inria-00173202⟩
  • Stéphane Lallich, Olivier Teytaud, Elie Prudhomme. Statistical inference and data mining: false discoveries control. 2006, 12 p. ⟨hal-00113593⟩
  • Sylvain Gelly, Olivier Teytaud. OpenDP a free Reinforcement Learning toolbox for discrete time control problems. NIPS Workshop on Machine Learning Open Source Software, Dec 2006, Whistler (B.C.). ⟨inria-00117392⟩
  • Sylvain Gelly, Olivier Teytaud, Christian Cagne. Resource-Aware Parameterizations of EDA. Congress on Evolutionary Computation, Jul 2006, Vancouver, BC, Canada. ⟨inria-00112803⟩
  • Olivier Teytaud, Sylvain Gelly, Stéphane Lallich, Elie Prudhomme. Quasi-Random resamplings, with applications to rule-samplng, cross-validation and (su-)bagging. International Workshop on Intelligent Information Acces --- IIIA 2006, 2006, France. ⟨hal-00113368⟩
  • Olivier Teytaud. Why Simulation-Based Approachs with Combined Fitness are a Good Approach for Mining Spaces of Turing-equivalent Functions. 2006, 12 p. ⟨hal-00113370⟩
  • Olivier Teytaud. How entropy-theorems can show that approximating high-dim Pareto-fronts is too hard. Bridging the Gap between Theory and Practice - Workshop PPSN-BTP, 2006, Reykjavik, Iceland. ⟨hal-00113362⟩
  • Sylvain Gelly, Sylvie Ruette, Olivier Teytaud. Comparison-based algorithms: worst-case optimality, optimality w.r.t a bayesian prior, the intraclass-variance minimization in EDA, and implementations with billiards. Parallel Problem Solving from Nature BTP-Workshop, Sep 2006, Reykjavik. ⟨inria-00112813⟩
  • Sylvain Gelly, Jérémie Mary, Olivier Teytaud. On the ultimate convergence rates for isotropic algorithms and the best choices among various forms of isotropy. Parallel Problem Solving from Nature, Sep 2006, Reykjavik. ⟨inria-00112816⟩
  • Olivier Teytaud, Sylvain Gelly. General lower bounds for evolutionary algorithms. Parallel Problem Solving from Nature, Sep 2006, Reykjavik. ⟨inria-00112820⟩
  • Sylvain Gelly, Jérémie Mary, Olivier Teytaud. Learning for stochastic dynamic programming. 11th European Symposium on Artificial Neural Networks (ESANN), Apr 2006, bruges Belgium. ⟨inria-00112796⟩
  • Anne Auger, Marc Schoenauer, Olivier Teytaud. Local and global oder 3/2 convergence of a surrogate evolutionary algorithm. GECCO - genetic and evolutionary computation conference, 2005, Washington, pp.857-864. ⟨inria-00000540⟩
  • Olivier Teytaud, Mohamed Jebalia, Anne Auger. Algorithms (X,sigma,eta) : quasi-random mutations for Evolution Strategies. Evolution Artificielle, 2005, Lille, France. 12 p. ⟨inria-00000544v2⟩
  • Sylvain Gelly, Olivier Teytaud. Bayesian networks : a better than frequentist approach for parametrization, and a more accurate structural complexity measure than the number of parameters. CAP, 2005, Nice, 16 p. ⟨inria-00000541⟩
  • Sylvain Gelly, Olivier Teytaud, Nicolas Bredeche, Marc Schoenauer. Apprentissage statistique et programmation génétique: la croissance du code est-elle inévitable ?. Conférence d'apprentissage, 2005, Nice, France. 16 p. ⟨inria-00000546v2⟩
  • Olivier Teytaud, Sylvain Gelly, Nicolas Bredeche, Marc Schoenauer. A Statistical Learning Theory Approach of Bloat. Genetic and Evolutionary Computation Conference, Jun 2005, Washington D.C. USA. ⟨inria-00000549⟩
  • Yann Bonnemay, Michèle Sebag, Olivier Teytaud. Convergence proofs, convergence rates and stopping criterions for multi-modal or multi-objective evolutionary algorithms. Evolution artificielle, 2005, Lille, France. 12 p. ⟨inria-00000545⟩
  • Sylvain Gelly, Jérémie Mary, Olivier Teytaud. Taylor-based pseudo-metrics for random process fitting in dynamic programming.. PDMIA, 2005, Lille, 16 p. ⟨inria-00000217⟩
  • David Coeurjolly, Frédéric Flin, Olivier Teytaud, Laure Tougne. Multigrid Convergence and Surface Area Estimation. Theoretical Foundations of Computer Vision "Geometry, Morphology, and Computational Imaging", 2003, Dagsthul, Germany. pp.101--119. ⟨hal-00185210⟩
  • David Coeurjolly, Isabelle Debled-Rennesson, Olivier Teytaud. Segmentation and Length Estimation of 3D Discrete Curves. Digital and Image Geometry: Advanced Lectures, 2001, Dagsthul, Germany. pp.295--313. ⟨inria-00100500v2⟩

Poster communications2 documents

  • Sandra Astete-Morales, Marie-Liesse Cauwet, Olivier Teytaud. Criteria and Convergence Rates in Noisy Optimization. Genetic and Evolutionary Computation Conference (GECCO 2015), Jul 2015, Madrid, Spain. 2015, ⟨10.1145/2739482.2764722⟩. ⟨hal-01217128v2⟩
  • Fabien Teytaud, Marc Schoenauer, Olivier Teytaud. Simple Tools for Multimodal Optimization. GECCO - 13th annual conference companion on genetic and evolutionary computation, Jul 2011, Dublin, Ireland. 2011, Proceedings of the 13th annual conference companion on genetic and evolutionary computation. ⟨hal-01406444⟩

Documents associated with scientific events2 documents

  • Jérémie Decock, Jean-Joseph Christophe, Olivier Teytaud. Optimization of Energy Policies Using Direct Value Search. 9èmes Journées Francophones de Planification, Décision et Apprentissage (JFPDA'14), May 2014, Liège, Belgium. 2014. ⟨hal-00997562⟩
  • Sandra Astete-Morales, Marie-Liesse Cauwet, Adrien Couetoux, Jérémie Decock, Jialin Liu, et al.. Noisy Optimization. Dagstuhl seminar 13271, 2013, Dagstuhl, Germany. 2013. ⟨hal-00844305⟩

Books1 document

  • Olivier Teytaud, Christophe Antonini, Pierre Borgnat, Annie Chateau, Edouard Lebeau. Mathématiques pour l'agrégation. Dunod, pp.736, 2007. ⟨inria-00173250⟩

Book sections6 documents

  • Bruno Bouzy, Tristan Cazenave, Vincent Corruble, Olivier Teytaud. Artificial Intelligence for Games. A Guided Tour of Artificial Intelligence Research : Volume II: AI Algorithms, Springer, pp.313-337, 2020, ⟨10.1007/978-3-030-06167-8_11⟩. ⟨hal-03118174⟩
  • Laurent Meunier, Yann Chevaleyre, Jeremy Rapin, Clément Royer, Olivier Teytaud. On Averaging the Best Samples in Evolutionary Computation. Parallel Problem Solving from Nature – PPSN XVI. PPSN 2020, pp.661-674, 2020, ⟨10.1007/978-3-030-58115-2_46⟩. ⟨hal-03135540⟩
  • Chang-Shing Lee, Mei-Hui Wang, Olivier Teytaud. Fuzzy Ontologies for the Game of Go. R. Seising, E. Trillas, C. Moraga, S. Termini. On Fuzziness. A Homage to Lotfi A. Zadeh, Springer, pp.367-372, 2012. ⟨hal-00758147⟩
  • Olivier Teytaud. Lower Bounds for Evolution Strategies. Anne Auger, Benjamin Doerr. Theory of Randomized Search Heuristics, 1, World Scientific, pp.327-354, 2011, Series on Theoretical Computer Science. ⟨inria-00593179v2⟩
  • Stéphane Lallich, Olivier Teytaud, Elie Prudhomme. Association rule interestingness: measure and statistical validation. Guillet, Hamilton. Quality measures in data mining, Springer, pp.25, 2006. ⟨hal-00113594⟩
  • Yann Guermeur, Olivier Teytaud. Estimation et contrôle des performances en généralisation des réseaux de neurones. Younes Bennani. Apprentissage Connexioniste, Hermès, pp.283, 2006, collection I2C. ⟨hal-00105953⟩

Preprints, Working Papers, ...6 documents

  • Evrard Garcelon, Baptiste Roziere, Laurent Meunier, Jean Tarbouriech, Olivier Teytaud, et al.. Adversarial Attacks on Linear Contextual Bandits. 2020. ⟨hal-02979184⟩
  • Pauline Bennet, Emmanuel Centeno, Jérémy Rapin, Olivier Teytaud, Antoine Moreau. The photonics and ARCoating testbeds in Nevergrad. 2020. ⟨hal-02613161⟩
  • Mamadou Aliou Barry, Vincent Berthier, Marie-Claire Cambourieux, Rémi Pollès, Bodo D. Wilts, et al.. Evolutionary algorithms converge towards evolved biological photonic structures. 2018. ⟨hal-01856961⟩
  • Olivier Bousquet, Sylvain Gelly, Karol Kurach, Marc Schoenauer, Michèle Sebag, et al.. Toward Optimal Run Racing: Application to Deep Learning Calibration. 2017. ⟨hal-01634381⟩
  • Veronique Ventos, Yves Costel, Olivier Teytaud, Solène Thépaut Ventos. Boosting a Bridge Artificial Intelligence. 2017. ⟨hal-01665867⟩
  • Cédric Hartland, Sylvain Gelly, Nicolas Baskiotis, Olivier Teytaud, Michèle Sebag. Multi-armed Bandit, Dynamic Environments and Meta-Bandits. 2006. ⟨hal-00113668⟩

Reports1 document

  • Sylvain Gelly, Yizao Wang, Rémi Munos, Olivier Teytaud. Modification of UCT with Patterns in Monte-Carlo Go. [Research Report] RR-6062, INRIA. 2006. ⟨inria-00117266v3⟩