Poster Tue, Jul 7, 2026 • 10:30 AM – 12:15 PM KST Coex: HALL A

Procedural Generation Of Algorithm Discovery Tasks in Machine Learning

Alexander D. Goldie ⋅ Zilin Wang ⋅ Adrian Hayler ⋅ Deepak Nathani ⋅ Edan Toledo ⋅ Aleksandra Kalisz ⋅ Ken Thampiratwong ⋅ Michael Beukman ⋅ Alistair Letcher ⋅ Shashank Reddy Chirra ⋅ Clarisse Wibault ⋅ Theo Wolf ⋅ Charles O'Neill ⋅ Uljad Berdica ⋅ Nicholas Roberts ⋅ Saeed Rahmani ⋅ Roberta Raileanu ⋅ Shimon Whiteson ⋅ Jakob Foerster

Abstract

Automating the development of machine learning algorithms has the potential to unlock new breakthroughs. However, our ability to improve and evaluate algorithm discovery systems has thus far been limited by existing task suites. They suffer from many issues, such as: poor evaluation methodologies; data contamination; and containing saturated or very similar problems. Here, we introduce DiscoGen, a procedural generator of algorithm discovery tasks for machine learning, such as developing optimisers for reinforcement learning or loss functions for image classification. Motivated by the success of procedural generation in reinforcement learning, DiscoGen spans millions of tasks of varying difficulty and complexity from a range of machine learning fields. These tasks are specified by a small number of configuration parameters and can be used to optimise algorithm discovery agents (ADAs). We present DiscoBench, a benchmark consisting of a fixed, small subset of DiscoGen tasks for principled evaluation of ADAs. Finally, we propose a number of ambitious, impactful research directions enabled by DiscoGen, in addition to experiments demonstrating its use for prompt optimisation of an ADA. DiscoGen is released open-source.