Improving event representation learning via generating and utilizing synthetic data

IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Yubo Feng, Lishuang Li, Xueyang Qin, Beibei Zhang
{"title":"Improving event representation learning via generating and utilizing synthetic data","authors":"Yubo Feng,&nbsp;Lishuang Li,&nbsp;Xueyang Qin,&nbsp;Beibei Zhang","doi":"10.1016/j.ipm.2025.104083","DOIUrl":null,"url":null,"abstract":"<div><div>Representations of events are important in various event-related tasks. Recent advances in event representation learning have focused on Contrastive Learning (CL) resulting in remarkable progress. However, solely using <em>dropout</em> as the data augmentation technique in CL methods may cause the model to become sensitive to length differences between event pairs. Moreover, CL methods ignore the evidence that the similarities between positive pairs are different, and the encoder-aware similarities also change dynamically as training progresses. It may cause the event encoder to learn the alignment of positive pairs at a coarse-grained level. In this paper, we propose <strong>LLM-CL</strong>: a <strong>L</strong>arge <strong>L</strong>anguage <strong>M</strong>odels-driven self-adaptive <strong>C</strong>ontrastive <strong>L</strong>earning framework for event representation learning. Specifically, we present an event knowledge graph-augmented synthetic data generation method designed to alleviate the sensitivity of CL-based models to length differences between event pairs. This method generates large-scale, high-quality event pairs with equivalent semantics, little lexical overlap, and varying text lengths. Additionally, we propose a novel CL method called self-adaptive contrastive learning to help the event encoder effectively and efficiently learn the alignment of synthetic data at fine-grained levels. This method dynamically estimates encoder-aware similarities and scales the CL losses accordingly. Experimental results show that LLM-CL outperforms strong baselines in both intrinsic and extrinsic evaluations. Our code is publicly available at <span><span>https://github.com/YuboFeng2023/LLM-CL</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 4","pages":"Article 104083"},"PeriodicalIF":7.4000,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457325000251","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Representations of events are important in various event-related tasks. Recent advances in event representation learning have focused on Contrastive Learning (CL) resulting in remarkable progress. However, solely using dropout as the data augmentation technique in CL methods may cause the model to become sensitive to length differences between event pairs. Moreover, CL methods ignore the evidence that the similarities between positive pairs are different, and the encoder-aware similarities also change dynamically as training progresses. It may cause the event encoder to learn the alignment of positive pairs at a coarse-grained level. In this paper, we propose LLM-CL: a Large Language Models-driven self-adaptive Contrastive Learning framework for event representation learning. Specifically, we present an event knowledge graph-augmented synthetic data generation method designed to alleviate the sensitivity of CL-based models to length differences between event pairs. This method generates large-scale, high-quality event pairs with equivalent semantics, little lexical overlap, and varying text lengths. Additionally, we propose a novel CL method called self-adaptive contrastive learning to help the event encoder effectively and efficiently learn the alignment of synthetic data at fine-grained levels. This method dynamically estimates encoder-aware similarities and scales the CL losses accordingly. Experimental results show that LLM-CL outperforms strong baselines in both intrinsic and extrinsic evaluations. Our code is publicly available at https://github.com/YuboFeng2023/LLM-CL.
通过生成和利用合成数据改进事件表示学习
事件表示在各种与事件相关的任务中非常重要。事件表征学习的最新进展主要集中在对比学习(CL)上,并取得了显著的进展。但是,在CL方法中单独使用dropout作为数据增强技术可能会导致模型对事件对之间的长度差异变得敏感。此外,CL方法忽略了正对之间相似度不同的证据,编码器感知的相似度也随着训练的进行而动态变化。它可能导致事件编码器在粗粒度级别学习正对的对齐。在本文中,我们提出了LLM-CL:一个用于事件表示学习的大语言模型驱动的自适应对比学习框架。具体来说,我们提出了一种事件知识图增强的合成数据生成方法,旨在减轻基于cl的模型对事件对长度差异的敏感性。该方法生成大规模、高质量的事件对,这些事件对具有相同的语义、很少的词汇重叠和不同的文本长度。此外,我们提出了一种新的CL方法,称为自适应对比学习,以帮助事件编码器在细粒度级别上有效地学习合成数据的对齐。该方法动态估计编码器感知的相似性,并相应地缩放CL损失。实验结果表明,LLM-CL在内在和外在评价方面都优于强基线。我们的代码可以在https://github.com/YuboFeng2023/LLM-CL上公开获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information Processing & Management
Information Processing & Management 工程技术-计算机:信息系统
CiteScore
17.00
自引率
11.60%
发文量
276
审稿时长
39 days
期刊介绍: Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing. We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信