This paper addresses the challenge of incremental learning in growing graphs
with increasingly complex tasks. The goal is to continually train a graph model
to handle new tasks while retaining its inference ability on previous tasks.
Existing methods usually neglect the importance of memory diversity, limiting
in effectively selecting high-quality memory from previous tasks and
remembering broad previous knowledge within the scarce memory on graphs. To
address that, we introduce a novel holistic Diversified Memory Selection and
Generation (DMSG) framework for incremental learning in graphs, which first
introduces a buffer selection strategy that considers both intra-class and
inter-class diversities, employing an efficient greedy algorithm for sampling
representative training nodes from graphs into memory buffers after learning
each new task. Then, to adequately rememorize the knowledge preserved in the
memory buffer when learning new tasks, we propose a diversified memory
generation replay method. This method first utilizes a variational layer to
generate the distribution of buffer node embeddings and sample synthesized ones
for replaying. Furthermore, an adversarial variational embedding learning
method and a reconstruction-based decoder are proposed to maintain the
integrity and consolidate the generalization of the synthesized node
embeddings, respectively. Finally, we evaluate our model on node classification
tasks involving increasing class numbers. Extensive experimental results on
publicly accessible datasets demonstrate the superiority of DMSG over
state-of-the-art methods.

本研究论文提出了一种应对日益复杂任务下增量学习的挑战的方法。通过引入全新的多样化内存选择和生成（DMSG）框架，该框架在图形学习中利用了缓冲选择和内存生成回放的策略来保证知识的一致性和概括性，进而有效地存储和利用长期记忆。实验证明了 DMSG 方法在节点分类任务中的出色性能。

增长图中的渐进学习的整体记忆多样化

Holistic Memory Diversification for Incremental Learning in Growing  Graphs

Modeling generative process of growing graphs has wide applications in social
networks and recommendation systems, where cold start problem leads to new
nodes isolated from existing graph. Despite the emerging literature in learning
graph representation and graph generation, most of them can not handle isolated
new nodes without nontrivial modifications. The challenge arises due to the
fact that learning to generate representations for nodes in observed graph
relies heavily on topological features, whereas for new nodes only node
attributes are available. Here we propose a unified generative graph
convolutional network that learns node representations for all nodes adaptively
in a generative model framework, by sampling graph generation sequences
constructed from observed graph data. We optimize over a variational lower
bound that consists of a graph reconstruction term and an adaptive
Kullback-Leibler divergence regularization term. We demonstrate the superior
performance of our approach on several benchmark citation network datasets.

本研究提出了一种统一的生成图卷积网络，通过从现有图数据构建生成图序列的采样，在生成模型框架中自适应地学习所有节点的节点表示，同时使用图重构项和自适应 KL 正则化项对变分下限进行优化，解决了无法处理孤立新节点的问题。