HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

On the ultimate convergence rates for isotropic algorithms and the best choices among various forms of isotropy

Sylvain Gelly 1 Jérémie Mary 1 Olivier Teytaud 1
1 TANC - Algorithmic number theory for cryptology
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : In this paper, we show universal lower bounds for isotropic algorithms, that hold for any algorithm such that each new point is the sum of one already visited p oint plus one random isotropic direction multiplied by any step size (whenever the step size is chosen by an oracle with arbitrarily high computational power). The bound is 1 − O(1/d) for the constant in the linear convergence (i.e. the constant C such that the distance to the optimum after n steps is upp er b ounded by C n ), as already seen for some families of evolution strategies in [19, 12], in contrast with 1 − O(1) for the reverse case of a random step size and a direction chosen by an oracle with arbitrary high computational power. We then recall that isotropy does not uniquely determine the distribution of a sample on the sphere and show that the convergence rate in isotropic algorithms is improved by using stratified or antithetic isotropy instead of naive isotropy. We show at the end of the pap er that b eyond the mathematical proof, the result holds on exp eriments. We conclude that one should use antithetic-isotropy or stratified-isotropy, and never standard-isotropy.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

Contributor : Sylvain Gelly Connect in order to contact the contributor
Submitted on : Thursday, November 9, 2006 - 5:16:40 PM
Last modification on : Friday, February 4, 2022 - 3:23:02 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 10:04:10 PM


  • HAL Id : inria-00112816, version 1



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⟩



Record views


Files downloads