Automated adversarial red-teaming for evaluating robustness in LLM-based recommender systems.

Discover artificial intelligence Pub Date : 2026-01-01 Epub Date: 2026-06-03 DOI:10.1007/s44163-026-01546-z
Sarama Shehmir, Rasha Kashef
{"title":"Automated adversarial red-teaming for evaluating robustness in LLM-based recommender systems.","authors":"Sarama Shehmir, Rasha Kashef","doi":"10.1007/s44163-026-01546-z","DOIUrl":null,"url":null,"abstract":"<p><p>Robustness testing for large language model based recommender systems (LLM4Rec) typically relies on a handful of handwritten attack prompts drawn from one injection pattern at a single perturbation rate. These narrow test suites miss most of the attack surface and paint an overly optimistic picture of system security. We introduce an automated red teaming framework that replaces static templates with an adaptive loop. An attacker model generates diverse adversarial prompts across sixteen attack categories; a judge then scores each one using ranking distortion metrics. Successful attacks are fed back into the defense for iterative hardening. We run the framework against RoLLMRec on MovieLens, Amazon Books, and Yelp. The loop exposes attack success rates of 42.4%, 48.1%, and 52.0% on the three benchmarks, well above static, paraphrase, and PAIR-style baselines. After the hardening cycle, vulnerability drops by 56.4%, 74.3%, and 68.8% while false positive rates stay at or below 0.6%; module ablations indicate the four defense components combine super-additively, with the prompt shield contributing the largest single share. The full attack corpus is publicly available to support reproducible adversarial benchmarking in LLM4Rec.</p>","PeriodicalId":520312,"journal":{"name":"Discover artificial intelligence","volume":"6 1","pages":"759"},"PeriodicalIF":0.0000,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13447462/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discover artificial intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s44163-026-01546-z","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/6/3 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Robustness testing for large language model based recommender systems (LLM4Rec) typically relies on a handful of handwritten attack prompts drawn from one injection pattern at a single perturbation rate. These narrow test suites miss most of the attack surface and paint an overly optimistic picture of system security. We introduce an automated red teaming framework that replaces static templates with an adaptive loop. An attacker model generates diverse adversarial prompts across sixteen attack categories; a judge then scores each one using ranking distortion metrics. Successful attacks are fed back into the defense for iterative hardening. We run the framework against RoLLMRec on MovieLens, Amazon Books, and Yelp. The loop exposes attack success rates of 42.4%, 48.1%, and 52.0% on the three benchmarks, well above static, paraphrase, and PAIR-style baselines. After the hardening cycle, vulnerability drops by 56.4%, 74.3%, and 68.8% while false positive rates stay at or below 0.6%; module ablations indicate the four defense components combine super-additively, with the prompt shield contributing the largest single share. The full attack corpus is publicly available to support reproducible adversarial benchmarking in LLM4Rec.

在基于法学硕士的推荐系统中评估稳健性的自动对抗红队。
基于大型语言模型的推荐系统(LLM4Rec)的鲁棒性测试通常依赖于以单一扰动率从一个注入模式中提取的少量手写攻击提示。这些狭窄的测试套件错过了大多数攻击面,并描绘了一幅过于乐观的系统安全图景。我们引入了一个自动化的红队框架,它用一个自适应循环取代了静态模板。攻击者模型在16种攻击类别中生成不同的对抗性提示;然后,法官使用排名扭曲指标对每个人进行评分。成功的攻击被反馈到防御中进行迭代强化。我们对MovieLens、Amazon Books和Yelp上的RoLLMRec运行这个框架。在三个基准测试中,循环暴露的攻击成功率分别为42.4%、48.1%和52.0%,远高于静态、释义和pair风格的基线。经过强化周期后,脆弱性分别下降56.4%、74.3%和68.8%,假阳性率保持在0.6%以下;模块烧蚀表明,四个防御组件组合超加和,提示盾贡献最大的单一份额。完整的攻击语料库是公开的,可以在LLM4Rec中支持可重复的对抗性基准测试。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信
小红书