Pith. sign in

REVIEW 2 cited by

Sentence Embedding Alignment for Lifelong Relation Extraction

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1903.02588 v3 pith:OAN3SDAM submitted 2019-03-06 cs.CL

classification cs.CL
keywords datalifelongrelationsembeddingextractionlearningmethodsmodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Conventional approaches to relation extraction usually require a fixed set of pre-defined relations. Such requirement is hard to meet in many real applications, especially when new data and relations are emerging incessantly and it is computationally expensive to store all data and re-train the whole model every time new data and relations come in. We formulate such a challenging problem as lifelong relation extraction and investigate memory-efficient incremental learning methods without catastrophically forgetting knowledge learned from previous tasks. We first investigate a modified version of the stochastic gradient methods with a replay memory, which surprisingly outperforms recent state-of-the-art lifelong learning methods. We further propose to improve this approach to alleviate the forgetting problem by anchoring the sentence embedding space. Specifically, we utilize an explicit alignment model to mitigate the sentence embedding distortion of the learned model when training on new data and new relations. Experiment results on multiple benchmarks show that our proposed method significantly outperforms the state-of-the-art lifelong learning approaches.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. ETT-CKGE: Efficient Task-driven Tokens for Continual Knowledge Graph Embedding

    cs.CL 2025-06 conditional novelty 6.0 of 10

    ETT-CKGE replaces manual importance scoring in continual knowledge graph embedding with learned token masks, achieving competitive accuracy with much lower training time and memory.

  2. C$^{2}$INet: Realizing Incremental Trajectory Prediction with Prior-Aware Continual Causal Intervention

    cs.LG 2024-11 reject novelty 4.0 of 10

    C2INet couples a variational causal intervention with a continually updated prior queue to reduce catastrophic forgetting and improve multi-agent trajectory prediction.

Pith tools