arXiv AI

2.5-D Decomposition for LLM-Based Spatial Construction

arXiv:2605. 07066v3 Announce Type: replace Abstract: Autonomous systems that build structures from natural-language instructions need reliable spatial reasoning, yet large language models (LLMs) make systematic coordinate errors when generating three-dimensional block placements.

arXiv AI
Sep 16

Ave: Guiding Agentic GPU Optimization Using Data-Flow Invariants

arXiv:2604.18616v2 Announce Type: replace-cross Abstract: LLM coding agents can generate correct GPU kernels, but their performance still trails expert libraries. Reaching peak throughput requires co...

By Haohui Mai, Xiaoyan Guo, Xiangyun Ding, Daifeng Li, Qiuchu Yu, Chenzhun Guo, Cong Wang, Jiacheng Zhao, Christos Kozyrakis, Binhang Yuan
arXiv AI
4d ago

An Exact Generate - Transform Decomposition of Small-LLM Team Scaling Across Orchestration Architectures

The paper investigates how scaling a team of small language‑model agents affects performance across different orchestration architectures. By testing eight architectures on five short‑answer benchmarks and an executable‑code benchmark, it finds that team scaling yields large gains on arithmetic word‑problem tasks but only modest improvements on multiple‑choice and code generation tasks, with no single architecture dominating all tasks. The authors explain these patterns using a generate‑transform decomposition that separates coverage and transformation effects, showing that arithmetic tasks benefit from both coverage and critic‑guided transformation, while other tasks are limited by saturation or poor conversion.

By Blaz Bertalanic, Carolina Fortuna
arXiv AI
Sep 25

Operator Packages, Proposer Strength, and Construction-Family Plateaus in Office-Scale Verified Search

The paper reports on a large‑scale verified search experiment using a 30B language model on a laptop, evaluating three operator packages—schematic notebooks, named obstacles, and behavioural repulsion—in a factorial design across nine construction problems. Results show that the full composition of operators closes the seed‑to‑record gap more effectively than any single component, increases construction‑hash diversity, and that memory plus repulsion consistently avoids collapse. A frontier proposer achieves similar gains in far fewer samples, but the search ultimately stalls near a plateau where the reference family is adopted and optimized only when provided as code.

By Roberto I. Ono Filho
Hugging Face Trending Papers
Aug 4

Can LLM design high-quality experiments? A Comprehensive and Systematic Benchmark on Autonomous Experimental Design

AI for Research (AI4Research) leverages AI to automate and improve scientific workflows. While experimental design is a critical stage of the research process, prior work has focused primarily on code implementation and execution, overlooking the importance of this stage, and no benchmark exists to evaluate AI's ability to conduct systematic experiment design.

arXiv Computation and Language
Aug 25

The Plan, Not the Decoder: Diagnosing and Repairing Compositional Failure in Reasoning-Augmented Text-to-Image Generation

The paper investigates why reasoning‑augmented text‑to‑image models like GoT‑R1 sometimes fail on compositional prompts. By separating the explicit textual plan from the decoder, the authors show that the decoder faithfully executes the plan while the planner often writes incorrect spatial relations, especially for phrasing‑dependent cues. Editing or replacing the plan improves image quality without retraining, demonstrating the viability of modular planner‑decoder architectures.

By Ashritha Gonuguntla
arXiv AI
Jul 9

Cost-Effective Agent Harnesses for Abstract Reasoning and Generalization on ARC-AGI-1

arXiv:2607. 06764v1 Announce Type: new Abstract: Recent progress on ARC-AGI-1 from disclosed architectures has come broadly from two regimes: heavy test-time compute over frontier models (evolutionary search, exhaustive sampling, extended chain-of-thought), or benchmark-specific training in which small models are fine-tuned on ARC data, often with task-specialized architectures.

By Kabir Moghe, Peter Chin