Memory-Bounded Continuation of Greedy Sampling for Continual Anomaly Detection

Excerpt

arXiv:2608.15277v1 Announce Type: cross Abstract: Greedy sampling produces a compact yet representative summary of normal data, which is essential for reliable anomaly detection that relies on measuring distance from normality. For continual anomaly detection where tasks arrive sequentially, extending greedy sampling is straightforward with unbounded memory through coreset accumulation. However, practical deployment requires fixed memory where the coreset size remains constant regardless of task