Pith. sign in

REVIEW 10 cited by

Addressing the Abstraction and Reasoning Corpus via Procedural Example Generation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.07353 v1 pith:2LQLZG6O submitted 2024-04-10 cs.LG cs.AI

classification cs.LGcs.AI
keywords examplestaskexamplegivenhavingoriginaltaskstransformation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This work presents code to procedurally generate examples for the ARC training tasks. For each of the 400 tasks, an example generator following the transformation logic of the original examples was created. In effect, the assumed underlying distribution of examples for any given task was reverse engineered by implementing a means to sample from it. An attempt was made to cover an as large as reasonable space of possible examples for each task. That is, whenever the original examples of a given task may be limited in their diversity e.g. by having the dimensions of the grids, the set of symbols or number of objects constant or within tight bounds, even though the transformation does not require it, such constraints were lifted. Having access to not just a few examples per task, as the case for ARC, but instead very many, should enable a wide range of experiments that may be important stepping stones towards making leaps on the benchmark.

Discussion (0). Sign in to comment.

Forward citations

Cited by 10 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. TraceViT: Grounded Trace Supervision for Visual Abstract Reasoning

    cs.CV 2026-07 conditional novelty 6.0 of 10

    A looped visual transformer trained on program-derived intermediate grid milestones plus task-reference/object-workspace grounding reaches 67.8% pass@2 on ARC-AGI-1 and 24.3% on ARC-AGI-2.

  2. From Global to Factor-Wise Expert Composition in Discrete Diffusion Models

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Per-pixel confidence routing of discrete diffusion experts outperforms global scalar composition (SuperDiff, FKC, RNE) on ARC-AGI-style tasks, especially for complementary specialists.

  3. Modality-Driven Search with Holistic Trace Judging for ARC-AGI-2

    cs.AI 2026-06 unverdicted novelty 6.0 of 10

    A modality-driven search system with holistic trace judging for ARC-AGI-2 reaches 72.9% on the semi-private set and 76.1% on the public set, outperforming GPT-5.2 Pro and Gemini 3 Pro by 18.7 points while releasing full code.

  4. DiARC: Distinguishing Positive and Negative Samples Helps Improving ARC-like Reasoning Ability of Large Language Models

    cs.CL 2026-06 unverdicted novelty 6.0 of 10

    DiARC improves LLM performance on ARC-like tasks by fine-tuning on preference pairs of positive demonstrations and three classes of constructed negative samples.

  5. DiARC: Distinguishing Positive and Negative Samples Helps Improving ARC-like Reasoning Ability of Large Language Models

    cs.CL 2026-06 unverdicted novelty 6.0 of 10

    DiARC improves LLM performance on ARC-like benchmarks by constructing and training on preference pairs from three types of negative samples while keeping demonstrations fixed.

  6. Slots, Transitions, Loops: Learning Composable World Models for ARC

    cs.CV 2026-06 unverdicted novelty 6.0 of 10

    Loop-OWM uses color-prototype slots, demonstration-conditioned task summaries, and looped transitions to model ARC rules as visual-symbolic state changes and outperforms baselines on ARC-1 and ARC-2.

  7. One Step Forward and K Steps Back: Better Reasoning with Denoising Recursion Models

    cs.LG 2026-04 unverdicted novelty 6.0 of 10

    Denoising Recursion Models train multi-step noise reversal in looped transformers and outperform the prior Tiny Recursion Model on ARC-AGI.

  8. Recursive Vision Language Models for General Symbolic Reasoning

    cs.CV 2026-08 conditional novelty 5.0 of 10

    R-Qwen, a LoRA-adapted Qwen model that iteratively refines explicit candidate solutions under constraint projection, outperforms prior recursive models and zero-shot frontier LLMs on eight symbolic reasoning benchmarks.

  9. Channel-Wise MLPs Improve the Generalization of Recurrent Convolutional Networks

    cs.LG 2025-08 conditional novelty 5.0 of 10

    Adding a gated channel-wise MLP to a recurrent convolutional network raises median exact-match accuracy on 185 Re-ARC tasks from 78.75% to 92.19% in-distribution and from 2.34% to 14.58% on harder out-of-distribution tasks.

  10. Ling and Ring 2.6 Technical Report: Efficient and Instant Agentic Intelligence at Trillion-Parameter Scale

    cs.CL 2026-06 unverdicted novelty 4.0 of 10

    Technical report announcing Ling-2.6 and Ring-2.6 models with hybrid linear attention, evolutionary CoT, and KPop RL for efficient agentic intelligence at scale.

Pith tools