Sharpness-Aware Poisoning: Enhancing Transferability of Injective Attacks on Recommender Systems
Not on the map. Why?
Abstract (arXiv)
Recommender Systems~(RS) have been shown to be vulnerable to injective attacks, where attackers inject limited fake user profiles to promote the exposure of target items to real users for unethical gains (e.g., economic or political advantages). Since attackers typically lack knowledge of the victim model deployed in the target RS, existing methods resort to using a fixed surrogate model to mimic the potential victim model. Despite considerable progress, we argue that the assumption that textitpoisoned data generated for the surrogate model can be used to attack other victim models is wishful. When there are significant structural discrepancies between the surrogate and victim models, the attack transferability inevitably suffers. Intuitively, if we can identify the worst-case victim model and iteratively optimize the poisoning effect specifically against it, then the generated poisoned data would be better transferred to other victim models. However, exactly identifying the worst-case victim model during the attack process is challenging due to the large space of victim models. To this end, in this work, we propose a novel attack method called Sharpness-Aware Poisoning (textitSharpAP). Specifically, it employs the sharpness-aware minimization principle to seek the approximately worst-case victim model and optimizes the poisoned data specifically for this worst-case model. The poisoning attack with SharpAP is formulated as a min-max-min tri-level optimization problem. By integrating SharpAP into the iterative process for attacks, our method can generate more robust poisoned data which is less sensitive to the shift of model structure, mitigating the overfitting to the surrogate model. Comprehensive experimental comparisons on three real-world datasets demonstrate that name~can significantly enhance the attack transferability.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 33 of its 55 references that are in the map. First posted on arXiv 24 Apr 2026.
Builds on
33 of 55 references.
References · 33
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2015Image-based Recommendations on Styles and Substitutescited by 702
- 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
- 2018Personalized Top-N Sequential Recommendation via Convolutional Sequence Embeddingcited by 473
- 2020Self-supervised Graph Learning for Recommendationcited by 305
- 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
- 2021Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendationcited by 173
- 2016Data Poisoning Attacks on Factorization-Based Collaborative Filteringcited by 78
- 2020Regularizing Neural Networks via Adversarial Model Perturbationcited by 78
21 more
- 2020Influence Function based Data Poisoning Attacks to Top-N Recommender Systemscited by 61
- 2021A Survey on Accuracy-oriented Neural Recommendation: From Collaborative Filtering to Information-rich Recommendationcited by 59
- 2024Friendly Sharpness-Aware Minimizationcited by 52
- 2020Attacking Black-box Recommendations via Copying Cross-domain User Profilescited by 31
- 2023ImbSAM: A Closer Look at Sharpness-Aware Minimization in Class-Imbalanced Recognitioncited by 31
- 2020Revisiting Adversarially Learned Injection Attacks Against Recommender Systemscited by 30
- 2023Why Does Sharpness-Aware Minimization Generalize Better Than SGD?cited by 27
- 2020Attacking Recommender Systems with Augmented User Profilescited by 24
- 2023Generative Contrastive Graph Learning for Recommendationcited by 20
- 2020SetRank: A Setwise Bayesian Approach for Collaborative Ranking from Implicit Feedbackcited by 15
- 2022Shilling Black-box Recommender Systems by Learning to Generate Fake User Profilescited by 15
- 2023Unveiling Vulnerabilities of Contrastive Recommender Systems to Poisoning Attackscited by 10
- 2023Sharpness-Aware Data Poisoning Attackcited by 9
- 2024ID-Free Not Risk-Free: LLM-Powered Agents Unveil Risks in ID-Free Recommender Systemscited by 9
- 2025When Graph Contrastive Learning Backfires: Spectral Vulnerability and Defense in Recommendationcited by 6
- 2024Poisoning Attacks and Defenses in Recommender Systems: A Surveycited by 5
- 2024Uplift Modeling for Target User Attacks on Recommender Systemscited by 2
- 2024Towards Robust Recommendation: A Review and an Adversarial Robustness Evaluation Librarycited by 2
- 2024Improving the Shortest Plank: Vulnerability-Aware Adversarial Training for Robust Recommender Systemcited by 2
- 2024Understanding and Improving Adversarial Collaborative Filtering for Robust Recommendationcited by 2
- 2025Diversity-aware Dual-promotion Poisoning Attack on Sequential Recommendationcited by 2
Built on by
Not cited yet.