Procedural Refinement by LLM-driven Algorithmic Debugging for ARC-AGI-2 事件

Procedural Refinement by LLM-driven Algorithmic Debugging for ARC-AGI-2 arXiv:2603.20334v4 Announce Type: replace-cross Abstract: In high-complexity abstract reasoning, a system must infer a latent rule from a few examples or structured observations and apply it to unseen instances. LLMs can express such rules as programs, but ordinary conversation-based refinement is largely outcome-level: it observes that an answer or output is wrong without formally re-checking which abstraction, relation, o