mlsanityData to 7 Oct 2026

Learning Robust Representations for Continual Relation Extraction via Adversarial Class Augmentation

arXiv 2210.04497 ↗First posted 10 Oct 2022cs.CLcited by 13

Not on the map. Why?

Abstract (arXiv)

Continual relation extraction (CRE) aims to continually learn new relations from a class-incremental data stream. CRE model usually suffers from catastrophic forgetting problem, i.e., the performance of old relations seriously degrades when the model learns new relations. Most previous work attributes catastrophic forgetting to the corruption of the learned representations as new relations come, with an implicit assumption that the CRE models have adequately learned the old relations. In this paper, through empirical studies we argue that this assumption may not hold, and an important reason for catastrophic forgetting is that the learned representations do not have good robustness against the appearance of analogous relations in the subsequent learning process. To address this issue, we encourage the model to learn more precise and robust representations through a simple yet effective adversarial class augmentation mechanism (ACA), which is easy to implement and model-agnostic. Experimental results show that ACA can consistently improve the performance of state-of-the-art CRE models on two popular benchmarks.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 29 of its 44 references that are in the map. First posted on arXiv 10 Oct 2022.

Builds on

29 of 44 references.

References · 29

  1. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  2. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
  3. 2020Shortcut Learning in Deep Neural Networkscited by 1,928
  4. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
  5. 2018Efficient Lifelong Learning with A-GEMcited by 1,044
  6. 2019AugMix: A Simple Data Processing Method to Improve Robustness and Uncertaintycited by 897
  7. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
  8. 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 734
  9. 2019Large Scale Incremental Learningcited by 727
  10. 2018Generalizing to Unseen Domains via Adversarial Data Augmentationcited by 451
  11. 2019Matching the Blanks: Distributional Similarity for Relation Learningcited by 271
  12. 2018FewRel: A Large-Scale Supervised Few-Shot Relation Classification Dataset with State-of-the-Art Evaluationcited by 254
17 more
  1. 2020An Empirical Study on Robustness to Spurious Correlations using Pre-trained Language Modelscited by 133
  2. 2019End-to-End Bias Mitigation by Modelling Biases in Corporacited by 127
  3. 2020Maximum-Entropy Adversarial Data Augmentation for Improved Generalization and Robustnesscited by 121
  4. 2019Unlearn Dataset Bias in Natural Language Inference by Fitting the Residualcited by 119
  5. 2020Learning from Context or Names? An Empirical Study on Neural Relation Extractioncited by 75
  6. 2019Sentence Embedding Alignment for Lifelong Relation Extractioncited by 70
  7. 2018Did the Model Understand the Question?cited by 60
  8. 2020Automatic Shortcut Removal for Self-Supervised Representation Learningcited by 43
  9. 2021Why Machine Reading Comprehension Models Learn Shortcuts?cited by 40
  10. 2021Curriculum-Meta Learning for Order-Robust Continual Relation Extractioncited by 34
  11. 2015Classifying Relations by Ranking with Convolutional Neural Networkscited by 33
  12. 2022Consistent Representation Learning for Continual Relation Extractioncited by 28
  13. 2016Improved Relation Classification by Deep Recurrent Neural Networks with Data Augmentationcited by 26
  14. 2015Semantic Relation Classification via Convolutional Neural Networks with Simple Negative Samplingcited by 12
  15. 2021Behind the Scenes: An Exploration of Trigger Biases Problem in Few-Shot Event Classificationcited by 8
  16. 2022Less is More: Rethinking State-of-the-art Continual Relation Extraction Models with a Frustratingly Easy but Effective Approachcited by 8
  17. 2020Contextualised Graph Attention for Improved Relation Extractioncited by 2

Built on by

Cited by year

Citing papers per year: 2023: 9; 2024: 3; 2025: 1.

13 papers.

Sort: