- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes KRAFT for time-series anomaly detection (TSAD) under latent domain shifts, where neither domain identities nor shift boundaries are known. KRAFT leverages Koopman-predicted latent dynamics to condition a flow-matching model that generates an evolving normal reference. A Koopman-compensated maximum mean discrepancy (MMD) statistic detects persistent unexplained changes and triggers restricted adapter updates, which are accepted according to a held-out capped-risk criterion. Buffered observations are then rescored using the selected adapter. The paper provides conditional theoretical guarantees and evaluates the approach on public TSAD benchmarks, synthetic domain-shift datasets, and real-world case studies.
Critical strengths
-
The paper addresses an important and practically relevant problem. Distinguishing shifts in normal behavior from genuine anomalies, without access to domain labels or shift boundaries, is a meaningful challenge. The proposed separation between predictable evolution and unexplained distributional changes offers a coherent approach to this problem.
-
The empirical investigation is broad and includes informative component analyses. The evaluation spans 16 public TSAD datasets and four domain-drift datasets, employs complementary metrics and incorporates ablations and mechanism-level diagnostics. These results provide encouraging evidence that the complete framework is effective across diverse settings.
Critical weaknesses
-
The evaluation does not sufficiently control for deferred decisions and retrospective adaptation. Appendix A.4 explicitly states that the adapter used to rescore a buffered observation may depend on that observation as well as on later observations within the episode. While this constitutes a legitimate deferred-detection setting, Appendix C.3 preserves each baseline’s original inference regime; consequently, identical chronological splits do not guarantee equivalent information access or decision delays. The paper does not report initial-versus-final detection performance, finalization-delay distributions, or comparisons under matched buffering and information constraints. As a result, it is difficult to determine how much of the reported advantage stems from the proposed method versus from the opportunity to adapt before retrospectively finalizing predictions. This substantially limits confidence in the comparative performance claims.
-
The specific methodological advance is not sufficiently established relative to the closest alternatives. Conditional flow matching has already been applied to TSAD (e.g., SGFM), yet this line of work is neither discussed nor evaluated. Furthermore, CANDI, which is cited and directly relevant to selective adaptation under distribution shift, is absent from the comparisons. The existing ablations support the usefulness of the components, but they do not establish whether Koopman propagation confers a distinctive advantage over an alternative learned dynamics predictor within the complete detection pipeline. The TCN comparison in the battery study is informative, but it evaluates representations rather than end-to-end anomaly detection. While the combination may be novel, stronger positioning and controlled comparisons are needed to establish its substantive contribution.
Questions for authors
-
Are the main results computed using the deferred final scores? How much of the improvement remains when only the retained initial scores are used? Please report the distribution of finalization delays and clarify whether the advantage persists when adaptive baselines receive equivalent access to buffered observations and comparable decision-delay budgets.
-
How does KRAFT compare with CANDI under compatible data assumptions and evaluation protocols? Can the authors provide a controlled comparison in which Koopman propagation is replaced by a learned nonlinear latent predictor within the full detection pipeline, while retaining the flow model and adaptation procedure? Such a comparison would help distinguish the benefit of the proposed Koopman reference from that of predictive conditioning more generally.
-
The validation ablation and Appendix D.2 diagnostics are helpful. However, capped validation can still favor an update that pushes a persistent anomaly below the detection threshold, and Theorem 1 provides only a conditional bound on recall loss. What evidence indicates that accepted updates preserve anomaly recall when persistent or recurring anomalies enter both the adaptation and validation buffers? Reporting recall before and after refinement in such cases would materially strengthen the central contamination-resistance claim.
10 comments
Q1. Initial scores, deferred scores, and decision delays
Do the main results use deferred scores? How much of the advantage remains with initial scores, and does it persist when adaptive baselines receive the same buffering and delay budget?
Table 1 reports arrival-time scores with online adaptation enabled and no retrospective rescoring. Under this protocol, KRAFT achieves 85.35 Aff-F and 33.24 VUS-PR, versus 77.97 and 32.23 for Sub-PCA. Our response to NgPM Q5 compares initial and rescored results on all four metrics. RHFw Q1 reports the release-delay distribution for each dataset. We apologize for the ambiguity and will label the scoring protocol in Table 1 and Appendix A.4.
However, it is worth noting that later observations can also inform earlier scores in TimeRCD (Lan et al., 2026) and Anomaly Transformer (Xu et al., 2022) through full-window attention, and in TSB-AD's Sub-PCA (Liu and Paparrizos, 2024) through center-aligned subsequence scores. In this sense, KRAFT-R can also be viewed as using information from future observations to score the current observation at time .
Q2. CANDI, learned propagation alternatives, and SGFM
How does KRAFT compare with CANDI under compatible protocols? Does Koopman propagation improve end-to-end detection over a learned nonlinear predictor when the flow model and adaptation procedure are retained?
CANDI. We used the authors’ TSB-AD implementation of CANDI with the same chronological training prefixes and test segments as KRAFT. Under its default online configuration, CANDI reserves the final 20% of each training prefix to construct its validation reference set and uses the 95th percentile of scores on the training portion to help select adaptation samples. CANDI records each test batch’s scores before updating on that batch. We compared these continuous scores with KRAFT’s arrival-time scores. Both methods were evaluated using the same TSB-AD protocol: Aff-F, F1-T, and point F1 each use their metric-specific threshold search on the labeled test series, VUS-PR integrates over thresholds, and each dataset receives equal weight. NgPM Q5 gives the full 16-dataset comparison. For the five multivariate datasets, which match CANDI's intended setting, the means are:
| Method | Aff-F | F1-T | Point F1 | VUS-PR |
|---|---|---|---|---|
| KRAFT, initial scores | 86.08 | 40.06 | 34.15 | 25.28 |
| CANDI | 74.32 | 37.22 | 33.35 | 23.33 |
The mean point-F1 gap is 0.80 points here, and CANDI leads on point F1 and VUS-PR on SWaT.
Controlled propagation replacement. Each alternative supplied a predicted latent state to both the flow model and the MMD reference window. We kept the flow architecture, training budget, adaptation rule, and arrival-time scoring fixed. Across 16 datasets (one seed), replacing Koopman with the strongest alternative, a latent Neural ODE, reduced mean Aff-F, F1-T, point F1, and VUS-PR by 1.80, 2.55, 2.16, and 2.73 percentage points, respectively. The Aff-F drops were larger for the residual MLP (3.98) and the unconstrained linear generator (7.56). Thus, the choice of propagator affected end-to-end detection even when every variant retained predictive conditioning (NgPM Q2).
Positioning relative to SGFM. KRAFT's main contribution is to use the same learned Koopman dynamics to generate a normal reference and to detect departures from its predicted evolution. Persistent departures trigger candidate adapter updates, which are accepted only after held-out validation. Conditional flow matching serves as our generator and has precedent in TSAD, including SGFM (He et al., 2024). Within this component, we introduce a Koopman-informed bidirectional Gaussian bridge (Eq. 4) that combines forward and backward predictions from the two training endpoints to supervise intermediate velocities. To our knowledge, this specific bridge construction has received limited attention in flow-matching TSAD. We will discuss SGFM and related work and clarify these contributions in the revision.
Q3. Recall when a persistent anomaly contaminates both buffers
When persistent or recurring anomalies enter both the adaptation and validation buffers, how much anomaly recall is retained after an accepted update?
An update can reduce capped validation loss by pushing an anomaly score below the detection threshold. To test this failure mode, we selected candidates for which anomalous points in both buffers came from the same labeled event lasting at least 256 observations. The gate accepted 13 of 14 such candidates on PSM and 18 of 20 on SWaT. We counted each distinct event once and rescored it offline with the pre-update and end-of-episode adapters, holding the observations, scoring statistics, and threshold fixed.
| Dataset | Accepted candidates / events | Anomaly points | Recall before | Recall after | Initial true positives retained | Detections lost / gained |
|---|---|---|---|---|---|---|
| PSM | 13 / 9 | 21,380 | 32.00% | 32.33% | 6,445 / 6,842 (94.20%) | 397 / 468 |
| SWaT | 18 / 8 | 39,808 | 38.51% | 38.63% | 14,659 / 15,331 (95.62%) | 672 / 719 |
Refinement retained 94.20% of previously detected anomaly points on PSM and 95.62% on SWaT. Newly detected points slightly outnumbered lost detections, so pooled recall changed little. Recall nevertheless fell in 4 of 9 PSM events and 3 of 8 SWaT events, with maximum drops of 1.30 and 0.73 percentage points, respectively. The longest SWaT attack accounted for 90.2% of anomaly points in this subset. Excluding it, the remaining seven events still retained 95.15% of initial detections. These results quantify the masking observed within persistent events. RHFw Q6 reports the complementary online comparison with and without validation.
Thank you for your thoughtful feedback. We first address the weaknesses you identified and then respond to each of your questions in more detail. We will provide the revised manuscript as soon as possible.
Response to the Critical Weaknesses
W1. Deferred decisions and access to later observations. Though our manuscript describes retrospective buffer rescoring as part of the overall procedure, we have to clarify that our Table 1 uses the initial arrival-time scores (siinit), retained separately as described in Appendix A.4, rather than the deferred final scores (sifinal). Each initial score is computed from the arriving observation, its preceding history, and the adapter accepted before the current block. In other words, the initial scores used in Table 1 are never replaced by scores computed with later observations or subsequently updated adapters. Thus, Table 1 evaluates online adaptation without retrospective changes to the evaluated scores. Under this protocol, KRAFT leads Sub-PCA by 7.38 percentage points on Aff-F (85.35 vs. 77.97) and 1.01 points on VUS-PR (33.24 vs. 32.23). Allowing deferred rescoring in KRAFT-R adds a further 2.11 and 1.06 points, respectively. We report this incremental gain together with its delay: across the 16 datasets, median release delays ranged from 16 to 19 observations, and on 10 datasets the 95th percentile was at most 31 observations. Q1 clarifies the information available to KRAFT at scoring time and distinguishes the two protocols. NgPM Q5 gives all four performance metrics, and RHFw Q1 gives the delay distribution for each dataset.
W2. Methodological contribution and comparison with the closest alternatives. SGFM established conditional flow matching as a generator for TSAD. KRAFT’s contribution is to use the same learned dynamics to generate a normal reference and to decide when that reference needs updating. Koopman propagation conditions the generator through a bidirectional Gaussian bridge and advances the historical window used by KP-MMD. A persistent mismatch then triggers a candidate update subject to held-out validation. We tested this design in the complete detector: with the flow architecture and adaptation rule fixed, Koopman led all three learned propagators on all four metrics across the 16 public datasets in our single-seed comparison. A complementary test on five CDS streams shows how the propagator affected adaptation timing. Koopman and the latent Neural ODE each initiated adaptation ten times; all ten Koopman starts matched distinct true domain boundaries, compared with eight for the Neural ODE. We also evaluated CANDI on the same training and test data using its official defaults. Across the five multivariate datasets, arrival-time KRAFT led on all four means, including 86.08 vs. 74.32 on Aff-F. Q2 details the end-to-end replacements, the CANDI comparison, and KRAFT’s relationship to SGFM.