Maxime Larcher
YOU?
Author Swipe
Hardest Monotone Functions for Evolutionary Algorithms Open
In this paper we revisit the question how hard it can be for the $$(1+1)$$ Evolutionary Algorithm to optimize monotone pseudo-Boolean functions. By introducing a more pessimistic stochastic process, the partially-ordered evolutionar…
Hardest Monotone Functions for Evolutionary Algorithms Open
In this paper we revisit the question how hard it can be for the $(1+1)$ Evolutionary Algorithm to optimize monotone pseudo-Boolean functions. By introducing a more pessimistic stochastic process, the partially-ordered evolutionary algorit…
Self-adjusting population sizes for the (1,λ)-EA on monotone functions Open
We study the (1, λ)-EA with mutation rate c/n for c ≤ 1, where the population size is adaptively controlled with the (1 : s + 1)-success rule. Recently, Hevia Fajardo and Sudholt have shown that this setup with c = 1 is efficient on OneMax…
Gated recurrent neural networks discover attention Open
Recent architectural developments have enabled recurrent neural networks (RNNs) to reach and even surpass the performance of Transformers on certain sequence modeling tasks. These modern RNNs feature a prominent design pattern: linear recu…
OneMax is not the Easiest Function for Fitness Improvements Open
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 into problems for large $s$ if the fitness landscape is too …
Self-adjusting Population Sizes for the $(1, λ)$-EA on Monotone Functions Open
We study the $(1,λ)$-EA with mutation rate $c/n$ for $c\le 1$, where the population size is adaptively controlled with the $(1:s+1)$-success rule. Recently, Hevia Fajardo and Sudholt have shown that this setup with $c=1$ is efficient on \o…
View article: Solving Static Permutation Mastermind using $O(n \log n)$ Queries
Solving Static Permutation Mastermind using $O(n \log n)$ Queries Open
Permutation Mastermind is a version of the classical mastermind game in which the number of positions $n$ is equal to the number of colors $k$, and repetition of colors is not allowed, neither in the codeword nor in the queries. In this pa…
View article: Note on Long Paths in Eulerian Digraphs
Note on Long Paths in Eulerian Digraphs Open
Long paths and cycles in Eulerian digraphs have received a lot of attention recently. In this short note, we show how to use methods from [Knierim, Larcher, Martinsson, Noever, JCTB 148:125--148] to find paths of length $d/(\log d+1)$ in E…
View article: Solving Static Permutation Mastermind using $O(n \log n)$ Queries
Solving Static Permutation Mastermind using $O(n \log n)$ Queries Open
Permutation Mastermind is a version of the classical mastermind game in which the number of positions $n$ is equal to the number of colors $k$, and repetition of colors is not allowed, neither in the codeword nor in the queries. In this pa…
Maker-Breaker Games on Random Hypergraphs Open
In this paper, we study Maker-Breaker games on the random hypergraph $H_{n,s,p}$, obtained from the complete $s$-graph by keeping every edge independently with probability $p$. We determine the threshold probability for the property of Mak…