38 citations · 141 across the 22 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.NE2024
A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games
Alistair Benford, Per Kristian Lehre
Due to their complex dynamics, combinatorial games are a key test case and application for algorithms that train game playing agents. Among those algorithms that train using self-p…
cs.NE2024
Overcoming Binary Adversarial Optimisation with Competitive Coevolution
Per Kristian Lehre, Shishen Lin
Co-evolutionary algorithms (CoEAs), which pair candidate designs with test cases, are frequently used in adversarial optimisation, particularly for binary test-based problems where…
cs.NE2024
Concentration Tail-Bound Analysis of Coevolutionary and Bandit Learning Algorithms
Per Kristian Lehre, Shishen Lin
Runtime analysis, as a branch of the theory of AI, studies how the number of iterations algorithms take before finding a solution (its runtime) depends on the design of the algorit…