TL;DR
This paper introduces a novel anomaly detection method that optimizes score distribution discrimination using Overlap loss, improving robustness and adaptability in scenarios with noisy unlabeled data.
Contribution
The paper proposes Overlap loss, a new loss function that enhances anomaly detection by focusing on score distribution separation without relying on predefined score targets.
Findings
Outperforms state-of-the-art anomaly detection methods
Effective in scenarios with anomaly contamination in unlabeled data
Improves detection accuracy across various datasets
Abstract
Recent studies give more attention to the anomaly detection (AD) methods that can leverage a handful of labeled anomalies along with abundant unlabeled data. These existing anomaly-informed AD methods rely on manually predefined score target(s), e.g., prior constant or margin hyperparameter(s), to realize discrimination in anomaly scores between normal and abnormal data. However, such methods would be vulnerable to the existence of anomaly contamination in the unlabeled data, and also lack adaptation to different data scenarios. In this paper, we propose to optimize the anomaly scoring function from the view of score distribution, thus better retaining the diversity and more fine-grained information of input data, especially when the unlabeled data contains anomaly noises in more practical AD scenarios. We design a novel loss function called Overlap loss that minimizes the overlap area…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
