Semantic-Based Few-Shot Learning by Interactive Psychometric Testing
- URL: http://arxiv.org/abs/2112.09201v1
- Date: Thu, 16 Dec 2021 21:03:09 GMT
- Title: Semantic-Based Few-Shot Learning by Interactive Psychometric Testing
- Authors: Lu Yin, Vlado Menkovski, Yulong Pei, Mykola Pechenizkiy
- Abstract summary: Few-shot classification tasks aim to classify images in query sets based on only a few labeled examples in support sets.
In this work, we advanced the few-shot learning towards this more challenging scenario, the semantic-based few-shot learning.
We propose a method to address the paradigm by capturing the inner semantic relationships using interactive psychometric learning.
- Score: 14.939767383180786
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Few-shot classification tasks aim to classify images in query sets based on
only a few labeled examples in support sets. Most studies usually assume that
each image in a task has a single and unique class association. Under these
assumptions, these algorithms may not be able to identify the proper class
assignment when there is no exact matching between support and query classes.
For example, given a few images of lions, bikes, and apples to classify a
tiger. However, in a more general setting, we could consider the higher-level
concept of large carnivores to match the tiger to the lion for semantic
classification. Existing studies rarely considered this situation due to the
incompatibility of label-based supervision with complex conception
relationships. In this work, we advanced the few-shot learning towards this
more challenging scenario, the semantic-based few-shot learning, and proposed a
method to address the paradigm by capturing the inner semantic relationships
using interactive psychometric learning. We evaluate our method on the
CIFAR-100 dataset. The results show the merits of our proposed method.
Related papers
- HIRL: A General Framework for Hierarchical Image Representation Learning [54.12773508883117]
We propose a general framework for Hierarchical Image Representation Learning (HIRL)
This framework aims to learn multiple semantic representations for each image, and these representations are structured to encode image semantics from fine-grained to coarse-grained.
Based on a probabilistic factorization, HIRL learns the most fine-grained semantics by an off-the-shelf image SSL approach and learns multiple coarse-grained semantics by a novel semantic path discrimination scheme.
arXiv Detail & Related papers (2022-05-26T05:13:26Z) - Probabilistic Warp Consistency for Weakly-Supervised Semantic
Correspondences [118.6018141306409]
We propose Probabilistic Warp Consistency, a weakly-supervised learning objective for semantic matching.
We first construct an image triplet by applying a known warp to one of the images in a pair depicting different instances of the same object class.
Our objective also brings substantial improvements in the strongly-supervised regime, when combined with keypoint annotations.
arXiv Detail & Related papers (2022-03-08T18:55:11Z) - Semantic Clustering based Deduction Learning for Image Recognition and
Classification [19.757743366620613]
The paper proposes a semantic clustering based deduction learning by mimicking the learning and thinking process of human brains.
The proposed approach is supported theoretically and empirically through extensive experiments.
arXiv Detail & Related papers (2021-12-25T01:31:21Z) - APANet: Adaptive Prototypes Alignment Network for Few-Shot Semantic
Segmentation [56.387647750094466]
Few-shot semantic segmentation aims to segment novel-class objects in a given query image with only a few labeled support images.
Most advanced solutions exploit a metric learning framework that performs segmentation through matching each query feature to a learned class-specific prototype.
We present an adaptive prototype representation by introducing class-specific and class-agnostic prototypes.
arXiv Detail & Related papers (2021-11-24T04:38:37Z) - Train a One-Million-Way Instance Classifier for Unsupervised Visual
Representation Learning [45.510042484456854]
This paper presents a simple unsupervised visual representation learning method with a pretext task of discriminating all images in a dataset using a parametric, instance-level computation.
The overall framework is a replica of a supervised classification model, where semantic classes (e.g., dog, bird, and ship) are replaced by instance IDs.
scaling up the classification task from thousands of semantic labels to millions of instance labels brings specific challenges including 1) the large-scale softmax classifier; 2) the slow convergence due to the infrequent visiting of instance samples; and 3) the massive number of negative classes that can be noisy.
arXiv Detail & Related papers (2021-02-09T14:44:18Z) - SCAN: Learning to Classify Images without Labels [73.69513783788622]
We advocate a two-step approach where feature learning and clustering are decoupled.
A self-supervised task from representation learning is employed to obtain semantically meaningful features.
We obtain promising results on ImageNet, and outperform several semi-supervised learning methods in the low-data regime.
arXiv Detail & Related papers (2020-05-25T18:12:33Z) - Learning to Compare Relation: Semantic Alignment for Few-Shot Learning [48.463122399494175]
We present a novel semantic alignment model to compare relations, which is robust to content misalignment.
We conduct extensive experiments on several few-shot learning datasets.
arXiv Detail & Related papers (2020-02-29T08:37:02Z) - Rethinking Class Relations: Absolute-relative Supervised and
Unsupervised Few-shot Learning [157.62595449130973]
We study the fundamental problem of simplistic class modeling in current few-shot learning methods.
We propose a novel Absolute-relative Learning paradigm to fully take advantage of label information to refine the image representations.
arXiv Detail & Related papers (2020-01-12T12:25:46Z)
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.