The Familiarity Hypothesis: Explaining the Behavior of Deep Open Set Methods
Thomas G. Dietterich, Alexander Guyer

TL;DR
This paper introduces the Familiarity Hypothesis, suggesting that deep open set recognition methods detect the absence of familiar features rather than true novelty, impacting their effectiveness in complex scenarios.
Contribution
The paper proposes the Familiarity Hypothesis as an explanation for the success of current deep open set methods and discusses its implications for future research.
Findings
Familiarity-based methods often fail to detect novelty when multiple objects are present.
Evidence shows these methods detect the absence of familiar features, not the presence of new ones.
The hypothesis is supported by literature review and new experimental data.
Abstract
In many object recognition applications, the set of possible categories is an open set, and the deployed recognition system will encounter novel objects belonging to categories unseen during training. Detecting such "novel category" objects is usually formulated as an anomaly detection problem. Anomaly detection algorithms for feature-vector data identify anomalies as outliers, but outlier detection has not worked well in deep learning. Instead, methods based on the computed logits of visual object classifiers give state-of-the-art performance. This paper proposes the Familiarity Hypothesis that these methods succeed because they are detecting the absence of familiar learned features rather than the presence of novelty. This distinction is important, because familiarity-based detection will fail in many situations where novelty is present. For example when an image contains both a novel…
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.
