3 citations · 3 across the 6 of their papers we have counts for
8 papers
Hardest Monotone Functions for Evolutionary Algorithms
Marc Kaufmann, Maxime Larcher, Johannes Lengler +1
In this paper we revisit the question how hard it can be for the Evolutionary Algorithm to optimize monotone pseudo-Boolean functions. By introducing a more pessimistic sto…
Gated recurrent neural networks discover attention
Nicolas Zucchet, Seijin Kobayashi, Yassir Akram +4
Recent architectural developments have enabled recurrent neural networks (RNNs) to reach and even surpass the performance of Transformers on certain sequence modeling tasks. These…
OneMax is not the Easiest Function for Fitness Improvements
Marc Kaufmann, Maxime Larcher, Johannes Lengler +1
We study the success rule for controlling the population size of the -EA. It was shown by Hevia Fajardo and Sudholt that this parameter control mechanism can run i…
Self-adjusting Population Sizes for the -EA on Monotone Functions
Marc Kaufmann, Maxime Larcher, Johannes Lengler +1
We study the -EA with mutation rate for , where the population size is adaptively controlled with the -success rule. Recently, Hevia Fajardo and Sudho…
Note on Long Paths in Eulerian Digraphs
Charlotte Knierim, Maxime Larcher, Anders Martinsson
Long Paths and Cycles in eulerian digraphs have gotten a lot of attention recently. In this short note, we show how to use methods from Knierim, Larcher, Martinsson, Noever (2021)…
Solving Static Permutation Mastermind using Queries
Maxime Larcher, Anders Martinsson, Angelika Steger
Permutation Mastermind is a version of the classical mastermind game in which the number of positions is equal to the number of colors , and repetition of colors is not allo…
Maker-Breaker Games on Random Hypergraphs
Maxime Larcher
In this paper, we study Maker-Breaker games on the random hypergraph , obtained from the complete -graph by keeping every edge independently with probability . We…
Long Cycles, Heavy Cycles and Cycle Decompositions in Digraphs
Charlotte Knierim, Maxime Larcher, Anders Martinsson +1
Hajós conjectured in 1968 that every Eulerian \(n\)-vertex graph can be decomposed into at most edge-disjoint cycles. This has been confirmed for some spec…