paper-with-me

Papers

Credit Without Ground Truth: Auditing Step-Level Credit Assignment in LLM Agents Against Executed Replay

2026-08-20 · Haiyue Zhang arxiv

Audited against causal ground truth from executed replay in a single-agent tool environment (ALFWorld), none of the step-level credit signals used to train LLM agents -- LLM-judge scores, outcome-conditioned logprob ratios, or the policy's own confidence -- identifies which steps causally matter better than chance. Existing evaluations grade these signals against annotated step *correctness*; we audit them against step *contribution* -- what re-sampling the policy's own alternatives at each decision point and rolling forward actually changes about the outcome -- and the two come apart. The ground truth itself is structured: causal contribution is sparse (30.5% of decision points where ground truth is defined carry measurable effect), and measurability is model-dependent -- the fraction of points with no policy-supported counterfactual differs by a factor of two (13.1% vs. 26.8%) between two similar-scale policies. The failure mode is identifiable: implicit credit echoes the policy's fluency (median rank correlation +0.75, replicating at +0.70 in a second family under a corrected instrument), while conditioning on the outcome adds no causal information (partial correlation -0.004, Qwen). A confidence-only router recovers pivotal steps at chance level, but cuts judge cost by 13.1% per turn (14.0% per trajectory). In a seven-arm pre-registered training experiment, no arm reliably outperforms the untrained policy, and the checkpoints' apparent instrument signature is fully explained by training dose -- sparser credit retains fewer examples, an order-of-magnitude spread in optimizer steps -- not credit content. Comparisons of credit rules must therefore match effective sample size, or they measure dose, not credit.

📄 PDF Abstract BibTeX arXiv:2608.19760

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

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

2026-09-03 · Shubham Gandhi, Saurabh Goyal, Kiran Kate, Yara Rizk hf

Reinforcement Learning from Verifiable Rewards works well when a task has a programmatic checker, but most long-horizon agent domains have none. We work in the outcome-blind setting, where ground-truth success signals ar…

Reinforcement Learning

PAIR: Prefix-Aware Internal Reward Model for Multi-Turn Agent Optimization

2026-05-18 · Wonjoong Kim, Yeonjun In, Sangwu Park, Dongha Lee 외 arxiv

A significant hurdle for current LLMs is the execution of complex, multi-stage tasks. Group Relative Policy Optimization (GRPO) has been emerging as a leading choice, but its reliance on sparse outcome rewards severely l…

Best Arm Identification with LLM Judges and Limited Human

2026-01-29 · Ruicheng Ao, Hongyu Chen, Siyang Gao, Hanwei Li 외 arxiv

We study fixed-confidence best-arm identification (BAI) where a cheap but potentially biased proxy (e.g., LLM judge) is available for every sample, while an expensive ground-truth label can only be acquired selectively w…

Know When to Stop: Segment-Level Credit Assignment for Reducing Overthinking

2026-07-01 · Chia-Hsuan Lee, Sihui Dai, Mingyang Zhou, Isha Slavin 외 arxiv

Reasoning language models frequently overthink: generating extended chains of behaviors such as hedging, approach abandonment, and self contradiction that consume tokens without improving answers. We show that these beha…

SkillAudit: Ground-Truth-Free Skill Evolution via Paired Trajectory Auditing

2026-06-12 · Haowen Gao, Haoran Chen, Can Wang, Shasha Guo 외 arxiv

Agent skills are structured procedural packages that guide frozen LLM agents in specialized workflows. Skills rarely remain sufficient after deployment: edge cases, API changes, and deployment constraints become visible …