Improving Continual Relation Extraction by Distinguishing Analogous Semantics (2023.acl-long)
Copied to clipboard
| Challenge: | Existing works store a small number of typical samples to re-train the model for alleviating forgetting. |
| Approach: | They propose a continual relation extraction model that uses memory-insensitive relation prototypes and memory augmentation to overcome the overfitting problem. |
| Outcome: | The proposed model outperforms existing models on analogous relations and overcomes overfitting problem. |
Similar Papers
Consistent Representation Learning for Continual Relation Extraction (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to train relation extraction models overfit memory samples and perform poorly on imbalanced datasets. |
| Approach: | They propose a method which uses contrastive learning and knowledge distillation to train a model on data with new relations while avoiding forgetting old ones. |
| Outcome: | The proposed method significantly outperforms state-of-the-art baselines and yields strong robustness on the imbalanced datasets. |
Rationale-Enhanced Language Models are Better Continual Relation Learners (2023.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies have found that catastrophic forgetting arises from the model’s lack of robustness against future analogous relations. |
| Approach: | They propose a multi-task rationale tuning strategy to help the model learn current relations robustly and conduct contrastive rationale replay to further distinguish analogous relations. |
| Outcome: | The proposed method outperforms the state-of-the-art models on two benchmarks. |
Improving Continual Relation Extraction through Prototypical Contrastive Learning (2022.coling-1)
Copied to clipboard
| Challenge: | Continual relation extraction (CRE) aims to extract relations towards the continuous and iterative arrival of new data, of which the major challenge is the catastrophic forgetting of old tasks. |
| Approach: | They propose a Continual Relation Extraction framework with Contrastive Learning which is built with a classification network and a prototypical contrastive network to achieve incremental-class learning of CRE. |
| Outcome: | The proposed framework outperforms the state-of-the-art methods on two public datasets and proves its effectiveness on improving performance. |
Refining Sample Embeddings with Relation Prototypes to Enhance Continual Relation Extraction (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods to extract relationships from texts depend on memory size and replay these memorized samples in subsequent tasks. |
| Approach: | They propose to use a model to extract relations between entities from texts where the samples of different relations are delivered into the model continuously. |
| Outcome: | The proposed model outperforms the state-of-the-art models and avoids catastrophic forgetting. |
Learning Robust Representations for Continual Relation Extraction via Adversarial Class Augmentation (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies attribute catastrophic forgetting to the corruption of the learned representations as new relations come . Continual relation extraction models suffer from catastrophic forgetting when learning new relations . |
| Approach: | They propose to use adversarial class augmentation mechanism to learn more precise representations . they propose to train the model on a sequence of tasks where two new relations are discovered . |
| Outcome: | The proposed model improves on two popular benchmarks. |
Continual Relation Learning via Episodic Memory Activation and Reconsolidation (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods to learn incessantly emerging novel relations are overfitting the few memorized examples of old relations, causing confusion among existing relations. |
| Approach: | They introduce episodic memory activation and reconsolidation (EMAR) to continual relation learning. |
| Outcome: | The proposed method outperforms state-of-the-art models in catastrophic forgetting old relations. |
DP-CRE: Continual Relation Extraction via Decoupled Contrastive Learning and Memory Structure Preservation (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for learning relational knowledge are replay-based and prioritize data uniformly . a pronounced bias towards new tasks can be caused by the introduction of new tasks . |
| Approach: | They propose a framework that decouples the process of prior information preservation and new knowledge acquisition. |
| Outcome: | Extensive experiments show that the framework outperforms baselines across two datasets. |
Enhancing Continual Relation Extraction via Classifier Decomposition (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing studies only adopt a vanilla strategy when learning representations of new relations . experimental results show that the importance of the first training stage to CRE models may be underestimated. |
| Approach: | They propose a framework that splits the last FFN layer into separated previous and current classifiers to maintain previous knowledge and encourage model to learn more robust representations at this training stage. |
| Outcome: | The proposed framework outperforms the state-of-the-art models on two benchmarks. |
A Spectral Viewpoint on Continual Relation Extraction (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to solve the Continual Relation Extraction problem have been proposed . |
| Approach: | They propose a class-wise regularization method that preserves eigenvectors for each class shape . they propose spectral regularization to preserve eenvector shape after learning new tasks . |
| Outcome: | The proposed method improves performance on two benchmark datasets. |
Serial Contrastive Knowledge Distillation for Continual Few-shot Relation Extraction (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing models for few-shot relation extraction (RE) are not suitable for continual few-sshot RE. |
| Approach: | They propose a new model to train a model for new relations with few labeled training data. |
| Outcome: | The proposed model outperforms state-of-the-art models on two benchmark datasets. |