Disentangle-based Continual Graph Representation Learning
Graph embedding (GE) methods embed nodes (and/or edges) in graph into a low-dimensional semantic space, and have shown its effectiveness in modeling multi-relational data. However, existing GE models are not practical in real-world applications since it overlooked the streaming nature of incoming data. To address this issue, we study the problem of continual graph representation learning which aims to continually train a GE model on new data to learn incessantly emerging multi-relational data while avoiding catastrophically forgetting old learned knowledge. Moreover, we propose a disentangle-based continual graph representation learning (DiCGRL) framework inspired by the human's ability to learn procedural knowledge. The experimental results show that DiCGRL could effectively alleviate the catastrophic forgetting problem and outperform state-of-the-art continual learning models.
Code (1)
Tasks
Continual LearningGraph EmbeddingGraph Representation LearningRepresentation LearningSimilar Papers 제목 키워드 기반
Disentanglement of Color and Shape Representations for Continual Learning
We hypothesize that disentangled feature representations suffer less from catastrophic forgetting. As a case study we perform explicit disentanglement of color and shape, by adjusting the network architecture. We tested …
Continual LearningDisentanglementContinual Learning for Text Classification with Information Disentanglement Based Regularization
Continual learning has become increasingly important as it enables NLP models to constantly learn and gain knowledge over time. Previous continual learning methods are mainly designed to preserve knowledge from previous …
Continual LearningDisentanglementGeneral ClassificationSentence+2Active perception and disentangled representations allow continual, episodic zero and few-shot learning
Generalization is often regarded as an essential property of machine learning systems. However, perhaps not every component of a system needs to generalize. Training models for generalization typically produces entangled…
Continual LearningFew-Shot LearningGraphSAD: Learning Graph Representations with Structure-Attribute Disentanglement
Graph Neural Networks (GNNs) learn effective node/graph representations by aggregating the attributes of neighboring nodes, which commonly derives a single representation mixing the information of graph structure and nod…
AttributeDisentanglementGraph ClassificationLearning Network Representations with Disentangled Graph Auto-Encoder
The (variational) graph auto-encoder is widely used to learn representations for graph-structured data. However, the formation of real-world graphs is a complicated and heterogeneous process influenced by latent factors.…
DecoderLearning Network Representations