- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies how small errors propagate through agent interactions and proposes a framework for measuring and controlling the resulting deviations. Theoretically, it shows that a state-conditioned hinge captures current–successor distance correspondence that absolute and constant-threshold penalties cannot distinguish, and derives a finite-sample bound relating hinge violations to task-score sensitivity under stated assumptions. In practice, it introduces Coupled-Rollout Contraction Optimization (CRCO), which adds an initial-distance penalty and a state-conditioned propagation hinge to paired task return. Training uses tokenwise maximal coupling and a joint-likelihood policy update, while deployment requires only a single ordinary rollout. Experiments across nine backbones and eight interactive settings evaluate robustness and error propagation against matched training objectives.
Critical strengths
-
The paper offers a novel perspective on agent reliability by separating initial sensitivity from subsequent error amplification and recovery. This framework is particularly relevant to long-horizon agent tasks, where small deviations can accumulate through repeated interactions. Its focus on task semantics and the evolution of deviations provides a useful basis for analyzing reliability beyond local accuracy or terminal success alone.
-
The experiments cover nine backbones and eight interactive settings, with meaningful improvements across a broad range of model–task combinations. CRCO improves perturbed scores by 2.6 and 3.3 points over matched absolute propagation on the two anchor backbones. Matched controls and recovery analyses further support the value of state conditioning, while deployment requires only a single ordinary rollout.
Critical weaknesses
- The connection between the theoretical analysis and the practical CRCO algorithm is kind of week. Although the theory motivates controlling error propagation, it is difficult to trace how the theoretical quantities and assumptions translate into the measurements and optimization choices used in training. This makes it challenging to assess how directly the theoretical results explain the observed improvements in task performance.
- I think there is still room for improvement in the presentation. The paper places substantial emphasis on equations and theoretical results, while the actual training procedure is less clearly explained in the main text, making it difficult to reconstruct a complete data collection and training iteration. Figure 1 would also benefit from a more explicit walkthrough connecting its components to the algorithm and a concrete task example.
Questions for authors
- Could you clarify how the theoretical analysis informs the practical design of CRCO? A concrete task example tracing the initial perturbation, subsequent state distances, and propagation penalties would help illustrate this connection. It would also be useful to explain which intermediate measurements in the existing experiments support the proposed link between controlled propagation and improved task outcomes.
- Can you provide a detailed description of the training pipeline, including the training data, reference-prefix construction, semantic extractor configuration, and optimization settings? A walkthrough of one training iteration, from generating paired rollouts to computing rewards and updating the policy, with references to the relevant appendix details, would make the implementation easier to understand.