# TLRM: Task-level Relation Module for GNN-based Few-Shot Learning

Source: [TLRM: Task-level Relation Module for GNN-based Few-Shot Learning](<https://www.sota2.com/research/paper/68fa6aa51e209131cea296bb>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-28T13:56:49.464Z

Authors: Yurong Guo, Zhanyu Ma, Xiaoxu Li, Yuan Dong

Published: 2021-01-25T00:53:04.000Z

## Abstract

Recently, graph neural networks (GNNs) have shown powerful ability to handle few-shot classification problem, which aims at classifying unseen samples when trained with limited labeled samples per class. GNN-based few-shot learning architectures mostly replace traditional metric with a learnable GNN. In the GNN, the nodes are set as the samples embedding, and the relationship between two connected nodes can be obtained by a network, the input of which is the difference of their embedding features. We consider this method of measuring relation of samples only models the sample-to-sample relation, while neglects the specificity of different tasks. That is, this method of measuring relation does not take the task-level information into account. To this end, we propose a new relation measure method, namely the task-level relation module (TLRM), to explicitly model the task-level relation of one sample to all the others. The proposed module captures the relation representations between nodes by considering the sample-to-task instead of sample-to-sample embedding features. We conducted extensive experiments on four benchmark datasets: mini-ImageNet, tiered-ImageNet, CUB-$200$-$2011$, and CIFAR-FS. Experimental results demonstrate that the proposed module is effective for GNN-based few-shot learning.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2101.09840>)

[PDF](<https://arxiv.org/pdf/2101.09840.pdf>)
