Structural bias in population-based algorithms
Anna V. Kononova, David W. Corne, Philippe De Wilde, Vsevolod, Shneer, Fabio Caraffini

TL;DR
This paper investigates structural bias in population-based algorithms, providing theoretical and empirical insights into how bias manifests and is influenced by population size and problem difficulty.
Contribution
It offers a novel theoretical analysis of structural bias, revealing how population size and problem difficulty affect bias in optimization algorithms.
Findings
Structural bias causes non-uniform clustering of populations.
Increasing population size can amplify existing structural bias.
Structural bias effects are more pronounced in difficult problems.
Abstract
Challenging optimisation problems are abundant in all areas of science. Since the 1950s, scientists have developed ever-diversifying families of black box optimisation algorithms designed to address any optimisation problem, requiring only that quality of a candidate solution is calculated via a fitness function specific to the problem. For such algorithms to be successful, at least three properties are required: an effective informed sampling strategy, that guides generation of new candidates on the basis of fitnesses and locations of previously visited candidates; mechanisms to ensure efficiency, so that same candidates are not repeatedly visited; absence of structural bias, which, if present, would predispose the algorithm towards limiting its search to some regions of solution space. The first two of these properties have been extensively investigated, however the third is little…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
