arXiv:2510.03254cs.LGcs.CR2025-10

约束对抗者行为,让模型更贴近真实攻击场景。

Adversarial training with restricted data manipulation

  • 构建受约束的悲观双层优化模型,限制对抗者修改数据的范围。
  • 实验表明该方法平均性能优于现有无约束方法。
  • 适合需要应对现实攻击的安防类应用开发者参考。

对抗机器学习关注学习者面对主动攻击者的情形,这类场景常见于垃圾邮件过滤、恶意软件检测和虚假图像生成等应用,安全方法需持续更新以应对不断升级的恶意数据生成。悲观双层优化已被证明是训练抗攻击分类器的有效方法,通过将场景建模为学习者与攻击者之间的博弈,预测攻击者如何修改数据,并据此训练鲁棒分类器。然而,现有悲观双层方法假设攻击者可任意修改数据,导致模型过于悲观且不切实际:在寻找击败分类器的最优攻击时,数据可能变得荒谬而失去原本意义。此类攻击无法反映真实情况,进而导致模型在真实数据上表现不佳。本文提出一种受约束的悲观双层优化模型,对攻击者的操作施加合理限制,找到更符合现实的解决方案。实验表明,该方法在平均性能上优于现有方法。

原文摘要 · Abstract (English)

Adversarial machine learning concerns situations in which learners face attacks from active adversaries. Such scenarios arise in applications such as spam email filtering, malware detection and fake image generation, where security methods must be actively updated to keep up with the everimproving generation of malicious data. Pessimistic Bilevel optimisation has been shown to be an effective method of training resilient classifiers against such adversaries. By modelling these scenarios as a game between the learner and the adversary, we anticipate how the adversary will modify their data and then train a resilient classifier accordingly. However, since existing pessimistic bilevel approaches feature an unrestricted adversary, the model is vulnerable to becoming overly pessimistic and unrealistic. When finding the optimal solution that defeats the classifier, it is possible that the adversary's data becomes nonsensical and loses its intended nature. Such an adversary will not properly reflect reality, and consequently, will lead to poor classifier performance when implemented on real-world data. By constructing a constrained pessimistic bilevel optimisation model, we restrict the adversary's movements and identify a solution that better reflects reality. We demonstrate through experiments that this model performs, on average, better than the existing approach.

对抗训练双层优化安全防御

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。