DeepAI AI Chat
Log In Sign Up

Theoretical Study of Optimizing Rugged Landscapes with the cGA

by   Tobias Friedrich, et al.
Hasso Plattner Institute
The University of Adelaide

Estimation of distribution algorithms (EDAs) provide a distribution - based approach for optimization which adapts its probability distribution during the run of the algorithm. We contribute to the theoretical understanding of EDAs and point out that their distribution approach makes them more suitable to deal with rugged fitness landscapes than classical local search algorithms. Concretely, we make the OneMax function rugged by adding noise to each fitness value. The cGA can nevertheless find solutions with n(1 - ϵ) many 1s, even for high variance of noise. In contrast to this, RLS and the (1+1) EA, with high probability, only find solutions with n(1/2+o(1)) many 1s, even for noise with small variance.


page 1

page 2

page 3

page 4


NILS: a Neutrality-based Iterated Local Search and its application to Flowshop Scheduling

This paper presents a new methodology that exploits specific characteris...

Search Process and Probabilistic Bifix Approach

An analytical approach to a search process is a mathematical prerequisit...

The Fundamental Theorem of Natural Selection

Suppose we have n different types of self-replicating entity, with the p...

High Probability Bounds for Stochastic Subgradient Schemes with Heavy Tailed Noise

In this work we study high probability bounds for stochastic subgradient...

Population Control meets Doob's Martingale Theorems: the Noise-free Multimodal Case

We study a test-based population size adaptation (TBPSA) method, inspire...

The Neighbours' Similar Fitness Property for Local Search

For most practical optimisation problems local search outperforms random...