arXiv Machine Learning
Anomaly-Free Self-Optimization via AUC Bounds
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Sep 23
Can We Predict Anomaly Detection Performance from Embedding-Space Geometry?
The paper investigates whether the performance of anomaly detection systems can be predicted without labeled anomalies. For kNN-based detectors, it derives a lower bound on AUC that links detection performance to the separation and variance of inlier and outlier scores, and uses this to analyze how density variation, intrinsic dimensionality, and domain mismatch affect score variability. The authors introduce pseudo‑anomaly probes that provide a reference for estimating relative score separation, and demonstrate through experiments on DCASE benchmarks that these probes enable anomaly‑free model selection to outperform conventional development‑set selection, especially under domain shift.
arXiv AI
Sep 25
Deep Positive-Unlabeled Anomaly Detection for Contaminated Unlabeled Data
The paper introduces a deep positive‑unlabeled anomaly detection framework that combines positive‑unlabeled learning with deep models such as autoencoders and deep support vector data descriptions. It addresses the issue of contaminated unlabeled data by approximating anomaly scores for normal data using both unlabeled and labeled anomaly samples, allowing training without labeled normal data. The authors provide a theoretical generalization error bound and demonstrate improved detection performance over existing methods on several datasets.
arXiv Machine Learning
Jun 19
We Need to Rethink Benchmarking in Anomaly Detection
arXiv:2507. 15584v2 Announce Type: replace Abstract: Despite the continuous proposal of new anomaly detection algorithms and extensive benchmarking efforts, progress seems to stagnate, with only minor performance differences between established baselines and new algorithms.
arXiv AI
Jun 12
ASTER: Latent Pseudo-Anomaly Generation for Unsupervised Time-Series Anomaly Detection
arXiv:2604. 13924v3 Announce Type: replace-cross Abstract: Time-series anomaly detection (TSAD) is critical in domains such as industrial monitoring, healthcare, and cybersecurity, but it remains challenging due to rare and heterogeneous anomalies and the scarcity of labelled data.
arXiv Machine Learning
Sep 24
CAST: Context- and Anomaly Structure-Conditioned Time Series Anomaly Generation
CAST is a framework for generating anomalous time series that addresses the scarcity and heterogeneity of anomaly data. It uses a two‑stage approach: pretraining on abundant normal data to learn system dynamics, then finetuning with anomaly structure representations to capture diverse anomaly morphologies. Experiments on real‑world datasets show that CAST outperforms existing methods in both generation quality and downstream task performance.
arXiv Machine Learning
Jul 23
NeuCoReClass AD: Redefining Self-Supervised Time Series Anomaly Detection
arXiv:2508. 00909v2 Announce Type: replace Abstract: Time series anomaly detection plays a critical role in a wide range of real-world applications.