An Iterative Method for Unsupervised Robust Anomaly Detection Under Data Contamination
Minkyung Kim, Jongmin Yu, Junsik Kim, Tae-Hyun Oh, Jun Kyun Choi

TL;DR
This paper introduces an iterative, model-agnostic framework for robust unsupervised anomaly detection that effectively handles contaminated datasets by dynamically weighting samples, improving detection accuracy across diverse models and datasets.
Contribution
It proposes a novel iterative importance weighting method to enhance anomaly detection robustness under data contamination, applicable to various existing approaches.
Findings
Improves anomaly detection performance on contaminated datasets.
Enhances robustness of different deep anomaly detection models.
Effective across multiple benchmark and image datasets.
Abstract
Most deep anomaly detection models are based on learning normality from datasets due to the difficulty of defining abnormality by its diverse and inconsistent nature. Therefore, it has been a common practice to learn normality under the assumption that anomalous data are absent in a training dataset, which we call normality assumption. However, in practice, the normality assumption is often violated due to the nature of real data distributions that includes anomalous tails, i.e., a contaminated dataset. Thereby, the gap between the assumption and actual training data affects detrimentally in learning of an anomaly detection model. In this work, we propose a learning framework to reduce this gap and achieve better normality representation. Our key idea is to identify sample-wise normality and utilize it as an importance weight, which is updated iteratively during the training. Our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
