Curriculum Learning for Graph Neural Networks: A Multiview Competence-based Approach

Nidhi Vakil, Hadi Amiri
7/17/2023
cs.LGcs.AIcs.CL

No confident code implementation found for this paper.

Abstract

A curriculum is a planned sequence of learning materials and an effective one can make learning efficient and effective for both humans and machines. Recent studies developed effective data-driven curriculum learning approaches for training graph neural networks in language applications. However, existing curriculum learning approaches often employ a single criterion of difficulty in their training paradigms. In this paper, we propose a new perspective on curriculum learning by introducing a novel approach that builds on graph complexity formalisms (as difficulty criteria) and model competence during training. The model consists of a scheduling scheme which derives effective curricula by accounting for different views of sample difficulty and model competence during training. The proposed solution advances existing research in curriculum learning for graph neural networks with the ability to incorporate a fine-grained spectrum of graph difficulty criteria in their training paradigms. Experimental results on real-world link prediction and node classification tasks illustrate the effectiveness of the proposed approach.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{vakil2023curriculum,
  title  = {Curriculum Learning for Graph Neural Networks: A Multiview Competence-based Approach},
  author = {Nidhi Vakil and Hadi Amiri},
  year   = {2023},
  eprint = {2307.08859},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.08859v1}
}

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/2307.08859.svg)](https://codeofpaper.com/paper/2307.08859)

Discussion