On the Limitations of the Univariate Marginal Distribution Algorithm to Deception and Where Bivariate EDAs might help

Abstract

We introduce a new benchmark problem called Deceptive Leading Blocks (DLB) to rigorously study the runtime of the Univariate Marginal Distribution Algorithm (UMDA) in the presence of epistasis and deception. We show that simple Evolutionary Algorithms (EAs) outperform the UMDA unless the selective pressure $μ/λ$ is extremely high, where $μ$ and $λ$ are the parent and offspring population sizes, respectively. More precisely, we show that the UMDA with a parent population size of $μ=Ω(\log n)$ has an expected runtime of $e^{Ω(μ)}$ on the DLB problem assuming any selective pressure $\fracμλ \geq \frac{14}{1000}$, as opposed to the expected runtime of $\mathcal{O}(nλ\log λ+n^3)$ for the non-elitist $(μ,λ)~\text{EA}$ with $μ/λ\leq 1/e$. These results illustrate inherent limitations of univariate EDAs against deception and epistasis, which are common characteristics of real-world problems. In contrast, empirical evidence reveals the efficiency of the bi-variate MIMIC algorithm on the DLB problem. Our results suggest that one should consider EDAs with more complex probabilistic models when optimising problems with some degree of epistasis and deception.