arXiv AI By Tejaswi Gowda

Decompose, Don't Expand: Capability-Independent AI Systems by Construction

Read the original on arXiv AI →

The paper argues that many AI tasks can be split into a deterministic core and a fuzzy residue, and that decomposing tasks rather than expanding models yields a property called parity by construction—where model‑size no longer affects performance on the deterministic sub‑tasks. Across nine models ranging from 494 M to Opus‑class size, the authors show that once the deterministic context is resolved, operation selection and selector resolution scores become identical, while a non‑decomposable task (labelling) remains sensitive to model size. They present a general method for identifying decomposition points, constructing deterministic surfaces and grammars, and ensuring safe residues, and demonstrate the approach in physics, motion retargeting, object‑model editing, and a Web‑CLI tool. whyItMatters":"The study demonstrates that task decomposition can eliminate the need for model scaling or fine‑tuning, offering a systematic design discipline applicable across diverse AI domains."

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Computation and Language
Oct 15

Interlock: From Local Correctness to Task Completion in Long-Horizon Agents

Interlock is a framework that transforms long‑horizon tasks into typed completion graphs, linking evidence, decisions, and required effects through grounding, coupling, and realization edges. It compiles these graphs into a resettable workspace, a public request, and an evaluation rubric, and uses source‑coverage, public‑input, and agent‑as‑judge reviews to ensure that all mandatory requirements are met. Fine‑tuning Qwen3.6 backbones on Interlock‑generated trajectories improves pass rates on AutomationBench, JobBench, and Harvey LAB, showing that the synthesized experience benefits external task environments.

By Linji Hao, Yanji He, Zihan Wang, Hansi Yang, Jiayuan Zhang, Hongyan Hao, Qi Gu, Yan Feng, Han Wu
arXiv Computation and Language
Oct 23

SCOPE: Compiling Natural-Language Policies into Neurosymbolic Predicate Programs

SCOPE compiles natural‑language policies into neurosymbolic predicate programs that combine small neural models, deterministic extractors, and logical composition. The system is jointly optimized with adversarially generated counterexamples, achieving higher accuracy than prompt‑optimization, task‑decomposition, and workflow‑generation baselines on real‑world policy benchmarks. Programs trained with the weakest executor transfer to other models, enabling deployment on inexpensive models with stable, interpretable predictions.

By Arnon Mazza, Elad Levi