arXiv:2608.02302cs.AIcs.LG2026-08

让智能体自己划分任务阶段,用自声明边界提升训练效率

Trajectories That Segment Themselves: Agent-Declared Boundaries as a Training Unit

论文配图:Trajectories That Segment Themselves: Agent-Declared Boundaries as a Training Unit
图 1 · 摘自论文原文
  • 智能体在生成轨迹时主动标记自身任务阶段的边界
  • 自定义边界使模型识别阶段正确率超随机两倍以上
  • 适合需要可解释性与高质量监督信号的研究者

长周期编码智能体的轨迹与可用的训练信用单位不匹配:单个动作无稳定价值,整段标签混杂有效探索与失败尝试,固定窗口切割受日志机制限制。本文提出运行时语义自分割机制,由执行智能体以声明式契约暴露自身边界。基于可验证的因果假设,连续采纳形成变长语义阶段,无需里程碑词汇、黄金片段、环境重播、教师输出或事后分割器即可确定边界。因智能体命名其假设,评审者可按名否定,从而生成‘错误原因-修正’的过渡样本,一次收集即产生四个监督目标,包括对传统标签舍弃区域的审计监督。我们进一步检验删除声明后是否仍有效:仅保留切分点而无假设,模型对动作块的归属判断正确率超过随机两倍(配对符号检验 $p = 0.0002$),优于等长块,且在词法控制下存活,但标签置换后崩溃。要求标注边界时,代码盲注释员准确匹配40中的24个,随机为11.5;机械事件规则在严格到宽松的全范围内均未胜过随机。因此,这些段落具有内在一致性且不可廉价复现。下游实验中,使用2,551对阶段边界进行DPO,在91个对抗样本上无决策变化,60个匹配构造样本中有4个从错转对,两个对照组无变化:1,825对来自同一生成器,下一个变量应为语料多样性而非边界本身。

原文摘要 · Abstract (English)

Long-horizon coding-agent trajectories are poorly matched to the credit units available to train on: a single action has no stable value, an episode label merges productive exploration with abandoned directions, and a fixed window cuts where the logging mechanics fall. We introduce collection-time semantic self-segmentation, in which a declarative contract has the acting agent expose its own boundaries while the trajectory is generated. Instantiated with falsifiable causal hypotheses, successive adoptions expose variable-length semantic phases, and no milestone vocabulary, gold patch, environment replay, teacher logits, or retrospective segmenter places a boundary. Because the agent names its conjecture, a reviewer can negate it by name, which lets our protocol manufacture wrong-cause-then-correction transitions that recorded work rarely contains; one collection then yields four supervised targets, including audit supervision from exactly the failed regions an episode label discards. We then ask what survives deleting the declaration. Given the cut points but not the hypothesis, a model attributes action blocks to their governing hypothesis at over twice chance, beating equal-length blocks over the same trajectories (paired sign test $p = 0.0002$), surviving a lexical control and collapsing under label permutation. Asked instead to place boundaries, a code-blind annotator matches 24 of 40 where random placement matches 11.5, while a mechanical test-event rule beats chance at neither end of a strict-to-permissive sweep. The segments are therefore coherent and not cheaply reproducible. Downstream, DPO on 2,551 phase-boundary pairs changes no decision on 91 adversarial held-out items, while four of 60 change on matched-construction items, all wrong to right, where two controls change none: with 1,825 pairs from one generator, the variable to vary next is corpus diversity, not the boundary.

智能体训练自我分割阶段识别强化学习

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。