RankDNN: Learning to Rank for Few-shot Learning
Qianyu Guo, Hongtong Gong, Xujun Wei, Yanwei Fu, Weifeng Ge, Yizhou, Yu, Wenqiang Zhang

TL;DR
RankDNN introduces a ranking-based approach for few-shot learning that improves performance and transferability by using a neural network to classify relevance relations, offering a novel perspective and compatibility with existing methods.
Contribution
The paper proposes RankDNN, a ranking-based few-shot learning framework that is sample efficient, domain agnostic, and can be integrated with various feature extractors.
Findings
Outperforms state-of-the-art on multiple benchmarks
Effective across diverse backbone architectures
Demonstrates strong cross-domain transferability
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Multimodal Machine Learning Applications · Advanced Image and Video Retrieval Techniques
