- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper addresses scale mismatch in patch-based TSAD, where a single predefined patch length may not fit anomalies of different durations. The proposed MGF-AD works independently at each of several patch lengths. At each scale, it trains a 1D-CNN patch encoder with neighborhood-consistency metric learning and a temporal-continuity auxiliary loss, builds a bank of normal prototypes via k-means, and scores each test patch by its cosine distance to the nearest prototype. Patch scores are averaged onto timestamps, min–max normalized per scale and sequence, and fused by an equal-weight average.
Critical strengths
- The evaluation follows a reliable protocol. The TSB-AD benchmark, separate tuning and evaluation splits, and no point adjustment.
- Controlled comparisons are included. Fixed-scale variants and a homogeneous ensemble with matched branch counts.
Critical weaknesses
- About motivation, short patches lack context, and long patches dilute short anomalies. However, there is no evidence that scale mismatch is a major failure source of patch-based TSAD, such as how much the performance of existing methods varies with patch length.
- Scale mismatch is hard to regard as an unsolved problem. The actual gap would be why score-level fusion is needed instead of representation-level multi-scale modeling, and the paper does not discuss this. For the same reason, Contribution 1 (“identifying the scale-mismatch problem”) is not new.
- The paper criticizes a fixed patch scale, yet the solution is itself a predefined, fixed set of scales {64, 96, 128}. The problem of choosing one L simply becomes the problem of choosing a set of L. Table 4 shows performance varies non-monotonically with the scale combination (on TSB-AD-U, {32, 64, 96, 128} < {64, 96, 128}).
- The stated challenge is that the optimal scale for each series or segment is unknown at test time. The solution, however, averages all scales with equal weights for every series and timestamp. It neither estimates nor adapts to the optimal scale; it only hedges.
- “Decoupling” scale-specific normality modeling from cross-scale decision making is a classic late-fusion ensemble of independently trained per-scale models. The paper never argues why this is better than joint multi-scale representation learning. On TSB-AD-M, the gain over a homogeneous ensemble (3×Scale-96) is small (Table 5).
- Patch-to-point alignment and per-scale calibration are necessary preprocessing for averaging scores across scales, not designs derived from the stated challenge.
- Min-max calibration is offline and uses statistics of the entire test sequence. So although the method is test-label-free, it still uses test-time information.
- Each scale branch (a lightweight patch encoder with nearest normal-prototype scoring) is nearly identical to PaAno as described in the introduction. Beyond repeating it across scales and averaging, the novelty over PaAno is unclear.
Questions for authors
- See the weaknesses.
- Overall, the method reduces to a score-level ensemble of PaAno-like models over a hand-picked set of scales. It does not resolve the scale uncertainty that motivates it.