RankDNN: Learning to Rank for Few-shot Learning

• URL: http://arxiv.org/abs/2211.15320v2
• Date: Tue, 29 Nov 2022 10:36:37 GMT
• Title: RankDNN: Learning to Rank for Few-shot Learning
• Authors: Qianyu Guo, Hongtong Gong, Xujun Wei, Yanwei Fu, Weifeng Ge, Yizhou Yu, Wenqiang Zhang
• Abstract summary: This paper introduces a new few-shot learning pipeline that casts relevance ranking for image retrieval as binary ranking relation classification. It provides a new perspective on few-shot learning and is complementary to state-of-the-art methods.
• Score: 70.49494297554537
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper introduces a new few-shot learning pipeline that casts relevance ranking for image retrieval as binary ranking relation classification. In comparison to image classification, ranking relation classification is sample efficient and domain agnostic. Besides, it provides a new perspective on few-shot learning and is complementary to state-of-the-art methods. The core component of our deep neural network is a simple MLP, which takes as input an image triplet encoded as the difference between two vector-Kronecker products, and outputs a binary relevance ranking order. The proposed RankMLP can be built on top of any state-of-the-art feature extractors, and our entire deep neural network is called the ranking deep neural network, or RankDNN. Meanwhile, RankDNN can be flexibly fused with other post-processing methods. During the meta test, RankDNN ranks support images according to their similarity with the query samples, and each query sample is assigned the class label of its nearest neighbor. Experiments demonstrate that RankDNN can effectively improve the performance of its baselines based on a variety of backbones and it outperforms previous state-of-the-art algorithms on multiple few-shot learning benchmarks, including miniImageNet, tieredImageNet, Caltech-UCSD Birds, and CIFAR-FS. Furthermore, experiments on the cross-domain challenge demonstrate the superior transferability of RankDNN.The code is available at: https://github.com/guoqianyu-alberta/RankDNN.

Related papers

• GNNRank: Learning Global Rankings from Pairwise Comparisons via Directed Graph Neural Networks [68.61934077627085]
  We introduce GNNRank, a modeling framework compatible with any GNN capable of learning digraph embeddings. We show that our methods attain competitive and often superior performance compared with existing approaches.
  arXiv  Detail & Related papers  (2022-02-01T04:19:50Z)
• Rethinking Nearest Neighbors for Visual Classification [56.00783095670361]
  k-NN is a lazy learning method that aggregates the distance between the test image and top-k neighbors in a training set. We adopt k-NN with pre-trained visual representations produced by either supervised or self-supervised methods in two steps. Via extensive experiments on a wide range of classification tasks, our study reveals the generality and flexibility of k-NN integration.
  arXiv  Detail & Related papers  (2021-12-15T20:15:01Z)
• Learning Hierarchical Graph Neural Networks for Image Clustering [81.5841862489509]
  We propose a hierarchical graph neural network (GNN) model that learns how to cluster a set of images into an unknown number of identities. Our hierarchical GNN uses a novel approach to merge connected components predicted at each level of the hierarchy to form a new graph at the next level.
  arXiv  Detail & Related papers  (2021-07-03T01:28:42Z)
• Overhead-MNIST: Machine Learning Baselines for Image Classification [0.0]
  Twenty-three machine learning algorithms were trained then scored to establish baseline comparison metrics. The Overhead-MNIST dataset is a collection of satellite images similar in style to the ubiquitous MNIST hand-written digits. We present results for the overall best performing algorithm as a baseline for edge deployability and future performance improvement.
  arXiv  Detail & Related papers  (2021-07-01T13:30:39Z)
• SAR Image Classification Based on Spiking Neural Network through Spike-Time Dependent Plasticity and Gradient Descent [7.106664778883502]
  Spiking neural network (SNN) is one of the core components of brain-like intelligence. This article constructs a complete SAR image based on unsupervised and supervised learning SNN.
  arXiv  Detail & Related papers  (2021-06-15T09:36:04Z)
• Reinforcement Learning Based Handwritten Digit Recognition with Two-State Q-Learning [1.8782750537161614]
  We present a Hybrid approach based on Deep Learning and Reinforcement Learning. Q-Learning is used with two Q-states and four actions. Our approach outperforms other contemporary techniques like AlexNet, CNN-Nearest Neighbor and CNNSupport Vector Machine.
  arXiv  Detail & Related papers  (2020-06-28T14:23:36Z)
• Patch Based Classification of Remote Sensing Data: A Comparison of 2D-CNN, SVM and NN Classifiers [0.0]
  We compare performance of patch based SVM and NN with that of a deep learning algorithms comprising of 2D-CNN and fully connected layers. Results with both datasets suggest the effectiveness of patch based SVM and NN.
  arXiv  Detail & Related papers  (2020-06-21T11:07:37Z)
• Sequential Graph Convolutional Network for Active Learning [53.99104862192055]
  We propose a novel pool-based Active Learning framework constructed on a sequential Graph Convolution Network (GCN) With a small number of randomly sampled images as seed labelled examples, we learn the parameters of the graph to distinguish labelled vs unlabelled nodes. We exploit these characteristics of GCN to select the unlabelled examples which are sufficiently different from labelled ones.
  arXiv  Detail & Related papers  (2020-06-18T00:55:10Z)
• Learning to Hash with Graph Neural Networks for Recommender Systems [103.82479899868191]
  Graph representation learning has attracted much attention in supporting high quality candidate search at scale. Despite its effectiveness in learning embedding vectors for objects in the user-item interaction network, the computational costs to infer users' preferences in continuous embedding space are tremendous. We propose a simple yet effective discrete representation learning framework to jointly learn continuous and discrete codes.
  arXiv  Detail & Related papers  (2020-03-04T06:59:56Z)

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.