Topology-aware Embedding Memory for Continual Learning on Expanding Networks
Xikun Zhang, Dongjin Song, Yixin Chen, Dacheng Tao

TL;DR
This paper introduces a novel framework, PDGNNs with Topology-aware Embedding Memory, to address memory explosion in continual learning on expanding networks, effectively utilizing topological info and reducing memory costs.
Contribution
It proposes a parameter decoupling framework with topology-aware embeddings that compress ego-subnetworks, reducing memory complexity and improving continual learning performance.
Findings
Reduces memory complexity from O(nd^L) to O(n)
Achieves significant performance improvements in class-incremental learning
Develops a coverage maximization sampling strategy for better memory utilization
Abstract
Memory replay based techniques have shown great success for continual learning with incrementally accumulated Euclidean data. Directly applying them to continually expanding networks, however, leads to the potential memory explosion problem due to the need to buffer representative nodes and their associated topological neighborhood structures. To this end, we systematically analyze the key challenges in the memory explosion problem, and present a general framework, \textit{i.e.}, Parameter Decoupled Graph Neural Networks (PDGNNs) with Topology-aware Embedding Memory (TEM), to tackle this issue. The proposed framework not only reduces the memory space complexity from to ~\footnote{: memory budget, : average node degree, : the radius of the GNN receptive field}, but also fully utilizes the topological information for memory replay.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Recommender Systems and Techniques · Advanced Computing and Algorithms
