基于影响函数的贝叶斯个性化排名学习遗忘

IF 1.6 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC
Jundong Chen;Honglei Zhang;Haoxuan Li;Yidong Li
{"title":"基于影响函数的贝叶斯个性化排名学习遗忘","authors":"Jundong Chen;Honglei Zhang;Haoxuan Li;Yidong Li","doi":"10.23919/cje.2023.00.417","DOIUrl":null,"url":null,"abstract":"Learning recommender models from vast amounts of behavioral data has become a mainstream paradigm in recent information systems. Conversely, with privacy awareness grown, there has been increasing attention to the removal of sensitive or outlier data from well-trained recommendation models (known as recommendation unlearning). However, current unlearning methods primarily focus on fully/partially retraining the entire model. Despite considerable performance, it inevitably introduces significant efficiency bottlenecks, which is impractical for latency-sensitive streaming services. While recent efforts exploit efficient unlearning in point-wise recommender tasks, these approaches overlook the partial order relationships between items, resulting in suboptimal performance in both recommendation and unlearning capabilities. In light of this, we explore learning to unlearn for Bayesian personalized ranking via influence function, which relies on a pair-wise ranking loss to model user preferences and item characteristics, making unlearning more challenging than in point-wise settings. Specifically, we propose an influence function-guided unlearning framework tailored for pair-wise ranking models to efficiently perform unlearning requests, which involves unlearning partial order relationships while handling negative samples appropriately during the unlearning process. Besides, we prove that our proposed method can theoretically match the performance of retraining counter-parts. Finally, we conduct extensive experiments to validate the effectiveness and efficiency of our model.","PeriodicalId":50701,"journal":{"name":"Chinese Journal of Electronics","volume":"34 3","pages":"990-1001"},"PeriodicalIF":1.6000,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11060023","citationCount":"0","resultStr":"{\"title\":\"Learning to Unlearn for Bayesian Personalized Ranking via Influence Function\",\"authors\":\"Jundong Chen;Honglei Zhang;Haoxuan Li;Yidong Li\",\"doi\":\"10.23919/cje.2023.00.417\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Learning recommender models from vast amounts of behavioral data has become a mainstream paradigm in recent information systems. Conversely, with privacy awareness grown, there has been increasing attention to the removal of sensitive or outlier data from well-trained recommendation models (known as recommendation unlearning). However, current unlearning methods primarily focus on fully/partially retraining the entire model. Despite considerable performance, it inevitably introduces significant efficiency bottlenecks, which is impractical for latency-sensitive streaming services. While recent efforts exploit efficient unlearning in point-wise recommender tasks, these approaches overlook the partial order relationships between items, resulting in suboptimal performance in both recommendation and unlearning capabilities. In light of this, we explore learning to unlearn for Bayesian personalized ranking via influence function, which relies on a pair-wise ranking loss to model user preferences and item characteristics, making unlearning more challenging than in point-wise settings. Specifically, we propose an influence function-guided unlearning framework tailored for pair-wise ranking models to efficiently perform unlearning requests, which involves unlearning partial order relationships while handling negative samples appropriately during the unlearning process. Besides, we prove that our proposed method can theoretically match the performance of retraining counter-parts. Finally, we conduct extensive experiments to validate the effectiveness and efficiency of our model.\",\"PeriodicalId\":50701,\"journal\":{\"name\":\"Chinese Journal of Electronics\",\"volume\":\"34 3\",\"pages\":\"990-1001\"},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2025-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11060023\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Chinese Journal of Electronics\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/11060023/\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chinese Journal of Electronics","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11060023/","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

从大量的行为数据中学习推荐模型已经成为当前信息系统的主流范式。相反,随着隐私意识的增强,人们越来越关注从训练有素的推荐模型中去除敏感或离群数据(称为推荐学习)。然而,目前的学习方法主要集中在对整个模型进行完全/部分再训练。尽管性能可观,但它不可避免地引入了显著的效率瓶颈,这对于延迟敏感的流媒体服务是不切实际的。虽然最近的研究在逐点推荐任务中利用了有效的遗忘,但这些方法忽略了项目之间的偏序关系,导致推荐和遗忘能力的性能都不理想。鉴于此,我们探索了通过影响函数学习取消贝叶斯个性化排名的方法,该方法依赖于成对排序损失来模拟用户偏好和物品特征,这使得取消学习比逐点设置更具挑战性。具体而言,我们提出了一种针对成对排序模型定制的影响函数引导的学习框架,以有效地执行学习请求,该框架涉及在学习过程中去除偏序关系的同时适当地处理负样本。此外,我们还证明了我们的方法在理论上可以匹配再训练对应部分的性能。最后,我们进行了大量的实验来验证我们模型的有效性和效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Learning to Unlearn for Bayesian Personalized Ranking via Influence Function
Learning recommender models from vast amounts of behavioral data has become a mainstream paradigm in recent information systems. Conversely, with privacy awareness grown, there has been increasing attention to the removal of sensitive or outlier data from well-trained recommendation models (known as recommendation unlearning). However, current unlearning methods primarily focus on fully/partially retraining the entire model. Despite considerable performance, it inevitably introduces significant efficiency bottlenecks, which is impractical for latency-sensitive streaming services. While recent efforts exploit efficient unlearning in point-wise recommender tasks, these approaches overlook the partial order relationships between items, resulting in suboptimal performance in both recommendation and unlearning capabilities. In light of this, we explore learning to unlearn for Bayesian personalized ranking via influence function, which relies on a pair-wise ranking loss to model user preferences and item characteristics, making unlearning more challenging than in point-wise settings. Specifically, we propose an influence function-guided unlearning framework tailored for pair-wise ranking models to efficiently perform unlearning requests, which involves unlearning partial order relationships while handling negative samples appropriately during the unlearning process. Besides, we prove that our proposed method can theoretically match the performance of retraining counter-parts. Finally, we conduct extensive experiments to validate the effectiveness and efficiency of our model.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Chinese Journal of Electronics
Chinese Journal of Electronics 工程技术-工程:电子与电气
CiteScore
3.70
自引率
16.70%
发文量
342
审稿时长
12.0 months
期刊介绍: CJE focuses on the emerging fields of electronics, publishing innovative and transformative research papers. Most of the papers published in CJE are from universities and research institutes, presenting their innovative research results. Both theoretical and practical contributions are encouraged, and original research papers reporting novel solutions to the hot topics in electronics are strongly recommended.
×
引用
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学术官方微信