Curriculum Learning for Graph Neural Networks: A Multiview Competence-based Approach
Nidhi Vakil, Hadi Amiri
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. 1
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 929606ba-e7d1-411f-83f4-5b4f2a5b18d4Cited by top-tier papers1
Ask how each one uses itBuilds on8
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- Curriculum Learning for Natural Language UnderstandingBenfeng Xu, Licheng Zhang, Zhendong Mao, Quan Wang et al.ACL 2020 · 156 citations
- When Do Curricula Work?Xiaoxia Wu, Ethan Dyer, Behnam NeyshaburICLR 2021 · 141 citations
- Curriculum Learning by Dynamic Instance HardnessTianyi Zhou, Shengjie Wang, Jeff A. BilmesNeurIPS 2020 · 113 citations
- SuperLoss: A Generic Loss for Robust Curriculum LearningThibault Castells, Philippe Weinzaepfel, Jérôme RevaudNeurIPS 2020 · 96 citations
Related papers
- Curriculum Learning for Graph Neural Networks: Which Edges Should We Learn FirstZheng Zhang, Junxiang Wang, Liang ZhaoNeurIPS 2023 · 30 citations
- CurGraph: Curriculum Learning for Graph ClassificationYiwei Wang, Wei Wang, Yuxuan Liang, Yujun Cai et al.WWW 2021 · 62 citations
- Self-supervised Masked Graph Autoencoder via Structure-aware CurriculumHaoyang Li, Xin Wang, Zeyang Zhang, Zongyuan Wu et al.ICML 2025
- Easy Begun Is Half Done: Spatial-Temporal Graph Modeling with ST-Curriculum DropoutHongjun Wang, Jiyuan Chen, Tong Pan, Zipei Fan et al.AAAI 2023 · 16 citations
- Uncertainty-Aware Curriculum Learning for Neural Machine TranslationYikai Zhou, Baosong Yang, Derek F. Wong, Yu Wan et al.ACL 2020 · 78 citations
