[Paper] Slots, Transitions, Loops: Learning Composable World Models for ARC
Source: arXiv - 2606.12316v1
Overview
ARC tests in-context rule induction: given a few input-output demonstrations, a model must infer the hidden rule and apply it to a new query. While many approaches express ARC rules through language, code, or symbolic programs, ARC itself is visual-symbolic: rules appear as grid transitions over objects, colors, shapes, and spatial relations. We introduce Loop-OWM, an object-centric world-modeling architecture that learns these rules as composable transitions over structured states. It combines color-prototype slots, demonstration-conditioned task summaries, and a looped transition model with dense propagation and slot-conditioned correction. On both ARC-1 and ARC-2, Loop-OWM outperforms non-looped and looped baselines with comparable or fewer parameters. These results suggest that ARC rules can be learned not only as language descriptions or searched programs, but also as transitions over visual-symbolic world states.
Key Contributions
This paper presents research in the following areas:
- cs.CV
Methodology
Please refer to the full paper for detailed methodology.
Practical Implications
This research contributes to the advancement of cs.CV.
Authors
- Gege Gao
- Bernhard Schölkopf
- Andreas Geiger
Paper Information
- arXiv ID: 2606.12316v1
- Categories: cs.CV
- Published: June 10, 2026
- PDF: Download PDF