Adaptive Poincar\'e Point to Set Distance for Few-Shot Classification
- URL: http://arxiv.org/abs/2112.01719v1
- Date: Fri, 3 Dec 2021 05:08:11 GMT
- Title: Adaptive Poincar\'e Point to Set Distance for Few-Shot Classification
- Authors: Rongkai Ma, Pengfei Fang, Tom Drummond, Mehrtash Harandi
- Abstract summary: We learn a context-aware hyperbolic metric to characterize the distance between a point and a set associated with a learned set to set distance.
We empirically show that such metric yields in the presence of outliers and achieves a tangible improvement over baseline models.
- Score: 30.84627437310717
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Learning and generalizing from limited examples, i,e, few-shot learning, is
of core importance to many real-world vision applications. A principal way of
achieving few-shot learning is to realize an embedding where samples from
different classes are distinctive. Recent studies suggest that embedding via
hyperbolic geometry enjoys low distortion for hierarchical and structured data,
making it suitable for few-shot learning. In this paper, we propose to learn a
context-aware hyperbolic metric to characterize the distance between a point
and a set associated with a learned set to set distance. To this end, we
formulate the metric as a weighted sum on the tangent bundle of the hyperbolic
space and develop a mechanism to obtain the weights adaptively and based on the
constellation of the points. This not only makes the metric local but also
dependent on the task in hand, meaning that the metric will adapt depending on
the samples that it compares. We empirically show that such metric yields
robustness in the presence of outliers and achieves a tangible improvement over
baseline models. This includes the state-of-the-art results on five popular
few-shot classification benchmarks, namely mini-ImageNet, tiered-ImageNet,
Caltech-UCSD Birds-200-2011 (CUB), CIFAR-FS, and FC100.
Related papers
- Geometry-aware Distance Measure for Diverse Hierarchical Structures in Hyperbolic Spaces [48.948334221681684]
We propose a geometry-aware distance measure in hyperbolic spaces, which dynamically adapts to varying hierarchical structures.<n>Our approach consistently outperforms learning methods that use fixed distance measures.<n>Visualization shows clearer class boundaries and improved prototype separation in hyperbolic spaces.
arXiv Detail & Related papers (2025-06-23T11:43:39Z) - Piecewise-Linear Manifolds for Deep Metric Learning [8.670873561640903]
Unsupervised deep metric learning focuses on learning a semantic representation space using only unlabeled data.
We propose to model the high-dimensional data manifold using a piecewise-linear approximation, with each low-dimensional linear piece approximating the data manifold in a small neighborhood of a point.
We empirically show that this similarity estimate correlates better with the ground truth than the similarity estimates of current state-of-the-art techniques.
arXiv Detail & Related papers (2024-03-22T06:22:20Z) - Intra-class Adaptive Augmentation with Neighbor Correction for Deep
Metric Learning [99.14132861655223]
We propose a novel intra-class adaptive augmentation (IAA) framework for deep metric learning.
We reasonably estimate intra-class variations for every class and generate adaptive synthetic samples to support hard samples mining.
Our method significantly improves and outperforms the state-of-the-art methods on retrieval performances by 3%-6%.
arXiv Detail & Related papers (2022-11-29T14:52:38Z) - Few-shot Metric Learning: Online Adaptation of Embedding for Retrieval [37.601607544184915]
Metric learning aims to build a distance metric typically by learning an effective embedding function that maps similar objects into nearby points.
Despite recent advances in deep metric learning, it remains challenging for the learned metric to generalize to unseen classes with a substantial domain gap.
We propose a new problem of few-shot metric learning that aims to adapt the embedding function to the target domain with only a few annotated data.
arXiv Detail & Related papers (2022-11-14T05:10:17Z) - Compare learning: bi-attention network for few-shot learning [6.559037166322981]
One of the Few-shot learning methods called metric learning addresses this challenge by first learning a deep distance metric to determine whether a pair of images belong to the same category.
In this paper, we propose a novel approach named Bi-attention network to compare the instances, which can measure the similarity between embeddings of instances precisely, globally and efficiently.
arXiv Detail & Related papers (2022-03-25T07:39:10Z) - Hyperbolic Vision Transformers: Combining Improvements in Metric
Learning [116.13290702262248]
We propose a new hyperbolic-based model for metric learning.
At the core of our method is a vision transformer with output embeddings mapped to hyperbolic space.
We evaluate the proposed model with six different formulations on four datasets.
arXiv Detail & Related papers (2022-03-21T09:48:23Z) - Deep Relational Metric Learning [84.95793654872399]
This paper presents a deep relational metric learning framework for image clustering and retrieval.
We learn an ensemble of features that characterizes an image from different aspects to model both interclass and intraclass distributions.
Experiments on the widely-used CUB-200-2011, Cars196, and Stanford Online Products datasets demonstrate that our framework improves existing deep metric learning methods and achieves very competitive results.
arXiv Detail & Related papers (2021-08-23T09:31:18Z) - Few-shot Image Classification with Multi-Facet Prototypes [48.583388368897126]
We organize visual features into facets, which intuitively group features of the same kind.
It is possible to predict facet importance from a pre-trained embedding of the category names.
In particular, we propose an adaptive similarity measure, relying on predicted facet importance weights for a given set of categories.
arXiv Detail & Related papers (2021-02-01T12:43:03Z) - Meta-Generating Deep Attentive Metric for Few-shot Classification [53.07108067253006]
We present a novel deep metric meta-generation method to generate a specific metric for a new few-shot learning task.
In this study, we structure the metric using a three-layer deep attentive network that is flexible enough to produce a discriminative metric for each task.
We gain surprisingly obvious performance improvement over state-of-the-art competitors, especially in the challenging cases.
arXiv Detail & Related papers (2020-12-03T02:07:43Z) - Improving Few-shot Learning by Spatially-aware Matching and
CrossTransformer [116.46533207849619]
We study the impact of scale and location mismatch in the few-shot learning scenario.
We propose a novel Spatially-aware Matching scheme to effectively perform matching across multiple scales and locations.
arXiv Detail & Related papers (2020-01-06T14:10:20Z)
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.