paper-with-me

Papers

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

2026-08-13 · Zechuan Wang, Siyuan Lu, Hongxuan Zhang, Linjian Mo, Chenyi Zhuang, Leilei Gan arxiv

Reinforcement learning with verifiable rewards (RLVR) offers a verifier-bounded performance ceiling for training multi-turn tool-use agents, yet its trajectory-level credit assignment conflates heterogeneous per-turn outcomes into a single reward signal. On-policy distillation provides dense per-token supervision but is either teacher-bounded or prone to gradient concentration collapse. We introduce $\textbf{CrEST}$, a hierarchical credit assignment framework that retains RL's verifier-bounded ceiling while incorporating dense token-level signals from a privileged self-teacher. $\textbf{CrEST}$ resolves credit at two levels: turn-segmented verified advantages address inter-turn dilution, while entropy-gated self-teacher modulation refines intra-turn token contributions. Experiments on BFCL V3 and WildToolBench show that $\textbf{CrEST}$ consistently outperforms both RL and distillation baselines across two model scales, with the largest gains on long-trajectory and strict session-level metrics. Our work demonstrates that the teacher's role in policy optimization can be reduced from determining update directions to modulating update magnitudes, unlocking dense credit assignment without sacrificing the verifier-bounded ceiling.

📄 PDF Abstract BibTeX arXiv:2608.13179

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

Keep Policy Gradient in Charge: Sibling-Guided Credit Distillation for Long-Horizon Tool-Use Agents

2026-06-10 · Tianyu Ding, Jianhong Xin, Juan Pablo De la Cruz Weinstein arxiv

Long-horizon tool-use reinforcement learning learns from outcome verification, but trajectory-level advantages are broadcast over reasoning, API, and answer tokens. Direct self-distillation can supply a denser signal, bu…

Reinforcement Learning

Not All Tokens Deserve Equal Credit: Counterfactual Sensitivity Credit Reallocation for Long-CoT Reasoning

2026-07-30 · Qiangqiang He, Zhongheng Wu, ZiJian Wang arxiv

Reinforcement learning with verifiable rewards (RLVR) is central to improving long-CoT reasoning in large language models. Critic-free methods such as GRPO convert response-level rewards into advantages and uniformly bro…

Reinforcement LearningMathematical Reasoning

CAST: Non-Privileged Clipped Asymmetric Self-Teaching with Advantage Flipping for GRPO

2026-05-29 · Yang Li, Gongle Xue, Yijia Guo, Yuheng Yuan 외 arxiv

Reinforcement learning with verifiable rewards (RLVR), especially Group Relative Policy Optimization (GRPO), has been widely used to improve reasoning in large language models. However, outcome-level rewards provide only…

Reinforcement LearningMathematical Reasoning

TRIAGE: Role-Typed Credit Assignment for Agentic Reinforcement Learning

2026-06-30 · Yuanda Xu, Zhengze Zhou, Hejian Sang, Xiaomin Li 외 hf

Agentic reinforcement learning requires assigning credit to environment-facing actions such as searches, clicks, edits, navigation commands, and object interactions. Standard GRPO uses the final verifier outcome as a uni…

Reinforcement Learning

Beyond Teacher Likelihood: Group-Calibrated On-Policy Distillation for Long-Context Reasoning

2026-08-19 · Zhu Zhang, Jixun Wang, Xiaoang Xu, Xiaorong Wang 외 arxiv

On-policy distillation (OPD) trains a student on its own responses using dense token-level guidance from a stronger teacher. In long-context tasks, however, token-level teacher support can favor locally plausible respons…