Olivier Teytaud

 A few ressources :

• book reviews "aléatoire et presqu'aléatoire en IA"
• book reviews "logique"
• book reviews "Life at small scale"
• Vulgarisation
• le compte-rendu des JAF'05 et ModèlesFinis'05 en word et en PDF (PDF moins à jour peut-etre, mais avec des plus jolies formules)
• Source codes. No warranty and 100% free. Please feel free of asking for some help - it will be a pleasure to see that these source codes can help someone :-) I've decided to make all my future source codes available ; they might be provided in a very _not_ user-friendly form, but it will be a pleasure to help anyone to use it for any application. Even very easy-to-code programs are provided for the sake of comparison and to help the readability of articles refering to these source codes.
  • a dynamic programimng environnement
  • UNLEO and its makefile (non-linear expensive optimization, quite slow above 20 points in dimension 2 or 3).
  • many evolution strategies and derivative-free-optimization (in the sgLibrary.tar.gz file)
  • mrt.m a octave/matlab program for multivariate regression trees.
  • plotqhull.m a octave/matlab program for plotting points on the sphere (assumes that the sphere has center 0) ; generate eps-files.
  • getSimplex.m a octave-program (probably Matlab-compatible) for generating regular simplices in dimension $d$.
  • getArea.m a octave- or matlab- program for computing the area of the convex hull of a finite set of points (in any dimension)
  • evaluateQualityPointSet.m an Octave source code (probably matlab-compliant) that evalutes the quality of a point set for quasi-Monte-Carlo integration (very simple source code ; provided for convenience and for the sake of comparison).
  • scrambledHalton.tgz an Octave source code for scrambled-Halton data-sets
  • scrambledHalton10000_50.txt 10 000 Scrambled-Halton points in dimension 50. As the ith coordinate of the nth point does not depend on the dimension, you can pick submatrices for sequences of lower dimension or lower number of points.
  • qmc.tgz contains qmc.m and its subroutines ; octave source codes for generating point sets with low dispersion (i.e. : good points on a sphere) --- not optimized at all, only required as a subroutine for other programs ; much faster is possible
  • ldgps.tgz contains a very simple octave code that generates a low dispersion gaussian point set (i.e., mapping to the gaussian low of a low dispersion point set in [0,1]^d
  • XSE.tgz contains XSE.m and its subroutines ; octave source codes for a derandomized evolution strategy ; explanation here in pdf
  • optimiseur.m (requires qmc above) ; octave source codes for a Newton-inspired evolution strategy ; explanation here in pdf
  • octaveProfile (csh script) : the shortest profiler for Octave only counts the number of times a line is run, works only on simple octave programs (I know, I should be ashamed of such a code, but it is helpful for me)
  • some games in html for computer/children ; Octave version available also for people interested in interfacing them with RL-learning (C++ converter in progress for inclusion in the progDyn-project)