Xiaojian Liu
Author directory2026
STAMP: Provenance-Guided Credit Assignment for Deep Search Agents
Ke Xu | Han Xu | Xinran Chen | Yuqian Wang | Zhixuan Li | Xiaojian Liu | Changwo Wu | Jianqiang Xia | Yuchen Li
Findings of the Association for Computational Linguistics: EMNLP 2026
Ke Xu | Han Xu | Xinran Chen | Yuqian Wang | Zhixuan Li | Xiaojian Liu | Changwo Wu | Jianqiang Xia | Yuchen Li
Findings of the Association for Computational Linguistics: EMNLP 2026
Reinforcement learning for deep-search agents has largely focused on trajectory-level scoring—outcome correctness, citation-aware rewards, and evidence coverage. Yet the actions that expose supporting documents receive no targeted credit, a gap we call the reward-credit mismatch. We propose STAMP, in which a reference-based verifier judges whether each cited document supports an entity or relation in a training-time evidence graph, and first-exposure attribution traces each supported citation back to the action that first surfaced it. This step credit is injected through sign-preserving advantage modulation, which redistributes advantage across steps without changing the trajectory-level reward or the relative ranking of trajectories within each group. On BrowseComp, BrowseComp-ZH, and xbench-DS, STAMP improves the strongest GRPO baseline by +2.0/+5.5/+3.0 points under matched SFT initialization, training data, and search tools, and composes with both outcome-only and citation-rubric base rewards. Component ablations confirm that the provenance-based credit signal and the sign-preserving advantage modulation each contribute to the gains.
SCOPE-RL: Optimizing Reasoning Paths Before and After Success
Xiaojian Liu | Han Xu | Jianqiang Xia | Zhixuan Li | Ke Xu | Yiwei Dai | Xinran Chen | Changwo Wu | Yuchen Li
Findings of the Association for Computational Linguistics: EMNLP 2026
Xiaojian Liu | Han Xu | Jianqiang Xia | Zhixuan Li | Ke Xu | Yiwei Dai | Xinran Chen | Changwo Wu | Yuchen Li
Findings of the Association for Computational Linguistics: EMNLP 2026
Reinforcement learning with verifiable rewards (RLVR) optimizes LLMs using sparse verifiable final-answer rewards. This sparse anchor reliably verifies whether a trajectory succeeds but provides no direct feedback on the reasoning path that produced it. Before success, prerequisite progress on hard problems receives no reward signal; after success, outcome rewards cannot distinguish well-organized correct trajectories from redundant or locally flawed ones. We introduce SCOPE-RL (Scaffolded Chain Optimization with Process Efficiency), a two-stage framework that densifies this anchor while retaining the GRPO update: Adaptive Scaffolded RL adds prefix-decomposed verifiable rewards on answer-hidden sub-question chains before success, and Quality-Aware Process RL applies correctness-gated process-shape rewards to refine correct trajectories after success. An expert-validated Step-Quality Evaluation Protocol evaluates useful-step density, error localization, and token efficiency beyond final-answer accuracy. On Qwen3-8B-Instruct trained on DAPO-Math and Big-Math, SCOPE-RL improves average accuracy by up to 11.2 pp and reduces reasoning tokens by up to 27.1% over outcome-only GRPO; the gains hold under GSPO and on Qwen3-0.6B-Instruct, indicating that reward-signal densification is complementary to policy-update-level RLVR advances.