Skip to content

VICT: Verifier-Instrumented Credit Tracing for Long-Horizon LLM Agent Reinforcement Learning

Aug 2026 · 0 citations · 47 references
Computer Science

TL;DR

VICT (VerifierInstrumented Credit Tracing), a training-time interface that exposes executable or evidence backed atoms and traces them back to actions through dependency-valid proof edges, improves substantially over outcome-only training and achieves strong performance alongside recent fine-grained credit methods.

Abstract

Fine-grained credit assignment is a central challenge in reinforcement learning for long horizon LLM agents. Standard objectives often train from programmatically verifiable terminal rewards by broadcasting each sparse outcome to every action in a trajectory. Existing methods typically seek finer credit from the rollout side, constructing auxiliary trajectory signals or additional comparisons to estimate action importance. Although useful, these approaches still treat the verifier that judged success as a scalar reward, discarding its internal task structure. Our key insight is that many verifiable tasks already encode the relevant checks inside their terminal verifier. We propose VICT (VerifierInstrumented Credit Tracing), a training-time interface that exposes executable or evidence backed atoms and traces them back to actions through dependency-valid proof edges. VICT redistributes group-relative advantage only along those edges, shifting credit assignment from rollout-side inference to verifierside tracing. It preserves the original terminal reward, abstains when evidence is incomplete or ambiguous, and changes only the training-time advantage tensor, requiring no learned critic, process labels, branch rollouts, or inference-time verifier access. On ALFWorld and WebShop, VICT improves substantially over outcome-only training and achieves strong performance alongside recent fine-grained credit methods; ablations rule out dense atom rewards, final-commit credit, temporal proximity, and sparsity as sufficient explanations.

View source

Similar papers

Preprint Aug 2026

Teach the Magnitude, Not the Direction: Verifier-Bounded Credit Assignment for Multi-Turn Multi-step LLM Agents

A hierarchical credit assignment framework that retains RL's verifier-bounded ceiling while incorporating dense token-level signals from a privileged self-teacher is introduced, unlocking dense credit assignment without sacrificing the verifier-bounded ceiling.

Zechuan Wang, Siyuan Lu, Hongxuan Zhang et al. · 4 citations
#artificial intelligence Preprint Sep 2026

SWE-MILE: Asynchronous Potential-Induced Milestone Credit Assignment for Long-Horizon Software Engineering Agents

Long-horizon software engineering (SWE) agents trained with reinforcement learning with verifiable rewards (RLVR) typically receive only terminal outcome supervision, making it difficult to distinguish productive actions from redundant exploration or functional regressions. We propose SWE-MILE, an asynchronous potentia...

Chao-Qun Cui, Hao Zhou, Mei-Qi Chen et al. · 0 citations
Preprint Aug 2026

TRCA: Transition-wise Rubric Credit Assignment for Long-horizon LLM Agents

Transition-wise Rubric Credit Assignment (TRCA) is proposed, which derives step-level supervision directly from action-induced transitions without learned evaluators or successful anchors for long-horizon tasks with sparse successful anchors.

Huan-Xi Zhang, Ming-Ju Chen, Dongxu Zhou et al. · 7 citations
#artificial intelligence Preprint Sep 2026

DRACO: Fine-Grained Credit Assignment with Dynamic Rubrics for Long-Horizon Agent Training

This work proposes DRACO: Distributing Rubric-based Advantage for Credit Optimization, which generates rubrics dynamically during training to track the policy's evolving capability, scores those rubrics once per completed trajectory, and redistributes that judgment over the steps responsible for annotated rubrics to pr...

Shubham Gandhi, Saurabh Goyal, K. Kate et al. · 5 citations
#machine learning Preprint Sep 2026

Cross-Rollout Bellman Closure for Long-Horizon Agentic Reinforcement Learning

Cross-Rollout Bellman Closure (CRBC) is introduced, which merges each rollout group into a finite empirical process with absorbing success and failure boundaries and evaluates its behavior-policy Bellman fixed point with one linear solve.

Yang-Yang Ren, Hao-Dong Zhu, Lin-Lin Yang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Semifactual Credit-Augmented Policy Optimization

Reinforcement learning with verifiable rewards (RLVR) has improved the reasoning capabilities of large language models (LLMs), yet their predictions remain sensitive to task-irrelevant prompt features. We investigate this sensitivity through semifactual prompt interventions that preserve the underlying problem and its...

Jun-Shu Pan, Zhi-Zhang Fu, Shu-Lin Huang et al. · 0 citations

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.