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

Log-linear Convergence and Optimal Bounds for the $(1+1)$-ES

Mohamed Jebalia 1 Anne Auger 1 Pierre Liardet 2
1 TANC - Algorithmic number theory for cryptology
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : The $(1+1)$-ES is modeled by a general stochastic process whose asymptotic behavior is investigated. Under general assumptions, it is shown that the convergence of the related algorithm is sub-log-linear, bounded below by an explicit log-linear rate. For the specific case of spherical functions and scale-invariant algorithm, it is proved using the Law of Large Numbers for orthogonal variables, that the linear convergence holds almost surely and that the best convergence rate is reached. Experimental simulations illustrate the theoretical results.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

Contributor : Anne Auger Connect in order to contact the contributor
Submitted on : Thursday, July 3, 2008 - 2:30:27 PM
Last modification on : Friday, February 4, 2022 - 3:13:09 AM
Long-term archiving on: : Friday, November 25, 2016 - 11:59:04 PM


Files produced by the author(s)




Mohamed Jebalia, Anne Auger, Pierre Liardet. Log-linear Convergence and Optimal Bounds for the $(1+1)$-ES. Evolution Artificielle, Oct 2007, Tours, France. pp.207-218, ⟨10.1007/978-3-540-79305-2⟩. ⟨inria-00173483v4⟩



Record views


Files downloads