Model complexity vs. performance in the Bayesian Optimization Algorithm

Correa, ES ORCID: 0000-0002-5122-4384 and Shapiro, JL 2006, Model complexity vs. performance in the Bayesian Optimization Algorithm , in: Parallel Problem Solving from Nature - PPSN IX, September 9-13 2006, Reykjavik, Iceland.

Full text not available from this repository. (Request a copy)

Abstract

The Bayesian Optimization Algorithm (BOA) uses a Bayesian network to estimate the probability distribution of promising solutions to a given optimization problem. This distribution is then used to generate new candidate solutions. The objective is to improve the population of candidate solutions by learning and sampling from good solutions. A Bayesian network (BN) is a graphical representation of a probability distribution over a set of variables of a given problem domain. The number of topological states that a BN can create depends on a parameter called maximum allowed indegree. We show that the value of the maximum allowed indegree given to the Bayesian network used by the BOA strongly affects the performance of this algorithm. Furthermore, there is a limited set of values for this parameter for which the performance of the BOA is maximized.

Item Type: Conference or Workshop Item (Paper)
Schools: Schools > School of Computing, Science and Engineering > Salford Innovation Research Centre (SIRC)
Journal or Publication Title: Parallel Problem Solving from Nature - PPSN IX
Publisher: Springer
ISSN: 0302-9743
Depositing User: Dr Elon Correa
Date Deposited: 10 Feb 2017 15:12
Last Modified: 21 Sep 2017 09:41
URI: http://usir.salford.ac.uk/id/eprint/41384

Actions (login required)

Edit record (repository staff only) Edit record (repository staff only)