1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.NE2023★ 1 cited
An information-theoretic evolutionary algorithm
Arnaud Berny
We propose a novel evolutionary algorithm on bit vectors which derives from the principles of information theory. The information-theoretic evolutionary algorithm (it-EA) iterative…
cs.NE2021
Linear representation of categorical values
Arnaud Berny
We propose a binary representation of categorical values using a linear map. This linear representation preserves the neighborhood structure of categorical values. In the context o…
cs.NE2021
Affine OneMax
Arnaud Berny
A new class of test functions for black box optimization is introduced. Affine OneMax (AOM) functions are defined as compositions of OneMax and invertible affine maps on bit vector…