反事实分支别换运气:CMU/UMich TWICE,GRPO 均值 +5.3/+4.5、辅助 token −68%
反事实分支别换运气:CMU/UMich TWICE,GRPO 均值 +5.3/+4.5、辅助 token −68%
View PDF HTML (experimental) Abstract: Agentic reinforcement learning rewards a complete episode, yet the policy needs credit for every decision inside it. Counterfactual branching estimates this credit by re-running the episode after an alternative decision, but the branch...
CMU/UMich TWICE (arXiv:2610.31544)
“View PDF HTML (experimental) Abstract: Agentic reinforcement learning rewards a complete episode, yet the policy needs credit for every deci”
Abstract:Agentic reinforcement learning rewards a complete episode, yet the policy needs credit for every decision inside it. Counterfactual branching estimates this credit by re-running the episode after an alternative decision, but the branch draws its sampling noise independently of the factual episode, so the outcome difference mixes the effect of the decision with the luck of everything that follows. We observe that in agentic search the retriever, the corpus, and the grader are deterministic, so an episode is a deterministic function of the policy's decisions and its sampling noise. Twin worlds are therefore realizable: the same noise, a different decision. We introduce TWICE (TWIn-world Credit Estimation), which keys the Gumbel noise of every token by turn and line, rolls out counterfactual twins that inherit the factual episode's downstream noise, and turns their paired outcome differences into turn-level advantages for policy-gradient updates on actor-sampled trajectories; only the actor is deployed. Twin credit is unbiased for any coupling quality, its variance is that of an independent counterfactual scaled by $1-\rho$, where $\rho$ is the twins' outcome correlation, and under coupling the number of rollouts needed to resolve an advantage of size $\Delta$ falls from $\Theta(\Delta^{-2})$ to $\Theta(\Delta^{-1})$. A square-root rule spends the twin budget where outcomes are predicted to disagree per unit cost. On seven question-answering benchmarks, TWICE improves the average exact match of GRPO by 5.3 and 4.5 points on Qwen2.5-3B and 7B, outperforms tree-search and counterfactual-branching baselines, and uses 68% fewer auxiliary tokens than VinePPO.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2610.31544 [cs.LG] |
| (or arXiv:2610.31544v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2610.31544 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Zeropy Surio [view email]
[v1]
Thu, 22 Oct 2026 16:51:27 UTC (882 KB)
Source: Agent Control Flash News · arxiv.org
Related Products & Analysis
Cursor Agent 架构全景拆解:从影子工作区到多文件推演引擎
全面剖析 Cursor 在 Agent 模式下的底层技术实现,解析影子分支隔离、LSP 上下文剪枝以及预测性补全的核心架构细节与工程实践经验。
Vercel v0 推出全新多 Agent 协作画布与实时全栈部署预览
动态速评:v0 正在从单一组件生成器演进为全栈应用搭建协作台,尤其是与 Neon/Postgres 的直连极大降低了全栈原型验证成本。