arXiv Machine Learning
Post-Anomaly Detection Inference for Deep SVDD
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
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
Jul 27
Deep Convolutional Large-Margin $\ell_p$-SVDD for Visual Anomaly Detection
arXiv:2607. 22212v1 Announce Type: cross Abstract: Visual anomaly detection requires adaptive representations and reliable decision boundaries, particularly when anomalous training samples are scarce and class distributions are highly imbalanced.
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
Jul 24
CLOE: Christoffel Loss Autoencoder for Anomaly Detection
arXiv:2607. 20530v1 Announce Type: cross Abstract: Semi-supervised anomaly detection plays a key role in diverse fields such as process monitoring, healthcare, and finance.
arXiv AI
Jun 30
RGLD: Randomized Global-Local Density Estimation for Tabular Anomaly Detection
arXiv:2606. 28970v1 Announce Type: cross Abstract: Unsupervised tabular anomaly detection requires methods that are accurate, robust across heterogeneous datasets, and computationally efficient.
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.