Can compact optimisation algorithms be structurally biased?

Simple item page
dc.cclicenceCC-BY-NCen
dc.contributor.authorKononova, Anna V.
dc.contributor.authorCaraffini, Fabio
dc.contributor.authorWang, Hao
dc.contributor.authorBäck, Thomas
dc.date.acceptance2020-05-27
dc.date.accessioned2020-09-07T13:42:39Z
dc.date.available2020-09-07T13:42:39Z
dc.date.issued2020-08-31
dc.description.abstractIn the field of stochastic optimisation, the so-called structural bias constitutes an undesired behaviour of an algorithm that is unable to explore the search space to a uniform extent. In this paper, we investigate whether algorithms from a subclass of estimation of distribution algorithms, the compact algorithms, exhibit structural bias. Our approach, justified in our earlier publications, is based on conducting experiments on a test function whose values are uniformly distributed in its domain. For the experiment, 81 combinations of compact algorithms and strategies of dealing with infeasible solutions have been selected as test cases. We have applied two approaches for determining the presence and severity of structural bias, namely an (existing) visual and an (updated) statistical (Anderson-Darling) test. Our results suggest that compact algorithms are more immune to structural bias than their counterparts maintaining explicit populations. Both tests indicate that strong structural bias is found only in the cBFO algorithm, regardless of the choice of strategy of dealing with infeasible solutions, and cPSO with mirror strategy. For other test cases, statistical and visual tests disagree on some cases classified as having mild or strong structural bias: the former one tends to make harsher decisions, thus needing further investigation.en
dc.funderNo external funderen
dc.identifier.citationKononova A.V., Caraffini F., Wang H., Bäck T. (2020) Can Compact Optimisation Algorithms Be Structurally Biased?. In: Bäck T. et al. (eds) Parallel Problem Solving from Nature – PPSN XVI. PPSN 2020. Lecture Notes in Computer Science, vol 12269. Springer, Cham.en
dc.identifier.doihttps://doi.org/10.1007/978-3-030-58112-1_16
dc.identifier.isbn9783030581121
dc.identifier.urihttps://dora.dmu.ac.uk/handle/2086/20146
dc.language.isoenen
dc.peerreviewedYesen
dc.publisherSpringeren
dc.researchinstituteInstitute of Artificial Intelligence (IAI)en
dc.subjectstructural biasen
dc.subjectcompact algorithmen
dc.subjectcontinuous optimisationen
dc.subjectestimation of distribution algorithmen
dc.subjectinfeasible solutionen
dc.titleCan compact optimisation algorithms be structurally biased?en
dc.typeConferenceen

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
PPSN2020_FabioCaraffini_paper_146.pdf
Size:
577.62 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
4.2 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

School of Computer Science and Informatics