arXiv Machine Learning

RIFT: Relative Isolation From Trees For Anomaly Detection

RIFT (Relative Isolation From Trees) is a deterministic anomaly detection method that builds a minimum spanning tree and scores points by the sum of apparent edge sizes from each point. For one-dimensional data, RIFT reproduces the closed-form limit of Isolation Forest exactly, while in higher dimensions it offers a parameter‑free, robust alternative that avoids axis‑parallel artifacts and handles varying density and clustered anomalies. An ensemble variant is proposed for large datasets, and experiments on synthetic data and the ADBench benchmark show comparable accuracy to Isolation Forest with reduced variance across random seeds.

arXiv Machine Learning
Sep 3

Monotonic anomaly detection

The paper introduces methods for monotonic anomaly detection, focusing on anomalies that exhibit high (or low) attribute values rather than arbitrary deviations. It proposes an asymmetrical distance measure using a ramp function for distance-based methods and a modified path length algorithm for Isolation Forest. Experiments on synthetic and real-life datasets demonstrate improved detection performance on datasets with monotonic attributes.

By Oliver Urs Lenz, Matthijs van Leeuwen
arXiv Machine Learning
Sep 15

Isolation-based Spherical Ensemble Representations for Tabular Anomaly Detection

The paper introduces ISER, an isolation-based method for unsupervised tabular anomaly detection that uses hypersphere radii to encode local density and maintains linear time and constant space complexity. ISER builds ensemble representations where smaller radii indicate dense regions and larger radii indicate sparse regions, and it employs a similarity-based scoring method that compares these representations to a theoretical anomaly reference pattern. Experiments on 20 real-world datasets show that ISER outperforms 12 state‑of‑the‑art methods, including an enhanced Isolation Forest.

By Yang Cao, Sikun Yang, Hao Tian, Kai He, Lianyong Qi, Ming Liu, Yujiu Yang, Hong-Kun Zhang
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.

By Kevin Wilkinghoff, Zheng-Hua Tan
arXiv AI
Jun 12

CRAFTIIF: Cross-Resolution Analytic Four-Type Interpretable Isolation Forest for Multivariate Time Series Anomaly Detection

arXiv:2606. 13486v1 Announce Type: cross Abstract: Anomaly detection in multivariate time series is challenged by four structurally distinct anomaly types -- point (isolated spikes), distributional (level shifts), temporal (rhythm changes), and collective (inter-sensor correlation breakdowns) -- each requiring different feature representations.

By William Smits
Hugging Face Trending Papers
Sep 3

Differentiable Interval Bottlenecks for Interpretable Anomaly Detection in Numerical Data

DIFFINT is a reconstruction‑based anomaly detector that replaces the opaque latent bottleneck of a standard autoencoder with a set of soft, axis‑aligned interval memberships learned directly from raw numerical data. Each latent unit represents a human‑readable hyper‑rectangle, and an instance’s anomaly score is its reconstruction error weighted by how strongly it falls inside these intervals. The method provides a certified lower bound on reconstruction error for points outside all active intervals, a graded suppression mechanism for sparse anomalies, and a closed‑form, label‑free importance ranking for each (unit, feature) pair, achieving top performance on 48 ADBench benchmarks against 22 baselines. whyItMatters":"DIFFINT offers the first interpretable anomaly detector that maintains competitive performance while revealing which feature ranges drive each anomaly score, enabling practitioners to audit and understand model decisions without requiring anomaly labels."

arXiv AI
Sep 4

Differentiable Interval Bottlenecks for Interpretable Anomaly Detection in Numerical Data

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
arXiv Computer Vision
Sep 23

AT3D-AD: Anomaly Type-Aware 3D Anomaly Detection via Hierarchical Point-Language Alignment

AT3D-AD introduces a unified framework for detecting, localizing, and classifying 3D point‑cloud anomalies. It uses a Physics‑Driven Parametric Anomaly Synthesis module to generate synthetic defects for explicit supervision, a Hierarchical Global‑Local Anomaly Alignment module to refine representations, and a Semantic‑Geometric Anomaly Classification module to achieve precise, type‑discriminative localization. The method sets new state‑of‑the‑art results on four benchmarks, achieving high AUROC and Macro‑F1 scores.

By Jingyu Zeng, Haoquan Lu, Can Gao