利用语言模型进行高效、可解释的顺序推荐

IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Zihao Li, Lixin Zou, Chao Ma, Chenliang Li
{"title":"利用语言模型进行高效、可解释的顺序推荐","authors":"Zihao Li,&nbsp;Lixin Zou,&nbsp;Chao Ma,&nbsp;Chenliang Li","doi":"10.1016/j.ipm.2025.104122","DOIUrl":null,"url":null,"abstract":"<div><div>Motivated by the outstanding success of large language models (LLMs) in a broad spectrum of NLP tasks, applying them for explainable recommendation become a cutting-edge recently. However, due to the inherent inconsistency in the information and knowledge focused, most existing solutions treat item recommendation and explanation generation as two distinct processes, incurring extensive computational costs and memory footprint. Besides, these solutions often pay more attention to the item-side (<em>i.e.,</em> item attributes and descriptions) for explanation generation while ignoring the user personalized preference. To close this gap, in this paper, we propose a personalized explainable sequential recommendation model, which aims to output the recommendation results as well as the corresponding personalized explanations via a single inference step. Moreover, to mitigate the substantial computational cost, we devise a rescaling adapter and a Fast Fourier Transform (FFT) adapter for parameter-efficient fine-tuning (PEFT). Theoretical underpinnings and experimental results demonstrate that compared with prevalent PEFT solutions, our adapter possesses three merits: (1) a larger receptive field across the entire sequence for long-term dependency modeling; (2) element product in orthogonal bases for noise attenuation and signal amplifying; (3) better alignment and uniformity properties for precise recommendation. Comprehensive experiments on three public datasets against nine sequential recommendation solutions and three explanation generation solutions illustrate our <span>Pleaser</span> outperforms the strong baselines significantly with only 5% parameter fine-tuning. Code available at <span><span>https://github.com/WHUIR/PLEASER</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 4","pages":"Article 104122"},"PeriodicalIF":6.9000,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Efficient and explainable sequential recommendation with language model\",\"authors\":\"Zihao Li,&nbsp;Lixin Zou,&nbsp;Chao Ma,&nbsp;Chenliang Li\",\"doi\":\"10.1016/j.ipm.2025.104122\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Motivated by the outstanding success of large language models (LLMs) in a broad spectrum of NLP tasks, applying them for explainable recommendation become a cutting-edge recently. However, due to the inherent inconsistency in the information and knowledge focused, most existing solutions treat item recommendation and explanation generation as two distinct processes, incurring extensive computational costs and memory footprint. Besides, these solutions often pay more attention to the item-side (<em>i.e.,</em> item attributes and descriptions) for explanation generation while ignoring the user personalized preference. To close this gap, in this paper, we propose a personalized explainable sequential recommendation model, which aims to output the recommendation results as well as the corresponding personalized explanations via a single inference step. Moreover, to mitigate the substantial computational cost, we devise a rescaling adapter and a Fast Fourier Transform (FFT) adapter for parameter-efficient fine-tuning (PEFT). Theoretical underpinnings and experimental results demonstrate that compared with prevalent PEFT solutions, our adapter possesses three merits: (1) a larger receptive field across the entire sequence for long-term dependency modeling; (2) element product in orthogonal bases for noise attenuation and signal amplifying; (3) better alignment and uniformity properties for precise recommendation. Comprehensive experiments on three public datasets against nine sequential recommendation solutions and three explanation generation solutions illustrate our <span>Pleaser</span> outperforms the strong baselines significantly with only 5% parameter fine-tuning. Code available at <span><span>https://github.com/WHUIR/PLEASER</span><svg><path></path></svg></span>.</div></div>\",\"PeriodicalId\":50365,\"journal\":{\"name\":\"Information Processing & Management\",\"volume\":\"62 4\",\"pages\":\"Article 104122\"},\"PeriodicalIF\":6.9000,\"publicationDate\":\"2025-03-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/S0306457325000640\",\"RegionNum\":1,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457325000640","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

由于大型语言模型(llm)在广泛的NLP任务中取得了杰出的成功,将它们应用于可解释的推荐最近成为一个前沿。然而,由于关注信息和知识的固有不一致性,大多数现有的解决方案将项目推荐和解释生成视为两个不同的过程,从而产生大量的计算成本和内存占用。此外,这些解决方案往往更关注物品侧(即物品属性和描述)来生成解释,而忽略了用户的个性化偏好。为了缩小这一差距,本文提出了一种个性化可解释的顺序推荐模型,该模型旨在通过单个推理步骤输出推荐结果以及相应的个性化解释。此外,为了减少大量的计算成本,我们设计了一个重缩放适配器和一个用于参数有效微调(PEFT)的快速傅立叶变换(FFT)适配器。理论基础和实验结果表明,与流行的PEFT解决方案相比,我们的适配器具有三个优点:(1)在整个序列中具有更大的接受场,用于长期依赖建模;(2)正交基元积,衰减噪声,放大信号;(3)更好的对准和均匀性,便于精确推荐。在三个公共数据集上针对9个顺序推荐解决方案和3个解释生成解决方案进行的综合实验表明,我们的Pleaser仅通过5%的参数微调就显著优于强基线。代码可从https://github.com/WHUIR/PLEASER获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient and explainable sequential recommendation with language model
Motivated by the outstanding success of large language models (LLMs) in a broad spectrum of NLP tasks, applying them for explainable recommendation become a cutting-edge recently. However, due to the inherent inconsistency in the information and knowledge focused, most existing solutions treat item recommendation and explanation generation as two distinct processes, incurring extensive computational costs and memory footprint. Besides, these solutions often pay more attention to the item-side (i.e., item attributes and descriptions) for explanation generation while ignoring the user personalized preference. To close this gap, in this paper, we propose a personalized explainable sequential recommendation model, which aims to output the recommendation results as well as the corresponding personalized explanations via a single inference step. Moreover, to mitigate the substantial computational cost, we devise a rescaling adapter and a Fast Fourier Transform (FFT) adapter for parameter-efficient fine-tuning (PEFT). Theoretical underpinnings and experimental results demonstrate that compared with prevalent PEFT solutions, our adapter possesses three merits: (1) a larger receptive field across the entire sequence for long-term dependency modeling; (2) element product in orthogonal bases for noise attenuation and signal amplifying; (3) better alignment and uniformity properties for precise recommendation. Comprehensive experiments on three public datasets against nine sequential recommendation solutions and three explanation generation solutions illustrate our Pleaser outperforms the strong baselines significantly with only 5% parameter fine-tuning. Code available at https://github.com/WHUIR/PLEASER.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术文献互助群
群 号:604180095
Book学术官方微信