Enhancing partition distinction: A contrastive policy to recommendation unlearning

IF 6.3 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Lin Li , Shengda Zhuo , Hongguang Lin , Jinchun He , Wangjie Qiu , Qinnan Zhang , Changdong Wang , Shuqiang Huang
{"title":"Enhancing partition distinction: A contrastive policy to recommendation unlearning","authors":"Lin Li ,&nbsp;Shengda Zhuo ,&nbsp;Hongguang Lin ,&nbsp;Jinchun He ,&nbsp;Wangjie Qiu ,&nbsp;Qinnan Zhang ,&nbsp;Changdong Wang ,&nbsp;Shuqiang Huang","doi":"10.1016/j.neunet.2025.107667","DOIUrl":null,"url":null,"abstract":"<div><div>With the growing privacy and data contamination concerns in recommendation systems, recommendation unlearning, <em>i.e.</em>, unlearning the impact of specific learned data, has garnered more attention. Unfortunately, existing research primarily focuses on the complete unlearning of target data, neglecting the balance between unlearning integrity, practicality, and efficiency. Two major restrictions hinder the widespread application of this unlearning paradigm in practice. First, while prior studies often assume consistent similarity among samples, they overly emphasize the local collaborative relationships between samples and central nodes, leading to an imbalance between local and global collaborative information. Second, while data partition appears to be a default setup, this evidently exacerbates the sparsity of recommendation data, which can have a potentially negative impact on recommendation quality. To fill these gaps, this paper proposes a data partitioning and submodel training strategy, named <em>Partition Distinction with Contrastive Recommendation Unlearning</em> (PDCRU), which aims to balance data partitioning and feature sparsity. The key idea is to extract structural features as global collaborative information for samples and introduce structural feature constraints based on sample similarity during the partitioning process. For submodel training, we leverage contrastive learning to introduce additional high-quality training signals to enhance model embeddings. Extensive experiments validate the feasibility and consistent superiority of our method over existing recommendation unlearning models in learning and unlearning. Specifically, our model achieves a 4.83% improvement in performance and a 4.64x enhancement in unlearning efficiency compared to baseline methods. The code is released at <span><span>https://github.com/linli0818/PDCRU</span><svg><path></path></svg></span></div></div>","PeriodicalId":49763,"journal":{"name":"Neural Networks","volume":"190 ","pages":"Article 107667"},"PeriodicalIF":6.3000,"publicationDate":"2025-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neural Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0893608025005477","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

With the growing privacy and data contamination concerns in recommendation systems, recommendation unlearning, i.e., unlearning the impact of specific learned data, has garnered more attention. Unfortunately, existing research primarily focuses on the complete unlearning of target data, neglecting the balance between unlearning integrity, practicality, and efficiency. Two major restrictions hinder the widespread application of this unlearning paradigm in practice. First, while prior studies often assume consistent similarity among samples, they overly emphasize the local collaborative relationships between samples and central nodes, leading to an imbalance between local and global collaborative information. Second, while data partition appears to be a default setup, this evidently exacerbates the sparsity of recommendation data, which can have a potentially negative impact on recommendation quality. To fill these gaps, this paper proposes a data partitioning and submodel training strategy, named Partition Distinction with Contrastive Recommendation Unlearning (PDCRU), which aims to balance data partitioning and feature sparsity. The key idea is to extract structural features as global collaborative information for samples and introduce structural feature constraints based on sample similarity during the partitioning process. For submodel training, we leverage contrastive learning to introduce additional high-quality training signals to enhance model embeddings. Extensive experiments validate the feasibility and consistent superiority of our method over existing recommendation unlearning models in learning and unlearning. Specifically, our model achieves a 4.83% improvement in performance and a 4.64x enhancement in unlearning efficiency compared to baseline methods. The code is released at https://github.com/linli0818/PDCRU
增强分区区分:推荐遗忘的对比策略
随着推荐系统中隐私和数据污染问题的日益严重,推荐遗忘,即遗忘特定学习数据的影响,受到了越来越多的关注。遗憾的是,现有的研究主要侧重于目标数据的完全遗忘,而忽略了遗忘的完整性、实用性和效率之间的平衡。两个主要的限制阻碍了这种遗忘范式在实践中的广泛应用。首先,以往的研究往往假设样本之间具有一致的相似性,但过于强调样本与中心节点之间的局部协作关系,导致局部与全局协作信息不平衡。其次,虽然数据分区似乎是默认设置,但这显然加剧了推荐数据的稀疏性,这可能对推荐质量产生潜在的负面影响。为了填补这些空白,本文提出了一种数据分区和子模型训练策略,称为分区区分与对比推荐学习(PDCRU),旨在平衡数据分区和特征稀疏性。其关键思想是提取结构特征作为样本的全局协同信息,并在划分过程中引入基于样本相似性的结构特征约束。对于子模型训练,我们利用对比学习引入额外的高质量训练信号来增强模型嵌入。大量的实验验证了我们的方法在学习和取消学习方面优于现有推荐学习模型的可行性和一致性。具体来说,与基线方法相比,我们的模型在性能上提高了4.83%,在学习效率上提高了4.64倍。该代码发布在https://github.com/linli0818/PDCRU
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Neural Networks
Neural Networks 工程技术-计算机:人工智能
CiteScore
13.90
自引率
7.70%
发文量
425
审稿时长
67 days
期刊介绍: Neural Networks is a platform that aims to foster an international community of scholars and practitioners interested in neural networks, deep learning, and other approaches to artificial intelligence and machine learning. Our journal invites submissions covering various aspects of neural networks research, from computational neuroscience and cognitive modeling to mathematical analyses and engineering applications. By providing a forum for interdisciplinary discussions between biology and technology, we aim to encourage the development of biologically-inspired artificial intelligence.
×
引用
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学术官方微信