Exploring Diverse Representations for Open Set Recognition
- URL: http://arxiv.org/abs/2401.06521v1
- Date: Fri, 12 Jan 2024 11:40:22 GMT
- Title: Exploring Diverse Representations for Open Set Recognition
- Authors: Yu Wang, Junxian Mu, Pengfei Zhu, Qinghua Hu
- Abstract summary: Open set recognition (OSR) requires the model to classify samples that belong to closed sets while rejecting unknown samples during test.
Currently, generative models often perform better than discriminative models in OSR.
We propose a new model, namely Multi-Expert Diverse Attention Fusion (MEDAF), that learns diverse representations in a discriminative way.
- Score: 51.39557024591446
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Open set recognition (OSR) requires the model to classify samples that belong
to closed sets while rejecting unknown samples during test. Currently,
generative models often perform better than discriminative models in OSR, but
recent studies show that generative models may be computationally infeasible or
unstable on complex tasks. In this paper, we provide insights into OSR and find
that learning supplementary representations can theoretically reduce the open
space risk. Based on the analysis, we propose a new model, namely Multi-Expert
Diverse Attention Fusion (MEDAF), that learns diverse representations in a
discriminative way. MEDAF consists of multiple experts that are learned with an
attention diversity regularization term to ensure the attention maps are
mutually different. The logits learned by each expert are adaptively fused and
used to identify the unknowns through the score function. We show that the
differences in attention maps can lead to diverse representations so that the
fused representations can well handle the open space. Extensive experiments are
conducted on standard and OSR large-scale benchmarks. Results show that the
proposed discriminative method can outperform existing generative models by up
to 9.5% on AUROC and achieve new state-of-the-art performance with little
computational cost. Our method can also seamlessly integrate existing
classification models. Code is available at https://github.com/Vanixxz/MEDAF.
Related papers
- Diversified Outlier Exposure for Out-of-Distribution Detection via
Informative Extrapolation [110.34982764201689]
Out-of-distribution (OOD) detection is important for deploying reliable machine learning models on real-world applications.
Recent advances in outlier exposure have shown promising results on OOD detection via fine-tuning model with informatively sampled auxiliary outliers.
We propose a novel framework, namely, Diversified Outlier Exposure (DivOE), for effective OOD detection via informative extrapolation based on the given auxiliary outliers.
arXiv Detail & Related papers (2023-10-21T07:16:09Z) - Leveraging Diffusion Disentangled Representations to Mitigate Shortcuts
in Underspecified Visual Tasks [92.32670915472099]
We propose an ensemble diversification framework exploiting the generation of synthetic counterfactuals using Diffusion Probabilistic Models (DPMs)
We show that diffusion-guided diversification can lead models to avert attention from shortcut cues, achieving ensemble diversity performance comparable to previous methods requiring additional data collection.
arXiv Detail & Related papers (2023-10-03T17:37:52Z) - Diffusion Models Beat GANs on Image Classification [37.70821298392606]
Diffusion models have risen to prominence as a state-of-the-art method for image generation, denoising, inpainting, super-resolution, manipulation, etc.
We present our findings that these embeddings are useful beyond the noise prediction task, as they contain discriminative information and can also be leveraged for classification.
We find that with careful feature selection and pooling, diffusion models outperform comparable generative-discriminative methods for classification tasks.
arXiv Detail & Related papers (2023-07-17T17:59:40Z) - Progressive Open Space Expansion for Open-Set Model Attribution [19.985618498466042]
We focus on a challenging task, namely Open-Set Model Attribution (OSMA), to simultaneously attribute images to known models and identify those from unknown ones.
Compared to existing open-set recognition (OSR) tasks, OSMA is more challenging as the distinction between images from known and unknown models may only lie in visually imperceptible traces.
We propose a Progressive Open Space Expansion (POSE) solution, which simulates open-set samples that maintain the same semantics as closed-set samples but embedded with different imperceptible traces.
arXiv Detail & Related papers (2023-03-13T05:53:11Z) - Class-Specific Semantic Reconstruction for Open Set Recognition [101.24781422480406]
Open set recognition enables deep neural networks (DNNs) to identify samples of unknown classes.
We propose a novel method, called Class-Specific Semantic Reconstruction (CSSR), that integrates the power of auto-encoder (AE) and prototype learning.
Results of experiments conducted on multiple datasets show that the proposed method achieves outstanding performance in both close and open set recognition.
arXiv Detail & Related papers (2022-07-05T16:25:34Z) - Non-Exhaustive Learning Using Gaussian Mixture Generative Adversarial
Networks [3.040775019394542]
We propose a new online non-exhaustive learning model, namely, Non-Exhaustive Gaussian Mixture Generative Adversarial Networks (NE-GM-GAN)
Our proposed model synthesizes latent representation over a deep generative model, such as GAN, for incremental detection of instances of emerging classes in the test data.
arXiv Detail & Related papers (2021-06-28T00:20:22Z) - Learning Open Set Network with Discriminative Reciprocal Points [70.28322390023546]
Open set recognition aims to simultaneously classify samples from predefined classes and identify the rest as 'unknown'
In this paper, we propose a new concept, Reciprocal Point, which is the potential representation of the extra-class space corresponding to each known category.
Based on the bounded space constructed by reciprocal points, the risk of unknown is reduced through multi-category interaction.
arXiv Detail & Related papers (2020-10-31T03:20:31Z) - Open Set Recognition with Conditional Probabilistic Generative Models [51.40872765917125]
We propose Conditional Probabilistic Generative Models (CPGM) for open set recognition.
CPGM can detect unknown samples but also classify known classes by forcing different latent features to approximate conditional Gaussian distributions.
Experiment results on multiple benchmark datasets reveal that the proposed method significantly outperforms the baselines.
arXiv Detail & Related papers (2020-08-12T06:23:49Z) - Conditional Gaussian Distribution Learning for Open Set Recognition [10.90687687505665]
We propose Conditional Gaussian Distribution Learning (CGDL) for open set recognition.
In addition to detecting unknown samples, this method can also classify known samples by forcing different latent features to approximate different Gaussian models.
Experiments on several standard image reveal that the proposed method significantly outperforms the baseline method and achieves new state-of-the-art results.
arXiv Detail & Related papers (2020-03-19T14:32:08Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.