Scalable, Explainable and Provably Robust Anomaly Detection with One-Step Flow Matching
Zhong Li, Qi Huang, Yuxuan Zhu, Lincen Yang, Mohammad Mohammadi Amiri, Niki van Stein, Matthijs van Leeuwen
摘要
We introduce Time-Conditioned Contraction Matching (TCCM), a novel method for semi-supervised anomaly detection in tabular data. TCCM is inspired by flow matching, a recent generative modeling framework that learns velocity fields between probability distributions and has shown strong performance compared to diffusion models and generative adversarial networks. Instead of directly applying flow matching as originally formulated, TCCM builds on its core idea-learning velocity fields between distributions-but simplifies the framework by predicting a time-conditioned contraction vector toward a fixed target (the origin) at each sampled time step. This design offers three key advantages: (1) a lightweight and scalable training objective that removes the need for solving ordinary differential equations during training and inference; (2) an efficient scoring strategy called one time-step deviation, which quantifies deviation from expected contraction behavior in a single forward pass, addressing the inference bottleneck of existing continuous-time models such as DTE (a diffusion-based model with leading anomaly detection accuracy but heavy inference cost); and (3) explainability and provable robustness, as the learned velocity field operates directly in input space, making the anomaly score inherently feature-wise attributable; moreover, the score function is Lipschitz-continuous with respect to the input, providing theoretical guarantees under small perturbations. Extensive experiments on the ADBench benchmark show that TCCM strikes a favorable balance between detection accuracy and inference cost, outperforming state-of-the-art methods-especially on high-dimensional and large-scale datasets. The source code is provided at https://github.com/ZhongLIFR/TCCM-NIPS.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- Denoising without Diffusion: Fixed-Noise Denoiser Anomaly Detection in Tabular DataManuel Hirth, Lukas Koberg, Nasser Jazdi, Enkelejda KasneciICML 2026
- Automatic Unsupervised Ensemble Outlier Model SelectionHong-Phuc Phan, Tuan-Anh Vu, Tung Kieu, Sơn Hà Xuân 等ICML 2026
- Tuning-Free One-Class Discriminant Learning for Tabular Anomaly DetectionXuan-Ha Nguyen, Vu Duong, VanHoi Nguyen, Kim-Hung Le 等ICML 2026
它引用的顶会 Paper17
- Denoising Diffusion Probabilistic ModelsJonathan Ho, Ajay Jain, Pieter AbbeelNeurIPS 2020 · 被引用 35,902 次
- Score-Based Generative Modeling through Stochastic Differential EquationsYang Song, Jascha Sohl-Dickstein, Diederik P. Kingma, Abhishek Kumar 等ICLR 2021 · 被引用 1,270 次
- Classification-Based Anomaly Detection for General DataLiron Bergman, Yedid HoshenICLR 2020 · 被引用 412 次
- DROCC: Deep Robust One-Class ClassificationSachin Goyal, Aditi Raghunathan, Moksh Jain, Harsha Vardhan Simhadri 等ICML 2020 · 被引用 202 次
- A Closer Look at AUROC and AUPRC under Class ImbalanceMatthew B. A. McDermott, Haoran Zhang, Lasse Hyldig Hansen, Giovanni Angelotti 等NeurIPS 2024 · 被引用 191 次
相关 Paper
- Diffusion-Scheduled Denoising Autoencoders for Anomaly Detection in Tabular DataTimur Sattarov, Marco Schreyer, Damian BorthKDD 2025 · 被引用 3 次
- On Diffusion Modeling for Anomaly DetectionVictor Livernoche, Vineet Jain, Yashar Hezaveh, Siamak RavanbakhshICLR 2024 · 被引用 74 次
- Fascinating Supervisory Signals and Where to Find Them: Deep Anomaly Detection with Scale LearningHongzuo Xu, Yijie Wang, Juhui Wei, Songlei Jian 等ICML 2023 · 被引用 65 次
- Debiasing Trace Guidance: Top-Down Trace Distillation and Bottom-up Velocity Alignment for Unsupervised Anomaly DetectionXingjian Wang, Li Chai, Jiming ChenICCV 2025 · 被引用 2 次
- DFM: Differentiable Feature Matching for Anomaly DetectionSheng Wu, Yimi Wang, Xudong Liu, Yuguang Yang 等CVPR 2025
