Bayesian Embeddings for Few-Shot Open World Recognition
- URL: http://arxiv.org/abs/2107.13682v1
- Date: Thu, 29 Jul 2021 00:38:47 GMT
- Title: Bayesian Embeddings for Few-Shot Open World Recognition
- Authors: John Willes, James Harrison, Ali Harakeh, Chelsea Finn, Marco Pavone,
Steven Waslander
- Abstract summary: We extend embedding-based few-shot learning algorithms to the open-world recognition setting.
We benchmark our framework on open-world extensions of the common MiniImageNet and TieredImageNet few-shot learning datasets.
- Score: 60.39866770427436
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: As autonomous decision-making agents move from narrow operating environments
to unstructured worlds, learning systems must move from a closed-world
formulation to an open-world and few-shot setting in which agents continuously
learn new classes from small amounts of information. This stands in stark
contrast to modern machine learning systems that are typically designed with a
known set of classes and a large number of examples for each class. In this
work we extend embedding-based few-shot learning algorithms to the open-world
recognition setting. We combine Bayesian non-parametric class priors with an
embedding-based pre-training scheme to yield a highly flexible framework which
we refer to as few-shot learning for open world recognition (FLOWR). We
benchmark our framework on open-world extensions of the common MiniImageNet and
TieredImageNet few-shot learning datasets. Our results show, compared to prior
methods, strong classification accuracy performance and up to a 12% improvement
in H-measure (a measure of novel class detection) from our non-parametric
open-world few-shot learning scheme.
Related papers
- Deep Active Learning in the Open World [13.2318584850986]
Machine learning models deployed in open-world scenarios often encounter unfamiliar conditions and perform poorly in unanticipated situations.
We introduce ALOE, a novel active learning algorithm for open-world environments designed to enhance model adaptation by incorporating new OOD classes.
Our findings reveal a crucial tradeoff between enhancing known-class performance and discovering new classes, setting the stage for future advancements in open-world machine learning.
arXiv Detail & Related papers (2024-11-10T04:04:20Z) - Detecting and Learning Out-of-Distribution Data in the Open world:
Algorithm and Theory [15.875140867859209]
This thesis makes contributions to the realm of machine learning, specifically in the context of open-world scenarios.
Research investigates two intertwined steps essential for open-world machine learning: Out-of-distribution (OOD) Detection and Open-world Representation Learning (ORL)
arXiv Detail & Related papers (2023-10-10T00:25:21Z) - Open-Set Automatic Target Recognition [52.27048031302509]
Automatic Target Recognition (ATR) is a category of computer vision algorithms which attempts to recognize targets on data obtained from different sensors.
Existing ATR algorithms are developed for traditional closed-set methods where training and testing have the same class distribution.
We propose an Open-set Automatic Target Recognition framework where we enable open-set recognition capability for ATR algorithms.
arXiv Detail & Related papers (2022-11-10T21:28:24Z) - Open Long-Tailed Recognition in a Dynamic World [82.91025831618545]
Real world data often exhibits a long-tailed and open-ended (with unseen classes) distribution.
A practical recognition system must balance between majority (head) and minority (tail) classes, generalize across the distribution, and acknowledge novelty upon the instances of unseen classes (open classes)
We define Open Long-Tailed Recognition++ as learning from such naturally distributed data and optimizing for the classification accuracy over a balanced test set.
arXiv Detail & Related papers (2022-08-17T15:22:20Z) - Open-World Semi-Supervised Learning [66.90703597468377]
We introduce a new open-world semi-supervised learning setting in which the model is required to recognize previously seen classes.
We propose ORCA, an approach that learns to simultaneously classify and cluster the data.
We demonstrate that ORCA accurately discovers novel classes and assigns samples to previously seen classes on benchmark image classification datasets.
arXiv Detail & Related papers (2021-02-06T07:11:07Z) - CLASTER: Clustering with Reinforcement Learning for Zero-Shot Action
Recognition [52.66360172784038]
We propose a clustering-based model, which considers all training samples at once, instead of optimizing for each instance individually.
We call the proposed method CLASTER and observe that it consistently improves over the state-of-the-art in all standard datasets.
arXiv Detail & Related papers (2021-01-18T12:46:24Z) - Task-Adaptive Negative Class Envision for Few-Shot Open-Set Recognition [36.53830822788852]
We study the problem of few-shot open-set recognition (FSOR), which learns a recognition system robust to queries from new sources.
We propose a novel task-adaptive negative class envision method (TANE) to model the open world.
Our approach significantly improves the state-of-the-art performance on few-shot open-set recognition.
arXiv Detail & Related papers (2020-12-24T02:30:18Z) - 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) - Boosting Deep Open World Recognition by Clustering [37.5993398894786]
We show how we can boost the performance of deep open world recognition algorithms by means of a new loss formulation.
We propose a strategy to learn class-specific rejection thresholds, instead of estimating a single global threshold.
Experiments on RGB-D Object and Core50 show the effectiveness of our approach.
arXiv Detail & Related papers (2020-04-20T12:07:39Z)
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.