Edge-labeling Graph Neural Network for Few-shot Learning

Jongmin Kim, Taesup Kim, Sungwoong Kim, Chang D. Yoo
5/4/2019
cs.LGcs.CV

Official code: jmkim0309/fewshot-egnn (274 stars, MIT, last commit 2019-06-24).

Abstract

In this paper, we propose a novel edge-labeling graph neural network (EGNN), which adapts a deep neural network on the edge-labeling graph, for few-shot learning. The previous graph neural network (GNN) approaches in few-shot learning have been based on the node-labeling framework, which implicitly models the intra-cluster similarity and the inter-cluster dissimilarity. In contrast, the proposed EGNN learns to predict the edge-labels rather than the node-labels on the graph that enables the evolution of an explicit clustering by iteratively updating the edge-labels with direct exploitation of both intra-cluster similarity and the inter-cluster dissimilarity. It is also well suited for performing on various numbers of classes without retraining, and can be easily extended to perform a transductive inference. The parameters of the EGNN are learned by episodic training with an edge-labeling loss to obtain a well-generalizable model for unseen low-data problem. On both of the supervised and semi-supervised few-shot image classification tasks with two benchmark datasets, the proposed EGNN significantly improves the performances over the existing GNNs.

View on arXivView PDF

Code Implementations(1)

MIT
27461PythonApr 5, 20197 years agoMIT

Similar Papers

Cite this paper

@article{kim2019edgelabeling,
  title  = {Edge-labeling Graph Neural Network for Few-shot Learning},
  author = {Jongmin Kim and Taesup Kim and Sungwoong Kim and Chang D. Yoo},
  year   = {2019},
  eprint = {1905.01436},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1905.01436}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1905.01436.svg)](https://codeofpaper.com/paper/1905.01436)

Discussion