Continual Learning on Graphs: A Survey

Zonggui Tian, Du Zhang, Hong-Ning Dai
2/9/2024
cs.LG

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Recently, continual graph learning has been increasingly adopted for diverse graph-structured data processing tasks in non-stationary environments. Despite its promising learning capability, current studies on continual graph learning mainly focus on mitigating the catastrophic forgetting problem while ignoring continuous performance improvement. To bridge this gap, this article aims to provide a comprehensive survey of recent efforts on continual graph learning. Specifically, we introduce a new taxonomy of continual graph learning from the perspective of overcoming catastrophic forgetting. Moreover, we systematically analyze the challenges of applying these continual graph learning methods in improving performance continuously and then discuss the possible solutions. Finally, we present open issues and future directions pertaining to the development of continual graph learning and discuss how they impact continuous performance improvement.

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. 2 weaker matches are hidden by default — 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{tian2024continual,
  title  = {Continual Learning on Graphs: A Survey},
  author = {Zonggui Tian and Du Zhang and Hong-Ning Dai},
  year   = {2024},
  eprint = {2402.06330},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.06330v1}
}

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

Discussion