Adversarial hard negative samples for continual relation extraction

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Shunyu Yao , Jinyu Guo , Jijie Li , Jie Ou , Yufei Feng , Jie Hu , Dan Liu
{"title":"Adversarial hard negative samples for continual relation extraction","authors":"Shunyu Yao ,&nbsp;Jinyu Guo ,&nbsp;Jijie Li ,&nbsp;Jie Ou ,&nbsp;Yufei Feng ,&nbsp;Jie Hu ,&nbsp;Dan Liu","doi":"10.1016/j.asoc.2025.113365","DOIUrl":null,"url":null,"abstract":"<div><div>Continual relation extraction (CRE) is a crucial task in continuous learning, aiming to train a model continually on data of new relations to extract relations between entities from unstructured text. This process involves learning newly emerged relations while avoiding catastrophic forgetting of previously learned relations. Existing works have demonstrated that storing a few typical samples of old relations in memory and replaying them during subsequent training for new relations is helpful. It can assist the model to maintain a stable understanding of old relations, thus effectively avoiding forgetting them. However, most prior research has focused on efficiently utilizing memory samples while neglecting their learning difficulty, which refers to the challenge in mastering these samples. In this paper, we propose an adversarial hard negative samples selection mechanism to increase the diversity of memory samples and dynamically adjust the number of samples among relations according to the performance of the model. Experimental results show that our method consistently improves the performance of state-of-the-art CRE models without increasing the number of training samples on mainstream benchmarks.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"181 ","pages":"Article 113365"},"PeriodicalIF":7.2000,"publicationDate":"2025-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625006763","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Continual relation extraction (CRE) is a crucial task in continuous learning, aiming to train a model continually on data of new relations to extract relations between entities from unstructured text. This process involves learning newly emerged relations while avoiding catastrophic forgetting of previously learned relations. Existing works have demonstrated that storing a few typical samples of old relations in memory and replaying them during subsequent training for new relations is helpful. It can assist the model to maintain a stable understanding of old relations, thus effectively avoiding forgetting them. However, most prior research has focused on efficiently utilizing memory samples while neglecting their learning difficulty, which refers to the challenge in mastering these samples. In this paper, we propose an adversarial hard negative samples selection mechanism to increase the diversity of memory samples and dynamically adjust the number of samples among relations according to the performance of the model. Experimental results show that our method consistently improves the performance of state-of-the-art CRE models without increasing the number of training samples on mainstream benchmarks.
用于连续关系提取的对抗性硬负样本
持续关系抽取(CRE)是持续学习中的一项重要任务,其目的是在新的关系数据上不断训练模型,从而从非结构化文本中提取实体之间的关系。这个过程包括学习新出现的关系,同时避免灾难性地忘记以前学过的关系。现有的研究表明,在记忆中储存一些典型的旧关系样本,并在随后的新关系训练中重新播放它们是有帮助的。它可以帮助模型保持对旧关系的稳定理解,从而有效地避免忘记它们。然而,大多数先前的研究都集中在有效地利用记忆样本,而忽略了他们的学习困难,即掌握这些样本的挑战。在本文中,我们提出了一种对抗性的硬负样本选择机制,以增加记忆样本的多样性,并根据模型的性能动态调整关系中的样本数量。实验结果表明,我们的方法在不增加主流基准训练样本数量的情况下持续提高了最先进的CRE模型的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信