mlsanityData to 7 Oct 2026

Less is More: Rethinking State-of-the-art Continual Relation Extraction Models with a Frustratingly Easy but Effective Approach

arXiv 2209.00243 ↗First posted 1 Sep 2022cs.CLcited by 8

Not on the map. Why?

Abstract (arXiv)

Continual relation extraction (CRE) requires the model to continually learn new relations from class-incremental data streams. In this paper, we propose a Frustratingly easy but Effective Approach (FEA) method with two learning stages for CRE: 1) Fast Adaption (FA) warms up the model with only new data. 2) Balanced Tuning (BT) finetunes the model on the balanced memory data. Despite its simplicity, FEA achieves comparable (on TACRED or superior (on FewRel) performance compared with the state-of-the-art baselines. With careful examinations, we find that the data imbalance between new and old relations leads to a skewed decision boundary in the head classifiers over the pretrained encoders, thus hurting the overall performance. In FEA, the FA stage unleashes the potential of memory data for the subsequent finetuning, while the BT stage helps establish a more balanced decision boundary. With a unified view, we find that two strong CRE baselines can be subsumed into the proposed training pipeline. The success of FEA also provides actionable insights and suggestions for future model designing in CRE.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 22 of its 37 references that are in the map. First posted on arXiv 1 Sep 2022.

Builds on

22 of 37 references.

References · 22

  1. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  2. 2016Learning without Forgettingcited by 2,465
  3. 2017Gradient Episodic Memory for Continual Learningcited by 1,871
  4. 2017Continual Learning with Deep Generative Replaycited by 1,152
  5. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
  6. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
  7. 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 672
  8. 2017Progressive Neural Architecture Searchcited by 483
  9. 2019Matching the Blanks: Distributional Similarity for Relation Learningcited by 271
  10. 2018FewRel: A Large-Scale Supervised Few-Shot Relation Classification Dataset with State-of-the-Art Evaluationcited by 254
  11. 2016End-to-End Relation Extraction using LSTMs on Sequences and Tree Structurescited by 161
  12. 2020Continual Lifelong Learning in Natural Language Processing: A Surveycited by 152
10 more
  1. 2018Graph Convolution over Pruned Dependency Trees Improves Relation Extractioncited by 146
  2. 2019Striking the Right Balance with Uncertaintycited by 79
  3. 2019Sentence Embedding Alignment for Lifelong Relation Extractioncited by 70
  4. 2019Adjusting Decision Boundary for Class Imbalanced Learningcited by 52
  5. 2017Continual Learning in Generative Adversarial Netscited by 51
  6. 2015Classifying Relations via Long Short Term Memory Networks along Shortest Dependency Pathcited by 35
  7. 2021Curriculum-Meta Learning for Order-Robust Continual Relation Extractioncited by 34
  8. 2022Consistent Representation Learning for Continual Relation Extractioncited by 28
  9. 2019Improving Relation Extraction by Pre-trained Language Representationscited by 24
  10. 2015Improved Relation Extraction with Feature-Rich Compositional Embedding Modelscited by 12

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 4; 2024: 3.

8 papers.