Trajectories That Segment Themselves: Agent-Declared Boundaries as a Training Unit
Score
78提出智能体自声明边界的新范式，对比固定窗口与整集标签有明显信息补充。
实验设计严谨，包含归因、边界放置和下游DPO验证，结论可信。
为长程Agent训练数据构造提供可操作方案，但需复现与工具链支持。
arXiv最新论文，紧跟长程智能体训练热点。
来自arXiv预印本，规范性高，但尚未同行评审。
Base 86.5 × T2 Source weight ×0.9 = 78
Curation line 70Selected
Why selected
Novel method with thorough experiments, offering direct implications for data engineering in agent training.
AI commentary
「This paper deserves attention for proposing an external-label-free trajectory segmentation method, valuable for researchers in agent training and reinforcement learning. It turns data construction into a process of agent self-declaration, an idea worth borrowing.」
Quick overview
Long-horizon coding-agent trajectories are poorly matched to training credit units: single actions lack stable value, episode labels mix effective exploration with abandoned directions, and fixed windows cut arbitrarily. This paper introduces collection-time semantic self-segmentation, where a declarative contract makes the agent declare its own boundaries during trajectory generation. With falsifiable causal hypotheses, these segments are variable-length semantic phases, requiring no gold patches or retrospective segmenters. Because the agent names its conjecture, reviewers can negate it by name, producing wrong-cause-then-correction transitions. Experiments show that given cut points without hypotheses, models attribute action blocks to governing hypotheses at over twice chance, beating equal-length blocks. A code-blind annotator matches 24 of 40 boundaries versus random 11.5, while mechanical rules fail. Downstream, DPO on 2,551 phase-boundary pairs changes no decision on 91 adversarial items, but four of 60 matched items change from wrong to right, with no changes in controls. Boundary-based training is coherent and not cheaply reproducible.
- Proposes collection-time semantic self-segmentation, where agents declare boundaries during trajectory generation, avoiding fixed windows or retrospective segmentation.
- Experiments show model attribution to hypotheses beats chance significantly, and boundaries are not reproducible by mechanical rules.
- DPO with boundary pairs corrects errors on matched-construction items but not adversarial ones, suggesting corpus diversity is the next key lever.
Full text
This is an AI-generated Chinese digest; use "View original" for the source text.
Related items
85
FeaturedSetoka: A Benchmark for Hierarchical User Understanding in Personalized Agents over Heterogeneous Data
Setoka：面向异构数据个性化Agent的层级用户理解基准
This paper is well worth attention, especially for researchers and engineers working on personalized agents, dialogue systems, and memory-augmented AI. It not only provides a benchmark but defines levels of user understanding from psychology, revealing systematic failures of current systems at higher levels. If you are designing memory-based agents, this paper reminds you that memory systems need to support cross-temporal, cross-source abstract reasoning, not just retrieval.
85
FeaturedBAND: Bayesian Network Distribution Regression for High-Dimensional Distribution Estimation – Breaking the Curse
BAND：高维分布估计的贝叶斯网络回归方法——打破维度诅咒
This paper is a must-read for anyone working on high-dimensional statistics, probabilistic modeling, and generative AI. It provides a simple yet powerful theoretical answer: sparsity can break the curse of dimensionality, and Bayesian networks offer a natural framework. Compared to black-box methods like VAEs and GANs, BAND is interpretable and provably convergent, especially valuable for industry needs like reliable confidence intervals. If you research time series forecasting or risk management, this paper may change how you approach high-dimensional density estimation.
84
FeaturedCycle-Consistent and Uncertainty-Aware Neural Surrogates for Tokamak Edge Plasmas
循环一致与不确定性感知的托卡马克边缘等离子体神经代理模型
This paper is worth attention because it demonstrates how advanced AI techniques (cycle consistency, uncertainty quantification) directly address a core computational bottleneck in nuclear fusion. For fusion researchers and engineers, it offers a practical tool to speed up simulations by orders of magnitude without sacrificing accuracy; for AI practitioners, it provides an excellent case of self-supervised learning and inverse problem solving in scientific applications.
83
FeaturedEquivariant Learning of a Transferable Three-Dimensional Classical Density Functional
等变学习可迁移的三维经典密度泛函
The most striking aspect of this paper is its direct coupling of machine learning to a core problem in statistical mechanics, using equivariant networks to learn a transferable density functional without any labels. For researchers in liquid physics or soft matter, this could be a new paradigm: do we need to run separate simulations for every new system anymore? For AI researchers, it also shows how to embed physical symmetries and variational principles into models rather than just fitting data. I recommend focusing on the methods, especially how equivariance and variational consistency are implemented—that's the real essence.
83
FeaturedComputational and Statistical Guarantees of the c-Rectified Flow
c-Rectified Flow 的计算与统计保证
This paper moves rectified flow from 'works in practice' to 'theoretically controllable,' which is especially important for those working on the underlying algorithms of generative models. If you are tuning pipelines like FLUX or SD3, understanding that ordinary rectified flow can fail when covariances do not commute may help you avoid hidden training pitfalls.
83
FeaturedLearning Deployable Manipulation Policies from High-Fidelity UMI Data Alone
从高保真UMI数据学习可部署操作策略
The most striking point of this paper is proving that pure robot-free data can match real teleoperation performance, breaking the convention of needing a small real-robot anchor for post-training. For research groups looking to reduce hardware costs and industrial robot application developers, HiFi-UMI's data production system and open-source dataset are directly usable resources. Pay attention to the engineering details of head-mounted SLAM and microsecond synchronization—they are key to achieving the reported accuracy.
83
FeaturedCapital Markets LLM Reliability Score: From Plausible to Bankable
资本市场LLM可靠性评分：从“看似合理”到“可银行化”
This paper is valuable for both finance and AI communities: it provides an actionable, workflow-oriented evaluation framework that's closer to real needs than generic benchmarks. If you're deploying LLMs in fintech or responsible for explainability/auditability, this is a must-read. The finding on decision usefulness is particularly striking—judges agree it's critical, yet models vary the most on it.
83
FeaturedWhere Should Optimizer State Live? Tiered State Allocation for Memory-Efficient Mixture-of-Experts Training
优化器状态应放在哪里？面向内存高效MoE训练的分层状态分配
This paper is highly valuable for teams training MoE models: it demonstrates that with careful optimizer state allocation, one can dramatically reduce memory without sacrificing accuracy—and even improve performance. It is especially relevant for labs or enterprises constrained by 40 GB or 80 GB GPU memory. The tiered strategy and ablation on momentum retention are worth studying for optimizing training frameworks like DeepSpeed or Megatron.