Representation Learning in Anomaly Detection: Successes, Limits and a Grand Challenge

Yedid Hoshen
7/20/2023
cs.LGcs.CV

No confident code implementation found for this paper.

Abstract

In this perspective paper, we argue that the dominant paradigm in anomaly detection cannot scale indefinitely and will eventually hit fundamental limits. This is due to the a no free lunch principle for anomaly detection. These limitations can be overcome when there are strong tasks priors, as is the case for many industrial tasks. When such priors do not exists, the task is much harder for anomaly detection. We pose two such tasks as grand challenges for anomaly detection: i) scientific discovery by anomaly detection ii) a "mini-grand" challenge of detecting the most anomalous image in the ImageNet dataset. We believe new anomaly detection tools and ideas would need to be developed to overcome these challenges.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{hoshen2023representation,
  title  = {Representation Learning in Anomaly Detection: Successes, Limits and a Grand Challenge},
  author = {Yedid Hoshen},
  year   = {2023},
  eprint = {2307.11085},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.11085v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.11085.svg)](https://codeofpaper.com/paper/2307.11085)

Discussion