Trajectories That Segment Themselves: Agent-Declared Boundaries as a Training Unit
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 15 of its 17 references that are in the map. First posted on arXiv 3 Aug 2026.
Builds on
15 of 17 references.
References · 15
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2023Let's Verify Step by Stepcited by 3,598
- 2025Agent Lightning: Train ANY AI Agents with Reinforcement Learningcited by 94
- 2025SDPO: Segment-Level Direct Preference Optimization for Social Agentscited by 29
- 2025StepWiser: Stepwise Generative Judges for Wiser Reasoningcited by 28
- 2026HiPER: Hierarchical Reinforcement Learning with Explicit Credit Assignment for Large Language Model Agentscited by 14
- 2026Milestone-Guided Policy Learning for Long-Horizon Language Agentscited by 12
- 2026Scaling Test-Time Compute for Agentic Codingcited by 11
- 2026GEAR: Granularity-Adaptive Advantage Reweighting for LLM Agents via Self-Distillationcited by 10
- 2026Hypothesis-Driven Skill Optimization for LLM Agentscited by 6
- 2026Tycho: Active Abstraction with Programmatic World Models for ARC-AGI-3cited by 5
- 2026Hindsight Hint Distillation: Scaffolded Reasoning for SWE Agents from CoT-free Answerscited by 4
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026TrajLong: Co-Designing Agentic and Long-Context Supervision for Mid-Training
- 2026Success Leaves Detours: Learning Executable Walkthroughs for Long-Horizon Agents
- 2026Before They Can Solve: Predicting Post-Training Coding-Agent Performance from Base Models
- 2026Strained Coherence: A Pre-Failure Signal in Coding Agent Execution Trajectories
- 2026AutoRefine: Compiling Trajectories into Validated Typed Agent Artifacts
- 2026From Final Artifacts to Trajectories: Retrospective Process Supervision for Evidence-Grounded Long-Form Generation
- 2026Agent trajectories as programs: fingerprinting and programming coding-agent behavior
- 2026Self-Designed Evaluators and Warm Memory for Long-Horizon Agents