Skip to content

Steer, Don't Solve: Training Small Critic Models for Large Code Agents

Jun 2026 · arXiv.org · Vol abs/2606.21811 · 0 citations · 35 references
Computer Science

TL;DR

A separate critic model that is specialized in high-level planning to steer the coding agent in inference and reduce the total inference costs for some coding agents by solving tasks in fewer steps is trained.

Abstract

Coding tasks are typically complicated and require multiple capabilities, ranging from high-level planning to low-level implementation. While coding agents are optimized for the joint capabilities, individual capabilities such as high-level planning may have different optima and remain a major bottleneck. To address this challenge, we train a separate critic model that is specialized in high-level planning to steer the coding agent in inference. We construct SFT and DPO data to train the critic model to identify errors made by the coding agent and provide correct and clear high-level guidance without generating concrete actions. Experiments show that our fine-tuned 4B and 8B critic models significantly improve the performance of 6 larger coding agents (e.g., improving the resolved rates of GLM-4.7-Flash-30B-A3B and GPT-OSS-120B by 16.0% and 14.4% on SWE-Bench Verified). The critic model also reduces the total inference costs for some coding agents by solving tasks in fewer steps (e.g., reducing the per-example inference cost for GPT-OSS-20B from \$0.07 to \$0.03). Code: https://github.com/shubhamrgandhi/critic-training

View source

Similar papers

Preprint Aug 2026

Decoupling Planning and Control for Instructable Agents

The decoupled approach consistently outperforms controller-only and direct VLM action-generation variants, preserves fast control, and lets us swap in different pretrained VLM planners without fine-tuning, while remaining competitive with strong vision-language-action and multi-agent RL baselines on six of seven tasks.

Zineng Tang, Kelsey Allen, Sjoerd van Steenkiste et al. · 0 citations
Preprint Sep 2026

An Unexpected Robot Policy: Early Evaluations of GPT-6 Astra on RoboDojo and Beyond

Embodied AI systems are often organized into System 1 and System 2. System 1 is typically a pretrained policy that generates actions at high frequency, whereas System 2 is often instantiated as a vision-enabled language model for high-level planning. We ask whether a large language model (LLM) can act as the policy for...

Wen-Bo Zhang, Kai-Xuan Wang, Yu-Tao Ouyang et al. · 15 citations · ⚡2
Preprint Aug 2026

$\tau_0$-VLA: a Hierarchical Robot Foundation Model with World-Model-Guided Test-Time Computation

Across in-domain and distribution-shifted settings, allocating additional test-time computation substantially improves next-subtask prediction accuracy, and these gains translate into higher closed-loop success on long-horizon robot manipulation tasks.

Xiaowei Cai, Yunuo Cai, Bing Chen et al. · 4 citations · ⚡1
#artificial intelligence Preprint Sep 2026

CodeActionBench: Evaluating Agentic Code-as-Policy for Embodied Manipulation

CodeActionBench is introduced, a benchmark of 25 manipulation tasks that evaluates this capability through agentic Code-as-Policy and provides a controlled testbed for measuring how general-purpose models translate their capabilities into manipulation behavior and for examining typical failure scenarios in that process...

Yiheng Lyu, Xueying Jiang, Wen-Hao Li et al. · 0 citations
#small language model Preprint Sep 2026

MINERVA: How Small Can a Manipulation Policy Be and Still Solve LIBERO?

Vision-language-action (VLA) models with billions of parameters now dominate the LIBERO manipulation benchmark, but the model capacity actually required by the benchmark remains unclear. We introduce MINERVA (MINimal Efficient Robotic Vision-Action policy), a family of deliberately compact visuomotor policies designed...

Kohei Sendai, T. Matsushima, Yusuke Iwasawa · 3 citations · ⚡1
#natural language process... Preprint Aug 2026

A^2Agent: Action-Aware Reinforcement Learning for Repository-Level Code Localization Agents

An action-aware reinforcement learning method that combines a per-turn reward sequence rewarding both the discovery and commitment of gold code regions with an action-level advantage estimation scheme that isolates each action's credit by grouping turns sharing the same exploration context is proposed.

Doyeon Kim, Suyoung Bae, Yu-Min Lee et al. · 1 citation

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.