DiscoGen: Procedural Generation of Algorithm Discovery Tasks in Machine Learning
On the map: Deep reinforcement learning methods → RL training of language and agent models
Abstract (arXiv)
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 billions 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 fixed, small subset of DiscoGen tasks for principled evaluation of ADAs. Finally, we propose a number of ambitious, impactful research directions enabled by DiscoGen, and demonstrate its use for ADA optimisation through scaling experiments for automated prompt tuning. DiscoGen is released open-source at https://github.com/AlexGoldie/discogen.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Placed in RL training of language and agent models, one of 15 directions in Deep reinforcement learning methods. First posted on arXiv 18 Mar 2026.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026Recursive self-improvement of AI research agentscited by 11
- 2026Heuresis: Search Strategies for Autonomous AI Research Agents Across Quality, Diversity and Noveltycited by 2
- 2026Fork-and-Flush: Escaping Idea Basins in Autoresearch Agentscited by 1
- 2026Learning What to Investigate Next: Meta-Reasoning for Long-Horizon Research Agentscited by 0
- 2026Kernel Autoresearch for Open-Ended Model Discoverycited by 0
- 2026Kernel Autoresearch for Open-Ended Model Discovery7 Oct 2026
- 2026Fork-and-Flush: Escaping Idea Basins in Autoresearch Agents5 Oct 2026
- 2026Learning What to Investigate Next: Meta-Reasoning for Long-Horizon Research Agents1 Oct 2026
- 2026Recursive self-improvement of AI research agents22 Sep 2026
- 2026Heuresis: Search Strategies for Autonomous AI Research Agents Across Quality, Diversity and Novelty23 Jun 2026
Similar, not cited
Close in wording, no citation either way
- 2024Toward Automated Algorithm Design: A Survey and Practical Guide to Meta-Black-Box-Optimization
- 2026AdaGen: Learning Adaptive Policy for Image Synthesis
- 2024DISCO: Efficient Diffusion Solver for Large-Scale Combinatorial Optimization Problems
- 2026Breaking the Solver Bottleneck: Training Task Generators at the Learnable Frontier
- 2024Deep Reinforcement Learning for Dynamic Algorithm Selection: A Proof-of-Principle Study on Differential Evolution
- 2026RLDISCOVER: LLM-driven co-evolution of reinforcement learning algorithms
- 2024Discovering Preference Optimization Algorithms with and for Large Language Models
- 2026Understanding the Challenges in Iterative Generative Optimization with LLMs