Mitigating the negative impact of over-association for conversational query production

IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Processing & Management Pub Date : 2024-09-26 DOI:10.1016/j.ipm.2024.103907
Ante Wang , Linfeng Song , Zijun Min , Ge Xu , Xiaoli Wang , Junfeng Yao , Jinsong Su
{"title":"Mitigating the negative impact of over-association for conversational query production","authors":"Ante Wang ,&nbsp;Linfeng Song ,&nbsp;Zijun Min ,&nbsp;Ge Xu ,&nbsp;Xiaoli Wang ,&nbsp;Junfeng Yao ,&nbsp;Jinsong Su","doi":"10.1016/j.ipm.2024.103907","DOIUrl":null,"url":null,"abstract":"<div><div>Conversational query generation aims at producing search queries from dialogue histories, which are then used to retrieve relevant knowledge from a search engine to help knowledge-based dialogue systems. Trained to maximize the likelihood of gold queries, previous models suffer from the data hunger issue, and they tend to both drop important concepts from dialogue histories and generate irrelevant concepts at inference time. We attribute these issues to the <em>over-association</em> phenomenon where a large number of gold queries are indirectly related to the dialogue topics, because annotators may unconsciously perform reasoning with their background knowledge when generating these gold queries. We carefully analyze the negative effects of this phenomenon on pretrained Seq2seq query producers and then propose effective instance-level weighting strategies for training to mitigate these issues from multiple perspectives. Experiments on two benchmarks, Wizard-of-Internet and DuSinc, show that our strategies effectively alleviate the negative effects and lead to significant performance gains (2%<!--> <span><math><mo>∼</mo></math></span> <!--> <!-->5% across automatic metrics and human evaluation). Further analysis shows that our model selects better concepts from dialogue histories and is <em>10 times</em> more data efficient than the baseline.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 1","pages":"Article 103907"},"PeriodicalIF":7.4000,"publicationDate":"2024-09-26","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/S0306457324002668","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

Conversational query generation aims at producing search queries from dialogue histories, which are then used to retrieve relevant knowledge from a search engine to help knowledge-based dialogue systems. Trained to maximize the likelihood of gold queries, previous models suffer from the data hunger issue, and they tend to both drop important concepts from dialogue histories and generate irrelevant concepts at inference time. We attribute these issues to the over-association phenomenon where a large number of gold queries are indirectly related to the dialogue topics, because annotators may unconsciously perform reasoning with their background knowledge when generating these gold queries. We carefully analyze the negative effects of this phenomenon on pretrained Seq2seq query producers and then propose effective instance-level weighting strategies for training to mitigate these issues from multiple perspectives. Experiments on two benchmarks, Wizard-of-Internet and DuSinc, show that our strategies effectively alleviate the negative effects and lead to significant performance gains (2%   5% across automatic metrics and human evaluation). Further analysis shows that our model selects better concepts from dialogue histories and is 10 times more data efficient than the baseline.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
减轻过度关联对会话查询制作的负面影响
对话查询生成的目的是从对话历史中生成搜索查询,然后利用这些查询从搜索引擎中检索相关知识,从而帮助基于知识的对话系统。以往的模型是为了最大限度地提高黄金查询的可能性而训练的,但却存在数据饥饿问题,它们往往会放弃对话历史中的重要概念,并在推理时产生不相关的概念。我们将这些问题归咎于过度关联现象,即大量金查询与对话主题间接相关,因为注释者在生成这些金查询时可能会不自觉地利用其背景知识进行推理。我们仔细分析了这种现象对预训练 Seq2seq 查询生成器的负面影响,然后提出了有效的实例级加权训练策略,从多个角度缓解了这些问题。在 Wizard-of-Internet 和 DuSinc 这两个基准上进行的实验表明,我们的策略有效地缓解了负面影响,并带来了显著的性能提升(在自动度量和人工评估中均为 2% ∼ 5%)。进一步的分析表明,我们的模型能从对话历史中选择更好的概念,其数据效率是基准模型的 10 倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
Integration of public libraries and cultural tourism in China: An analysis of library attractiveness components based on tourist review mining Bias-guided margin loss for robust Visual Question Answering Reversible source-aware natural language watermarking via customized lexical substitution Advancing emotion recognition in social media: A novel integration of heterogeneous neural networks with fine-tuned language models Fusion of generative adversarial networks and non-negative tensor decomposition for depression fMRI data analysis
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1