Alistair Benford presenting our NeurIPS paper on runtime analysis of co-evolutionary algorithms applied to combinatorial games. Although the strategy space is exponentially large, the algorithm learns to play optimally in expected quadratic time. openreview.net/forum?id=wWS...

Learning in games usually assumes small action spaces. This afternoon at #AAAI2025 we give an oral presentation showing that the PDCoEA co-evolutionary algorithm finds the Nash Equilibrium of the game below (2^n actions) in expected poly(n) time. Joint work with Shishen Lin.

Reinforcement learning gathering a crowd at #AAAI