- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
Traverse combines a Rubric–Answer–Verify workflow with agent-triggered context compression through Seal Memory. Its main training proposal is to optimize only the final context segment of each rollout. The resulting 35B model achieves 72.8 on BrowseComp and improves over its backbone across several search benchmarks.
Critical strengths
1)The paper studies a useful problem in long-horizon agent RL: how to optimize trajectories spanning multiple context resets.
2)Figures 2–3 show an interesting training result. Including the (1/K)-weighted all-segment baseline helps rule out trajectory reweighting as the sole cause of degradation.
3)The gains cover several search benchmarks. The active-compaction experiment also controls the summarizer model and memory format, which makes the comparison more informative.
Critical weaknesses
1)The benefit of selecting the final segment is not sufficiently isolated. Figures 2–3 establish an advantage over the two tested all-segment objectives. However, I would like to see a baseline that samples one segment per trajectory uniformly or in a round-robin manner. This would distinguish the benefit of terminal-segment selection from that of selective segment training more generally. The authors keep training hyperparameters consistent, but the optimized-token counts and update budgets would also help interpret this comparison.
2)Table 3 does not establish that adaptive timing is better than earlier fixed compression. Automatic compression triggers at roughly 230K tokens, whereas the median first active Seal occurs at 67.5K. A simpler policy that compresses earlier might recover part of the gain. Active Seal also increases average turns from 112.2 to 217.7, which the authors explicitly acknowledge. Longer productive search is a legitimate benefit, but earlier fixed-threshold baselines and accuracy–cost curves are needed to understand what adaptive triggering adds.
3)The evidence for improved memory control remains indirect. Section 3.2 provides an implicit-learning argument, and Appendix C introduces resource penalties, constraints on unnecessary Seal calls, and randomized context budgets. These can plausibly affect triggering behavior. However, successful Seal calls and their summaries in preceding segments are excluded from the RL loss. I am therefore not sure whether RL improves memory decisions themselves, or mainly improves final-segment search while preserving the SFT-initialized memory behavior. The current results support stable training more directly than improved memory construction.
Questions for authors
The following targeted experiments would help resolve my main concerns and could change my rating. Evaluation on the existing ablation benchmarks would be sufficient; I am not asking for a full benchmark rerun.
1)Is selecting the final segment specifically beneficial? Could you compare final-segment RL with uniformly sampling one segment per trajectory, using the same rollout collection budget and clearly reporting loss normalization and optimized-token counts? This would help distinguish the benefit of final-segment selection from that of training on fewer segments.
2)Does adaptive triggering outperform earlier fixed compression? Could you add fixed thresholds closer to the observed active Seal timing, such as 64K and 128K tokens, while keeping the model and memory format unchanged? Please report accuracy alongside actual token and tool costs under shared inference limits. The key question is whether state-dependent triggering adds value beyond simply compressing earlier.
3)What memory behavior actually improves during RL? Could you compare the SFT and RL policies on a fixed set of intermediate search states, examining Seal decisions and the utility of the generated summaries? For example, summary utility could be tested by holding the continuation policy fixed and measuring downstream success. This would provide more direct evidence of improved memory control beyond the implicit-learning argument in Section 3.2 and the training dynamics in Figure 3.