mlsanityData to 7 Oct 2026

ARC-GEN: A Mimetic Procedural Benchmark Generator for the Abstraction and Reasoning Corpus

arXiv 2511.00162 ↗First posted 31 Oct 2025cs.AI cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

The Abstraction and Reasoning Corpus remains one of the most compelling and challenging benchmarks for tracking progress toward achieving Artificial General Intelligence. In contrast to other evaluation datasets designed to assess an agent's task-specific skills or accumulated knowledge, the ARC-AGI suite is specifically targeted at measuring skill acquisition efficiency, a trait that has (so far) been lacking in even the most sophisticated machine learning systems. For algorithms that require extensive intra-task exemplars, a significant constraint imposed by ARC-AGI is the modest cardinality of its demonstration set, comprising a small number of langle input, output rangle grids per task specifying the corresponding transformation. To embellish the space of viable sample pairs, this paper introduces ARC-GEN, an open-source procedural generator aimed at extending the original ARC-AGI training dataset as faithfully as possible. Unlike prior efforts, our generator is both exhaustive (covering all four-hundred tasks) and mimetic (more closely honoring the distributional properties and characteristics embodied in the initial ARC-AGI-1 release). We also discuss the use of this generator in establishing a static benchmark suite to verify the correctness of programs submitted to the 2025 Google Code Golf Championship.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 46 of its 63 references that are in the map. First posted on arXiv 31 Oct 2025.

Builds on

46 of 63 references.

References · 46

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  3. 2021Program Synthesis with Large Language Modelscited by 3,509
  4. 2023SWE-bench: Can Language Models Resolve Real-World GitHub Issues?cited by 3,193
  5. 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 1,906
  6. 2022Competition-Level Code Generation with AlphaCodecited by 1,427
  7. 2024Chatbot Arena: An Open Platform for Evaluating LLMs by Human Preferencecited by 1,151
  8. 2022CodeGen: An Open Large Language Model for Code with Multi-Turn Program Synthesiscited by 876
  9. 2022PAL: Program-aided Language Modelscited by 635
  10. 2022InCoder: A Generative Model for Code Infilling and Synthesiscited by 492
  11. 2023LMSYS-Chat-1M: A Large-Scale Real-World LLM Conversation Datasetcited by 449
  12. 2024LiveBench: A Challenging, Contamination-Limited LLM Benchmarkcited by 242
34 more
  1. 2024FrontierMath: A Benchmark for Evaluating Advanced Mathematical Reasoning in AIcited by 227
  2. 2025ARC-AGI-2: A New Challenge for Frontier AI Reasoning Systemscited by 171
  3. 2017RobustFill: Neural Program Learning under Noisy I/Ocited by 124
  4. 2023Chain of Code: Reasoning with a Language Model-Augmented Code Emulatorcited by 120
  5. 2023Hypothesis Search: Inductive Reasoning with Language Modelscited by 119
  6. 2024WorldCoder, a Model-Based LLM Agent: Building World Models by Writing Code and Interacting with the Environmentcited by 99
  7. 2023The ConceptARC Benchmark: Evaluating Understanding and Generalization in the ARC Domaincited by 97
  8. 2024The Surprising Effectiveness of Test-Time Training for Few-Shot Learningcited by 88
  9. 2024CG-Bench: Clue-grounded Question Answering Benchmark for Long Video Understandingcited by 82
  10. 2024Dynamic-SUPERB Phase-2: A Collaboratively Expanding Benchmark for Measuring the Capabilities of Spoken Language Models with 180 Taskscited by 70
  11. 2022Top-Down Synthesis for Library Learningcited by 57
  12. 2024Visual Haystacks: A Vision-Centric Needle-In-A-Haystack Benchmarkcited by 53
  13. 2024Combining Induction and Transduction for Abstract Reasoningcited by 53
  14. 2024Code Repair with LLMs gives an Exploration-Exploitation Tradeoffcited by 50
  15. 2024How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmarkcited by 39
  16. 2021Communicating Natural Programs to Humans and Machinescited by 35
  17. 2024Reasoning Abilities of Large Language Models: In-Depth Analysis on the Abstraction and Reasoning Corpuscited by 32
  18. 2024H-ARC: A Robust Estimate of Human Performance on the Abstraction and Reasoning Corpus Benchmarkcited by 32
  19. 2024Addressing the Abstraction and Reasoning Corpus via Procedural Example Generationcited by 31
  20. 2025RefactorBench: Evaluating Stateful Reasoning in Language Agents Through Codecited by 28
  21. 2024Is Programming by Example solved by LLMs?cited by 27
  22. 2021Neural-guided, Bidirectional Program Search for Abstraction and Reasoningcited by 23
  23. 2024CodeIt: Self-Improving Language Models with Prioritized Hindsight Replaycited by 23
  24. 2024ProteinBench: A Holistic Evaluation of Protein Foundation Modelscited by 23
  25. 2024Speech Robust Bench: A Robustness Benchmark For Speech Recognitioncited by 20
  26. 2024Searching Latent Program Spacescited by 20
  27. 2022From Perception to Programs: Regularize, Overparameterize, and Amortizecited by 13
  28. 2023ANPL: Towards Natural Programming with Interactive Decompositioncited by 13
  29. 2024Neural networks for abstraction and reasoning: Towards broad generalization in machinescited by 13
  30. 2023Large Language Model (LLM) as a System of Multiple Expert Agents: An Approach to solve the Abstraction and Reasoning Corpus (ARC) Challengecited by 11
  31. 2024Towards Efficient Neurally-Guided Program Induction for ARC-AGIcited by 11
  32. 2023A Neurodiversity-Inspired Solver for the Abstraction & Reasoning Corpus (ARC) Using Visual Imagery and Program Synthesiscited by 9
  33. 2023Solving ARC visual analogies with neural embeddings and vector arithmetic: A generalized methodcited by 8
  34. 2024Do Large Language Models Solve ARC Visual Analogies Like People Do?cited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 7.

8 papers.