M. Larcher

activity

20192023

most citedGated recurrent neural networks discover attention

3 citations · 3 across the 6 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

cs.NE2022

OneMax is not the Easiest Function for Fitness Improvements

Marc Kaufmann, Maxime Larcher, Johannes Lengler +1

We study the $(1 : s + 1)$ success rule for controlling the population size of the $(1, λ)$ -EA. It was shown by Hevia Fajardo and Sudholt that this parameter control mechanism can run i…

cs.NE2022

Self-adjusting Population Sizes for the $(1, λ)$ -EA on Monotone Functions

Marc Kaufmann, Maxime Larcher, Johannes Lengler +1

We study the $(1, λ)$ -EA with mutation rate $c / n$ for $c \leq 1$ , where the population size is adaptively controlled with the $(1 : s + 1)$ -success rule. Recently, Hevia Fajardo and Sudho…

OneMax is not the Easiest Function for Fitness Improvements

Self-adjusting Population Sizes for the (1,λ)-EA on Monotone Functions

Self-adjusting Population Sizes for the $(1, λ)$ -EA on Monotone Functions