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 , Jinyu Guo , Jijie Li , Jie Ou , Yufei Feng , Jie Hu , 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.
期刊介绍:
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.