LoRec: Combating Poisons with Large Language Model for Robust Sequential Recommendation

被引:1
作者
Zhang, Kaike [1 ,2 ]
Cao, Qi [1 ]
Wu, Yunfan [1 ,2 ]
Sun, Fei [1 ]
Shen, Huawei [1 ]
Cheng, Xueqi [1 ]
机构
[1] Chinese Acad Sci, Inst Comp Technol, CAS Key Lab AI Safety, Beijing, Peoples R China
[2] Univ Chinese Acad Sci, Beijing, Peoples R China
来源
PROCEEDINGS OF THE 47TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, SIGIR 2024 | 2024年
基金
国家重点研发计划; 中国国家自然科学基金;
关键词
Robust Sequential Recommendation; Large Language Model; Poisoning Attack;
D O I
10.1145/3626772.3657684
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Sequential recommender systems stand out for their ability to capture users' dynamic interests and the patterns of item transitions. However, the inherent openness of sequential recommender systems renders them vulnerable to poisoning attacks, where fraudsters are injected into the training data to manipulate learned patterns. Traditional defense methods predominantly depend on predefined assumptions or rules extracted from specific known attacks, limiting their generalizability to unknown attacks. To solve the above problems, considering the rich open-world knowledge encapsulated in Large Language Models (LLMs), we attempt to introduce LLMs into defense methods to broaden the knowledge beyond limited known attacks. We propose LoRec, an innovative framework that employs LLM-Enhanced Calibration to strengthen the robustness of sequential Recommender systems against poisoning attacks. LoRec integrates an LLM-enhanced CalibraTor (LCT) that refines the training process of sequential recommender systems with knowledge derived from LLMs, applying a user-wise reweighting to diminish the impact of attacks. Incorporating LLMs' open-world knowledge, the LCT effectively converts the limited, specific priors or rules into a more general pattern of fraudsters, offering improved defenses against poisons. Our comprehensive experiments validate that LoRec, as a general framework, significantly strengthens the robustness of sequential recommender systems.
引用
收藏
页码:1733 / 1742
页数:10
相关论文
共 43 条
  • [11] Recurrent Neural Networks with Top-k Gains for Session-based Recommendations
    Hidasi, Balazs
    Karatzoglou, Alexandros
    [J]. CIKM'18: PROCEEDINGS OF THE 27TH ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2018, : 843 - 852
  • [12] Hou Y., 2023, WWW, P1162
  • [13] Data Poisoning Attacks to Deep Learning Based Recommender Systems
    Huang, Hai
    Mu, Jiaming
    Gong, Neil Zhenqiang
    Li, Qi
    Liu, Bin
    Xu, Mingwei
    [J]. 28TH ANNUAL NETWORK AND DISTRIBUTED SYSTEM SECURITY SYMPOSIUM (NDSS 2021), 2021,
  • [14] Jiao W, 2023, ARXIV
  • [15] Self-Attentive Sequential Recommendation
    Kang, Wang-Cheng
    McAuley, Julian
    [J]. 2018 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2018, : 197 - 206
  • [16] Lam S.K., 2004, WWW, P393
  • [17] Li J., 2023, ARXIV
  • [18] Li Raymond, 2023, arXiv
  • [19] Adversarial Learning to Compare: Self-Attentive Prospective Customer Recommendation in Location based Social Networks
    Li, Ruirui
    Wu, Xian
    Wang, Wei
    [J]. PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM '20), 2020, : 349 - 357
  • [20] Recommending Inferior Results: A General and Feature-Free Model for Spam Detection
    Liu, Yuli
    [J]. CIKM '20: PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, 2020, : 955 - 964