- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes a generator-based TSAD framework called FutureBound. The authors claim that “an observed normal continuation can anchor local exploration of the future space, providing comparisons for learning the surrounding boundary.” The paper proposes, rather than scoring anomalies by prediction error or Gaussian likelihood, treating normality as a history-conditioned region of admissible futures. Any observed future that falls outside the region is flagged as anomalous. The method adopts an alternating adversarial training strategy that trains the generator and the discriminator by distinguishing history-conditioned real futures from more realistic generated futures. The proposed method demonstrates significantly improved performance on the selected datasets.
Critical strengths
- The improvement on the seleted dataset is significant.
- Generator-based TSAD method is a promisning direction.
Critical weaknesses
- The paper’s key argument is that normal futures form a multimodal, non-convex, and possibly asymmetric region, which FutureBound can capture but Gaussian or forecasting approaches cannot. I cannot see how this is supported by any experiments.
- What is the connection between the two derived propositions and the proposed framework? Propositions 1 and 2 concern irreducible noise and the definition of convexity. Proposition 1 states that any single deterministic predictor is insufficient, while Proposition 2 concerns Gaussian or convex regions. Both suggest that current approaches are insufficient but do not prove the effectiveness of the proposed approach.
- The paper argues that single-trajectory-based forecasting is insufficient but does not include an adapted baseline in the experiments.
- I am concerned about the validity and fairness of the experiments. Some popular baselines perform surprisingly poorly, with TimesNet scoring 24.3 and PaAno scoring 27.3 on SWaT, and DCdetector scoring around 50 across all datasets. The top-k aggregation looks 15 steps ahead, but the baselines do not receive the same treatment. Some widely used datasets are missing, such as SMAP, WADI, and GECCO. Also, given that the paper is framed as general TSAD, univariate datasets should also be considered.
- In principle, the proposed method also generates near-normal negative samples to refine the decision boundary. Learning to discriminate normal data from synthetic negatives has already been explored by NCAD, SPAGD, and learned anomaly generators such as GenIAS. Moreover, NCAD already conditions detection on a preceding context window. The experiments do not show that the proposed adversarial training strategy and history-conditioned futures are more effective.
- How do we ensure that the proposed probes provide informative supervision for anomaly detection?
- Hyperparameter selection is not described, and no validation split is mentioned. Sensitivity to the top-k aggregation size k is not reported. This aggregation smooths scores and introduces up to H-1 steps of lookahead, so it is important to show that the performance gains do not primarily come from this processing.
Questions for authors
Please refer to the weaknesses.
3 comments
To W4: All methods are compared under a consistent offline TSAD setting, using the same data splits and point-wise evaluation metrics. Specifically, (1) hyper-parameters follow the original papers or public implementation defaults. TimesNet and DCdetector report point-adjusted results, whereas we evaluate raw scores without point adjustment or label-based score modification (see our response to Reviewer 6Mxy, Q4&W6 for more details). PaAno's published results use the TSB-AD-M benchmark, which differs from our datasets. (2) The 15-step look-ahead does not inherently compromise fairness in our offline setting, where the complete observation sequence is available to all methods. Different uses of temporal context and score aggregation reflect algorithmic design choices rather than unequal access to data, thus identical aggregation is not required. Additional comparisons with look-ahead-enhanced baselines are provided in our response to W7.
Finally, additional experiments on SMAP and TSB-AD-U are presented below and the complete version have been incorporated into the revised manuscript.
$\begin{matrix}\hline Dataset&Method&AUC&AUPRC&F1-Score\\\hline&SPAGD&51.86\pm1.60&14.23\pm1.52&19.06\pm7.37\\&AnomalyTrans&53.05\pm4.84&14.06\pm1.86&24.70\pm2.85\\&TimesNet&46.79\pm0.10&11.98\pm0.04&24.28\pm0.15\\SMAP&TranAD&42.51\pm0.96&10.59\pm0.21&23.00\pm0.05\\&PaAno&48.21\pm1.25&13.46\pm0.14&25.01\pm0.22\\&SDA2D&49.52\pm1.85&12.41\pm0.19&22.99\pm0.16\\&FutureBound&\bf60.02\pm1.84&\bf15.58\pm0.03&\bf29.75\pm1.70\\\hline\end{matrix}$
$\begin{matrix}\hline&OCSVM&LOF&IForest&AutoEncoder&Donut&OmniAnomaly&USAD&TFAD&DCdetector&DualTF&CATCH&MTGFlow&PaAno&SDA2D&FutureBound\\\hline VUS-PR&9.37&22.50&22.57&26.71&15.94&25.75&25.41&13.34&23.55&24.01&30.65&41.39&34.55&38.45&\bf42.08\pm0.47\\VUS-ROC&52.55&76.84&74.75&73.06&74.09&69.39&75.59&48.01&70.25&67.76&71.77&72.40&79.89&80.58&\bf82.69\pm0.31\\\hline\end{matrix}$
To W5: These methods differ in sample generation and optimization. NCAD uses predefined perturbations. SPAGD generates adaptive pseudo-anomalies through reconstruction and uses their residuals for anomaly-aware graph learning. GenIAS augments existing detectors through learnable VAE latent-variance perturbations constrained by predefined distance margins and patching rules. Yet FutureBound generates locally anchored, diverse, history-conditioned future probes without prescribing anomaly patterns or separation margins. Trajectory proximity and residual orientation guide their selective adversarial refinement through discriminator feedback, making them progressively harder to distinguish from normal futures. Our contribution thus extends beyond synthetic anomaly generation to directly learning the history-conditioned admissible boundary. We have add these discussions to Section 3.
Table 1 has already demonstrated that FutureBound outperforms NCAD and SPAGD, while Figs. 4 and 13 provide complementary anomaly score visualizations. For clarity, here we present the results again. $\begin{matrix} \hline &&SWaT&&&PSM&&&MSL&&&SMD&&&SMAP&\\\hline &AUC&AUPRC&F1-Score&AUC&AUPRC&F1-Score&AUC&AUPRC&F1-Score&AUC&AUPRC&F1-Score&AUC&AUPRC&F1-Score\\\hline NCAD&81.16\pm2.29&53.54\pm4.19&70.56\pm1.16 &60.94\pm5.39&37.88\pm2.49&46.18\pm3.63 &60.67\pm1.53&15.06\pm0.35&22.77\pm0.77 &60.71\pm0.44&7.81\pm0.28&13.80\pm0.44 &46.44\pm1.18&12.40\pm0.33&23.11\pm0.04\\ SPAGD&73.76\pm4.24&29.55\pm6.51&40.35\pm9.06 &49.64\pm6.94&30.14\pm3.97&48.77\pm1.20 &54.93\pm2.87&16.73\pm3.41&26.33\pm1.70 &51.17\pm0.60&9.77\pm0.84&16.63\pm0.19 &51.86\pm1.60&14.23\pm1.52&19.06\pm7.37\\ FutureBound&85.45\pm1.16&75.12\pm0.74&76.84\pm0.02 &76.19\pm3.27&54.39\pm4.39&56.77\pm2.37 &72.34\pm0.92&24.19\pm1.42&31.67\pm1.34 &77.20\pm0.54&21.16\pm3.35&28.05\pm2.93 &60.02\pm1.84&15.58\pm0.03&29.75\pm1.70\\\hline \end{matrix}$
GenIAS's official implementation requires 1,000 pretraining epochs without early stopping, followed by downstream detector training, exceeding our computational budget. We therefore provide only a methodological comparison, without claiming empirical superiority.
To W6: anchors probes to normal evolution, while promotes diversity and discourages collapse. The discriminator selects nearby probes to avoid trivial discrimination, whereas the generator refines probes from different residual orientations. Adversarial feedback raises their compatibility scores, creating harder local comparisons for history-future discrimination. Their supervisory value therefore comes from adaptive comparisons, not predefined anomaly patterns or assuming every probe is anomalous.
Fig. 8 supports this mechanism: removing fitting or diversity degrades performance, while Generator-Only and Gaussian Perturbation-GAN assess the benefits of adversarial discrimination and learned probes, respectively. Fig. 3 visualizes the resulting probes and boundary responses.
To W7: Appendix E provides the hyperparameter settings, which are fixed across datasets. Training uses only normal data without a separate validation set.
We additionally evaluate on SMD and MSL (Appendix H, Fig. 17(b)–(c)), where "All" averages all overlapping trajectory scores. Performance remains relatively stable, and the default is not the best-performing setting, indicating that our results do not rely on selecting a particularly favorable aggregation size.
$\begin{matrix}\hline &&SMD&&&MSL&\\ k&AUC&AUPRC&F1-Score&AUC&AUPRC&F1-Score\\ \hline 1&77.58&22.14&28.98&72.67&24.46&31.57\\ 3&77.20&21.16&28.05&72.34&24.19&31.67\\ 5&77.87&22.49&28.95&73.03&25.55&32.92\\ 10&77.88&23.19&28.54&72.88&26.05&32.70\\ All&77.90&23.71&28.27&70.56&24.25&34.68\\ \hline \end{matrix}$
The maximum detection latency arises from evaluating complete future trajectories. To assess the influence of lookahead and aggregation, we additionally apply the same 15-step lookahead to SPAGD, PaAno, and SDA2D (Table 3). FutureBound retains the highest mean performance across PSM, SMD, and MSL, providing evidence that its improvements are not solely attributable to this processing.
$\begin{matrix} \hline Dataset&Method&AUC&AUPRC&F1-Score\\\hline PSM&SPAGD&49.45\pm7.48&29.84\pm3.72&50.90\pm3.82\\ &PaAno&67.31\pm3.28&41.56\pm2.90&50.73\pm3.04\\ &SDA2D&71.61\pm0.54&50.85\pm0.56&51.39\pm0.29\\ &FutureBound&\bf76.19\pm3.27&\bf54.39\pm4.39&\bf56.77\pm2.37\\ \hline SMD&SPAGD&52.17\pm2.05&9.83\pm0.73&16.95\pm0.46\\ &PaAno&77.14\pm1.50&10.82\pm0.90&20.21\pm0.73\\ &SDA2D&74.28\pm0.27&16.78\pm0.44&24.21\pm0.15\\ &FutureBound&\bf77.20\pm0.54&\bf21.16\pm3.35&\bf28.05\pm2.93\\ \hline MSL&SPAGD&52.35\pm3.97&17.07\pm2.42&29.45\pm2.53\\ &PaAno&70.70\pm1.98&20.78\pm0.95&28.71\pm2.15\\ &SDA2D&55.81\pm0.15&14.39\pm0.45&21.02\pm0.25\\ &FutureBound&\bf72.34\pm0.92&\bf24.19\pm1.42&\bf31.67\pm1.34\\\hline \end{matrix}$
We hope our explanations can clarify the points raised. Please feel free to reach out if any further clarification is needed.
We thank the reviewer for taking the time to evaluate our work. We provide our responses and corresponding revisions below.
To W1: Our motivation is that normal futures may vary under the same historical context, while their admissible geometry is generally unknown. Possible structures include multimodality, non-convexity, asymmetry, etc. Proposition 1 establishes irreducible future variability, while Proposition 2 highlights the limitations of convex regions. Fig. 2 further reveals Gaussian mismatch in prediction residuals. Together, these findings motivate flexible boundary learning.
FutureBound addresses this through a nonlinear discriminator that learns compatibility between historical contexts and future trajectories, allowing decision regions beyond predefined convex shapes. Locally anchored and diverse probes, together with selective adversarial optimization, provide challenging comparisons for learning this boundary.
Our experiments support this design. Figs. 3, 11, and 12 visualize the generated probes and discriminator responses, while Fig. 8 validates the contributions of future-space exploration and adversarial optimization. These results demonstrate effective discrimination rather than exact recovery of the underlying region. Unlike predictive distribution estimation, FutureBound directly learns compatibility for anomaly detection, while flexible probabilistic forecasters can also represent multiple futures.
To W2: Propositions 1 and 2 motivate FutureBound's design rather than guarantee its effectiveness. Proposition 1 establishes irreducible normal future variability, motivating diverse, locally anchored probes beyond a single prediction. Proposition 2 highlights the limitations of convex decision regions, motivating our geometry-unconstrained discriminator, whose ability to represent non-convex regions is demonstrated in our preceding response.
These principles are implemented through local probe exploration and selective adversarial boundary refinement. While the propositions do not guarantee recovery of the true boundary, Figures 3 and 8 and Table 1 provide empirical evidence of the framework's effectiveness. We have clarified these connections in the revision.
To W3: We have supplemented results with GDN, a representative forecasting-based anomaly detector that predicts future observations from historical data and identifies anomalies through prediction errors. As shown in the table below, FutureBound achieves higher metrics than GDN across all four datasets. These results provide empirical evidence that learning history-conditioned future admissibility offers practical advantages over relying on a single predicted trajectory for anomaly detection.
$\begin{matrix} \hline &&SWaT&&&PSM&&&MSL&&&SMD&\\ \hline &AUC&AUPRC&F1-Score&AUC&AUPRC&F1-Score&AUC&AUPRC&F1-Score&AUC&AUPRC&F1-Score\\\hline GDN &85.09\pm2.11&65.75\pm11.46&69.19\pm6.82 &70.48\pm4.72&45.70\pm1.97&52.93\pm4.19 &53.52\pm0.16&12.12\pm0.16&19.48\pm0.59 &66.95\pm1.52&10.90\pm0.88&14.58\pm4.65\\ FutureBound&\bf85.45\pm1.16&\bf75.12\pm0.74&\bf76.84\pm0.02&\bf76.19\pm3.27&\bf54.39\pm4.39&\bf56.77\pm2.37&\bf72.34\pm0.92&\bf24.19\pm1.42&\bf31.67\pm1.34&\bf77.20\pm0.54&\bf21.16\pm3.35&\bf28.05\pm2.93\\ \hline \end{matrix}$