- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies sequential monitoring during the execution of generative models and agents, aiming to detect anomalous behavior as early as possible while controlling the false alarm rate on normal trajectories. The authors transform black-box scores into stepwise accumulated statistical evidence, identify historical dependence within trajectories as a key obstacle to ensuring test validity, and propose two learning schemes: a conditional mean test and an Actor–Critic test. On tasks such as mathematical reasoning, code generation, multi-turn interaction, and tool calling, it generally demonstrates good empirical false alarm control and anomaly detection capability.
Critical strengths
-
It explicitly distinguishes cross-trajectory monitoring from within-trajectory monitoring, reveals that marginal calibration cannot substitute for history-conditioned normalization, and provides a clear framework for understanding the validity of sequential monitoring.
-
It separately learns evidence growth and normalization under the normal distribution, and explains the Actor–Critic initialization through a conditional likelihood ratio, balancing interpretability and expressive power.
-
The method is validated across multiple models, tasks, and scorers, demonstrates the potential of combining evidence from multiple scorers, and also reports cases where false alarm control fails.
Critical weaknesses
-
Strict validity depends on the sufficiency of historical states and an upper bound on conditional normalization, but training with limited data and empirical drift correction cannot yet certify these conditions, and the false alarm rate on some tasks still exceeds the target.
-
The method depends on the distribution of calibration data and coverage of trajectory lengths, limiting its applicability to distribution shifts and longer tasks; the experiments also do not demonstrate that actual interventions after alarms can improve task success rates or safety.
Questions for authors
Please see the weaknesses.
Response to Reviewer vek8
Dear reviewer vek8, we thank you for your time and comments and are glad you appreciated our “clear framework for understanding validity” and it “balancing interpretability and expressive power”. We address your remarks below.
It is entirely correct that learned normalization is an approximation, and the reviewer identifies precisely the sufficiency and normalization conditions stated in Prop. 1. As we note in the paper, “finite-data optimization certifies neither condition, and our learned factors therefore remain empirical” (L360-L361). The proposition and controlled synthetic recovery results nevertheless suggest a route toward certification in more constrained settings. Regarding real-world experiments, we consider our empirical results favorable overall. Our reported FPR rates are at or below target in most cases, and only small violations occur (≤5 % exceedance in Table 1). We believe this supports the practical promise of our test designs.
It is correct that our approach relies on stability between calibration and deployment populations, as discussed in App. A. Like the population assumptions required to transfer CRC or PAC thresholds (e.g., data exchangeability), our data-driven hypotheses and learned components require calibration traces to reflect relevant deployment score behavior. Strong distribution shifts or unfamiliar score dynamics can therefore cause null drift or reduce detection power by inaccurate estimation. Whether our monitor's learned representations can generalize across smaller shifts is an interesting question for future work, especially when incorporating white-box information or moving to higher-capacity models.
For longer traces, the GRU architecture can computationally process histories beyond the active horizon (Hi<t≤Ti) as it is length-agnostic, and smooth extrapolation may be possible under stable score dynamics. However, formal monitoring of those steps would require “extrapolation assumptions, which we do not consider here” (L112). We therefore restrict monitoring to the active horizon, following the scope of [SP’26]; we also touch upon this in App. A. It is worth noting that this restriction has little practical impact on our evaluation, as motivated by Table B below: actor-critic trace step coverage is close to 100%, with truncation rates of deployment traces virtually zero. PAC baselines record higher truncation rates, but the effect on coverage remains minimal. For example, on Mistral-7B at most 12% of deployment traces are truncated for PAC, but mean per-trace coverage at ~97% implies only few steps are effectively removed.
Table B: Active horizon empirical results. For reasoning tasks on MATH using three different generators, we measure the practical impact of defining an active trace horizon Hi=min{Tcal,Ti} on deployment monitoring. Coverage denotes the mean per-trace fraction of active steps, and truncation indicates the rate of active horizons shorter than the full trace length. Values are means ± 1 SD across ten trial-level averages. PAC splits the calibration data into another two subsets for its protocol, hence active horizons are determined on a smaller data subset and can differ from those for learned tests.
It is correct that our experiments evaluate deployment monitoring rather than the effects of subsequent interventions. Our research question concerns the design and learning of local evidence for agentic monitoring, and our experiments assess the viability of these designs as flexible alternatives to threshold or event calibration. We leave the discussion on subsequent intervention design and evaluation, or deployment adaptation, for future work.
We appreciate your comments and hope they have been addressed sufficiently. If not, please feel free to follow up for further elaboration.
References
[SP’26] Shuvom Sadhuka, Drew Prinster, et al. E-valuator: Reliable agent verifiers with sequential hypothesis testing. Hypothesis Testing Workshop at ICML, 2026.