Level-Based Analysis of the Population-Based Incremental Learning Algorithm

06/05/2018
by   Per Kristian Lehre, et al.
6

The Population-Based Incremental Learning (PBIL) algorithm uses a convex combination of the current model and the empirical model to construct the next model, which is then sampled to generate offspring. The Univariate Marginal Distribution Algorithm (UMDA) is a special case of the PBIL, where the current model is ignored. Dang and Lehre (GECCO 2015) showed that UMDA can optimise LeadingOnes efficiently. The question still remained open if the PBIL performs equally well. Here, by applying the level-based theorem in addition to Dvoretzky--Kiefer--Wolfowitz inequality, we show that the PBIL optimises function LeadingOnes in expected time O(nλλ + n^2) for a population size λ = Ω( n), which matches the bound of the UMDA. Finally, we show that the result carries over to BinVal, giving the fist runtime result for the PBIL on the BinVal problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/26/2018

Level-Based Analysis of the Univariate Marginal Distribution Algorithm

Estimation of Distribution Algorithms (EDAs) are stochastic heuristics t...
research
02/02/2018

Improved Runtime Bounds for the Univariate Marginal Distribution Algorithm via Anti-Concentration

Unlike traditional evolutionary algorithms which produce offspring via g...
research
07/29/2019

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

We introduce a new benchmark problem called Deceptive Leading Blocks (DL...
research
03/31/2017

Upper Bounds on the Runtime of the Univariate Marginal Distribution Algorithm on OneMax

A runtime analysis of the Univariate Marginal Distribution Algorithm (UM...
research
04/19/2019

Runtime Analysis of the Univariate Marginal Distribution Algorithm under Low Selective Pressure and Prior Noise

We perform a rigorous runtime analysis for the Univariate Marginal Distr...
research
07/29/2014

Level-based Analysis of Genetic Algorithms and other Search Processes

Understanding how the time-complexity of evolutionary algorithms (EAs) d...
research
03/06/2023

Efficiency of the Multisection Method

We study the efficiency of the multisection method for univariate nonlin...

Please sign up or login with your details

Forgot password? Click here to reset