Pretraining and Test-Time Training Budgets Matter for ARC: A Controlled Study of VARC and TRM
cs.LG, cs.AI
Submitted: 2026-10-09
Updated: 2026-10-09
Comments: Accepted at BNAIC/BeNeLearn 2026
Code: https://github.com/AdrienDeliege/arc-training-budgets
License: http://creativecommons.org/licenses/by/4.0/
The gist: The Abstraction and Reasoning Corpus (ARC) is increasingly used to evaluate whether neural networks can infer task-specific transformations from few demonstrations.
Abstract
The Abstraction and Reasoning Corpus (ARC) is increasingly used to evaluate whether neural networks can infer task-specific transformations from few demonstrations. Recent ARC models differ in architecture, but also in broader training and evaluation protocols, including pretraining data, data augmentation, test-time setup, and optimization budgets, making conclusions about architecture benefits debatable. In this work, we study how the performance of the vision-inspired VARC and recursion-based TRM models is affected by pretraining and test-time training (TTT) budgets under a common inductive protocol on ARC-AGI-1. We cross five pretraining budgets with four TTT budgets for each test task. Each budget specifies a task-variant count and total sample presentations, defining the controlled training budgets. We observe that increasing TTT sample presentations improves the standard ARC pass@2 metric in all settings for both models. Increasing the TTT task-variant count consistently helps only TRM, whereas VARC often performs better with fewer variants. VARC also remains competitive without pretraining, while TRM benefits much more from it. These results show that pretraining and TTT budgets affect ARC evaluation and motivate reporting at comparable budgets.
Sources
- Addressing the Abstraction and Reasoning Corpus via Procedural Example Generation
- Less is More: Recursive Reasoning with Tiny Networks
- Bongards at the Boundary of Perception and Reasoning: Programs or Language?
- ARC-AGI Without Pretraining
- LoopViT: Scaling Visual ARC with Looped Transformers
- Hierarchical Reasoning Model
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks