LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : Many elds rely on some stochastic sampling of a given com- plex space. Low-discrepancy sequences are methods aim- ing at producing samples with better space-lling properties than uniformly distributed random numbers, hence allow- ing a more ecient sampling of that space. State-of-the-art methods like nearly orthogonal Latin hypercubes and scram- bled Halton sequences are congured by permutations of in- ternal parameters, where permutations are commonly done randomly. This paper proposes the use of evolutionary al- gorithms to evolve these permutations, in order to optimize a discrepancy measure. Results show that an evolution- ary method is able to generate low-discrepancy sequences of signicantly better space-lling properties compared to sequences congured with purely random permutations.
https://hal.inria.fr/inria-00386475 Contributor : Olivier TeytaudConnect in order to contact the contributor Submitted on : Thursday, May 21, 2009 - 10:15:49 PM Last modification on : Sunday, June 26, 2022 - 11:49:54 AM Long-term archiving on: : Monday, October 15, 2012 - 10:51:22 AM
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⟩