DIFFINT is a reconstruction‑based anomaly detector that uses a differentiable autoencoder with a latent bottleneck composed of soft, axis‑aligned interval memberships. Each latent unit represents a human‑readable hyper‑rectangle in feature space, allowing the model to encode how strongly an instance falls inside each interval and to compute reconstruction error as the anomaly score. The method provides a certified lower bound on reconstruction error for points outside all active intervals, a suppression mechanism for sparse abnormalities, and a closed‑form, label‑free importance ranking for each (unit, feature) pair, achieving top performance on 48 ADBench benchmarks against 22 baselines.
By Lamine Diop, Marc Plantevit
WAND is an unsupervised tabular anomaly detector that scores each point by how far its projection on unit‑sphere directions deviates from a sub‑Gaussian baseline. The directions that flag a point serve as its explanation, providing per‑feature attribution at no extra cost and recoverable via gradients. On 47 ADBench datasets, WAND matches or exceeds 16 baselines in ROC‑AUC while delivering more accurate, faithful explanations than post‑hoc SHAP, LIME, or ECOD, all with linear scoring time and a probe‑efficiency guarantee.
By Lamine Diop
The paper studies a class of tabular anomaly detectors that train a neural map toward a fixed target using squared‑error loss, noting that improved optimization can paradoxically worsen detection performance—a phenomenon termed convergence collapse. It demonstrates that this collapse arises because the learned map extrapolates beyond the training data, erasing residual signals on anomalies. To address this, the authors introduce Kernel Contraction Matching (KCM), a closed‑form, training‑free kernel‑based baseline, and propose the Kernel‑Anchored Regularizer (KAR), which penalizes deviations from a kernel‑weighted average of training targets, thereby mitigating collapse and improving AUROC during extended training.
By Jos\'e Lucas De Melo Costa, Fabrice Popineau, Arpad Rimmel, Bich-Li\^en Doan
arXiv:2610.09670v1 Announce Type: new
Abstract: Unsupervised anomaly detection, which learns only from normal images, is a central task in medical image analysis and remains an open problem. Reconstr...
By Shouhei Hanaoka, Takahiro Nakao, Atsushi Takamatsu, Takeharu Yoshikawa, Osamu Abe
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.
By Kevin Wilkinghoff, Zheng-Hua Tan
LEAP is a new time‑series anomaly detection model that avoids reconstruction by using masked prediction and latent‑embedding evidence. It removes patches from a window, predicts them from remaining context, and scores prediction errors as anomaly evidence. The model incorporates three label‑free novelty signals—latent‑embedding novelty, local temporal contrast, and per‑channel novelty—and achieves strong performance on the TSB‑AD benchmark, with statistically significant gains from each component.
By Cristhian Moya-Mota, Ignacio Aguilera-Martos, Diego Garc\'ia-Gil, Juli\'an Luengo
The paper investigates anomaly detection in high-energy physics by learning low-dimensional representations of collision events. Using supervised and self-supervised neural embeddings on a large simulated dataset, the authors find that supervised objectives generally outperform self-supervised ones and improve signal efficiency compared to traditional kinematic-feature autoencoders. They also propose a local diagnostic pipeline that models the Standard Model latent space with a Gaussian Mixture Model, profiles components via high-level observables, and ranks these observables by their local discriminating power, thereby linking anomaly scores to specific kinematic features.
By Donatella Genovese, Philip Ploner, Simone Scardapane, Stefano Giagu, Thea Klaeboe Aarrestad
arXiv:2606. 09874v1 Announce Type: new Abstract: Reconstruction-based methods are widely used for time series anomaly detection, where models are trained to reconstruct subsequences, and anomalies are identified through reconstruction errors.
By Guillaume Coulaud (UM, IROKO), Reza Akbarinia (IROKO), Florent Masseglia (IROKO)
arXiv:2606. 28970v1 Announce Type: cross Abstract: Unsupervised tabular anomaly detection requires methods that are accurate, robust across heterogeneous datasets, and computationally efficient.
By Quanling Zhao, Jiaying Yang, Ye Tian, Josh Victoria, Zhijun Wang, Pietro Mercati, Onat Gungor, Tajana Rosing
The paper introduces Concept-Aware Visual Anomaly Detection (Concept-Aware VAD), a framework that extends Concept Bottleneck Models to visual anomaly detection. It offers dual-branch architecture: a concept branch for human-interpretable descriptions and a visual branch for pixel-level localization, evaluated on three VAD benchmarks with competitive performance. A user study shows higher effectiveness and lower misleading rates compared to state-of-the-art explainers, and concept-level interventions improve unsupervised detection.
By Arianna Stropeni, Valentina Zaccaria, Francesco Borsatti, Davide Dalle Pezze, Manuel Barusco, Gian Antonio Susto
arXiv:2608. 13652v1 Announce Type: new Abstract: Generic event-level anomaly detection for collider physics has two recurring problems: anomaly scores are hard to interpret, and they correlate strongly with energy scale and object multiplicity.
By Haoyi Jia, Sagar Addepalli, Julia Gonski
VACE (Velocity‑Aligned Channel Embeddings) is a self‑supervised anomaly detection method for multivariate time series that learns a geometrically structured representation. It trains a channel‑aware encoder using a velocity‑consistency objective, avoiding negatives and synthetic anomalies, so that normal data form locally smooth, directionally coherent trajectories in embedding space. At inference, VACE combines a Mahalanobis positional score with a directional score that gates the positional score where local dynamics deviate, achieving state‑of‑the‑art performance on the TSB‑AD‑M benchmark.
By Alberto D. Cencillo, Leonardo Concepci\'on, Isaac Triguero, Juli\'an Luengo