Rankdnn: Learning To Rank For Few-shot Learning

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 neare

Stats

• citations23
• S2 citations—
• github stars12
• HF likes0
• heat score12.58
• arxiv keyguo2022rankdnn

Related papers

• Advancing Image Retrieval With Few-shot Learning And Relevance Feedback (2023)0.00
• Few-shot Prompting For Pairwise Ranking: An Effective Non-parametric Retrieval Model (2024)5.84
• Deep Triplet Ranking Networks For One-shot Recognition (2018)0.00
• Few-shot Learning Through An Information Retrieval Lens (2017)0.00
• Relationnet2: Deep Comparison Columns For Few-shot Learning (2018)0.00
• Revisiting Metric Learning For Few-shot Image Classification (2019)14.90
• An Attention-based Deep Net For Learning To Rank (2017)0.00
• Simpleshot: Revisiting Nearest-neighbor Classification For Few-shot Learning (2019)0.00