- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper considers streaming anomaly detection when the normal distribution changes over time and incoming data are contaminated by anomalies. The main difficulty is deciding which observations can safely be used for updating the detector. In particular, samples from a new normal component may look anomalous under the current model, while updating on all incoming samples risks incorporating genuine anomalies into the estimated background. The authors propose Evolving Score Fields (ESF). The method uses a neural score field to characterize the background distribution and measures anomalies through the consistency of score directions under perturbations. For adaptation, it combines this score-based measure with neighborhood support computed from the current block. Selected observations are then used for local denoising score matching with LoRA adapters and historical replay. A sample-aware merge transfers part of the local update to the model used for subsequent blocks. The experiments cover three HyperAD scenes and sparse-fault streams derived from the Tennessee Eastman Process (TEP). ESF performs particularly well on the hyperspectral benchmarks and also obtains strong results on TEP.
Critical strengths
The problem addressed in this paper is relevant to practical streaming anomaly detection. I agree with the authors that rejecting all high-scoring observations can prevent a detector from learning new normal patterns. Conversely, updating on every incoming observation can gradually reduce sensitivity to anomalies. This tension is important and deserves more attention.
In Table 1, ESF achieves an AUPRC of 0.8749 on SNP and 0.4111 on Beach, both substantially higher than the reported baselines. Table 3 also provides useful evidence for the importance of selecting adaptation samples: removing confidence-based selection reduces the mean AUPRC from 0.5630 to 0.1700. This suggests that the improvement is not simply due to continuously updating a score model.
Critical weaknesses
-
My main concern is the assumption that neighborhood support provides sufficient evidence for admitting unfamiliar observations into adaptation. In Section 3.2, support is estimated using the distance to the K-th nearest neighbor. The authors argue that choosing K above the anticipated anomaly count prevents isolated anomaly groups from receiving high support. This reasoning seems plausible for sparse, isolated anomalies, but I am less convinced when abnormal observations form a persistent or structured cluster. For instance, a repeated sensor fault could produce a compact group of observations. If the group becomes sufficiently prevalent, it may receive high neighborhood support even though it does not represent a new normal operating condition. Moreover, Eqs. (11)–(12) increase the weight assigned to neighborhood support when unfamiliar observations become widespread. I wonder whether this mechanism could reinforce the selection of such abnormal clusters.
-
The HyperAD experiments are convincing in terms of detection performance, and the TEP experiment provides evidence beyond spectral observations. However, I found it difficult to determine how much of the improvement comes from learning new normal components, as opposed to adapting to relatively smooth changes in the observed background. The controlled A-to-B experiment in Appendix D.2 helps explain how newly appearing normal samples can enter adaptation. Still, the paper would benefit from a more systematic comparison of gradual drift, abrupt shifts, and the appearance of multiple new components within a short period.
-
The paper motivates score fields through their ability to represent local manifold geometry without explicitly parameterizing the manifold. This is reasonable, and the direction-consistency measure in Eq. (9) provides a specific way to use that geometry for anomaly detection. However, the current experiments make it difficult to separate the benefit of score-field modeling from the benefit of the overall adaptation strategy. For example, Table 3 shows that confidence-based sample selection is important, but it does not establish whether a score field is necessary to obtain this improvement. Could a comparable selection and replay strategy also work with an autoencoder or another learned representation?
Questions for authors
-
In the persistent-contamination experiment, how are anomalous samples distributed across blocks? In particular, does the experiment include coherent anomaly clusters that remain present over several consecutive blocks?
-
What happens when the anomaly proportion approaches or exceeds the neighborhood-size assumption used to choose K? Is there a contamination level at which the selection mechanism begins to admit a substantial number of anomalies?
-
Can the authors provide a controlled experiment comparing gradual background evolution with an abrupt shift? It would be useful to report both the detection performance immediately after the shift and the number of blocks required for adaptation.
-
How much of the performance gain comes specifically from score-direction consistency? A comparison using the same sample-selection and adaptation procedure with an alternative representation would help clarify the role of score-based modeling.