MetaMax: Improved Open-Set Deep Neural Networks via Weibull Calibration
- URL: http://arxiv.org/abs/2211.10872v1
- Date: Sun, 20 Nov 2022 05:10:33 GMT
- Title: MetaMax: Improved Open-Set Deep Neural Networks via Weibull Calibration
- Authors: Zongyao Lyu, Nolan B. Gutierrez, William J. Beksi
- Abstract summary: Open-set recognition refers to the problem in which classes that were not seen during training appear at inference time.
OpenMax was the first deep neural network-based approach to address open-set recognition.
We present MetaMax, a more effective post-processing technique that improves upon contemporary methods by directly modeling class activation vectors.
- Score: 5.8022510096020525
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Open-set recognition refers to the problem in which classes that were not
seen during training appear at inference time. This requires the ability to
identify instances of novel classes while maintaining discriminative capability
for closed-set classification. OpenMax was the first deep neural network-based
approach to address open-set recognition by calibrating the predictive scores
of a standard closed-set classification network. In this paper we present
MetaMax, a more effective post-processing technique that improves upon
contemporary methods by directly modeling class activation vectors. MetaMax
removes the need for computing class mean activation vectors (MAVs) and
distances between a query image and a class MAV as required in OpenMax.
Experimental results show that MetaMax outperforms OpenMax and is comparable in
performance to other state-of-the-art approaches.
Related papers
- VAEMax: Open-Set Intrusion Detection based on OpenMax and Variational Autoencoder [5.733432394442812]
We employ OpenMax and variational autoencoder to propose a dual detection model, VAEMax.
First, we extract flow payload feature based on one-dimensional convolutional neural network.
Then, the OpenMax is used to classify flows, during which some unknown attacks can be detected, while the rest are misclassified into a certain class of known flows.
arXiv Detail & Related papers (2024-03-07T03:48:47Z) - Multi-class Support Vector Machine with Maximizing Minimum Margin [67.51047882637688]
Support Vector Machine (SVM) is a prominent machine learning technique widely applied in pattern recognition tasks.
We propose a novel method for multi-class SVM that incorporates pairwise class loss considerations and maximizes the minimum margin.
Empirical evaluations demonstrate the effectiveness and superiority of our proposed method over existing multi-classification methods.
arXiv Detail & Related papers (2023-12-11T18:09:55Z) - Revisiting Logistic-softmax Likelihood in Bayesian Meta-Learning for Few-Shot Classification [4.813254903898101]
logistic-softmax is often employed as an alternative to the softmax likelihood in multi-class Gaussian process classification.
We revisit and redesign the logistic-softmax likelihood, which enables control of the textita priori confidence level through a temperature parameter.
Our approach yields well-calibrated uncertainty estimates and achieves comparable or superior results on standard benchmark datasets.
arXiv Detail & Related papers (2023-10-16T13:20:13Z) - Activate and Reject: Towards Safe Domain Generalization under Category
Shift [71.95548187205736]
We study a practical problem of Domain Generalization under Category Shift (DGCS)
It aims to simultaneously detect unknown-class samples and classify known-class samples in the target domains.
Compared to prior DG works, we face two new challenges: 1) how to learn the concept of unknown'' during training with only source known-class samples, and 2) how to adapt the source-trained model to unseen environments.
arXiv Detail & Related papers (2023-10-07T07:53:12Z) - An Explainable Model-Agnostic Algorithm for CNN-based Biometrics
Verification [55.28171619580959]
This paper describes an adaptation of the Local Interpretable Model-Agnostic Explanations (LIME) AI method to operate under a biometric verification setting.
arXiv Detail & Related papers (2023-07-25T11:51:14Z) - Maximally Compact and Separated Features with Regular Polytope Networks [22.376196701232388]
We show how to extract from CNNs features the properties of emphmaximum inter-class separability and emphmaximum intra-class compactness.
We obtain features similar to what can be obtained with the well-known citewen2016discriminative and other similar approaches.
arXiv Detail & Related papers (2023-01-15T15:20:57Z) - Distinction Maximization Loss: Efficiently Improving Classification
Accuracy, Uncertainty Estimation, and Out-of-Distribution Detection Simply
Replacing the Loss and Calibrating [2.262407399039118]
We propose training deterministic deep neural networks using our DisMax loss.
DisMax usually outperforms all current approaches simultaneously in classification accuracy, uncertainty estimation, inference efficiency, and out-of-distribution detection.
arXiv Detail & Related papers (2022-05-12T04:37:35Z) - SphereFace2: Binary Classification is All You Need for Deep Face
Recognition [57.07058009281208]
State-of-the-art deep face recognition methods are mostly trained with a softmax-based multi-class classification framework.
We propose a novel binary classification training framework, termed SphereFace2.
We show that SphereFace2 can consistently outperform current state-of-the-art deep face recognition methods.
arXiv Detail & Related papers (2021-08-03T13:58:45Z) - Non-convex Min-Max Optimization: Applications, Challenges, and Recent
Theoretical Advances [58.54078318403909]
The min-max problem, also known as the saddle point problem, is a class adversarial problem which is also studied in the context ofsum games.
arXiv Detail & Related papers (2020-06-15T05:33:42Z) - Few-Shot Open-Set Recognition using Meta-Learning [72.15940446408824]
The problem of open-set recognition is considered.
A new oPen sEt mEta LEaRning (PEELER) algorithm is introduced.
arXiv Detail & Related papers (2020-05-27T23:49:26Z)
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.