Adversaries With Incentives: A Strategic Alternative to Adversarial Robustness
Not on the map. Why?
Abstract (arXiv)
Adversarial training aims to defend against adversaries: malicious opponents whose sole aim is to harm predictive performance in any way possible. This presents a rather harsh perspective, which we assert results in unnecessarily conservative training. As an alternative, we propose to model opponents as simply pursuing their own goals--rather than working directly against the classifier. Employing tools from strategic modeling, our approach enables knowledge or beliefs regarding the opponent's possible incentives to be used as inductive bias for learning. Accordingly, our method of strategic training is designed to defend against all opponents within an 'incentive uncertainty set'. This resorts to adversarial learning when the set is maximal, but offers potential gains when the set can be appropriately reduced. We conduct a series of experiments that show how even mild knowledge regarding the opponent's incentives can be useful, and that the degree of potential gains depends on how these incentives relate to the structure of the learning task.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 32 of its 48 references that are in the map. First posted on arXiv 17 Jun 2024.
Builds on
32 of 48 references.
References · 32
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2013Intriguing properties of neural networkscited by 5,114
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
- 2018Robustness May Be at Odds with Accuracycited by 873
- 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 334
- 2018Adversarially Robust Generalization Requires More Datacited by 318
- 2021Unsolved Problems in ML Safetycited by 291
20 more
- 2021Recent Advances in Adversarial Training for Adversarial Robustnesscited by 276
- 2015Strategic Classificationcited by 256
- 2017Strategic Classification from Revealed Preferencescited by 126
- 2020Adversarial Machine Learning -- Industry Perspectivescited by 121
- 2018The Social Cost of Strategic Classificationcited by 105
- 2019Strategic Classification is Causal Modeling in Disguisecited by 92
- 2019Adversarially Robust Generalization Just Requires More Unlabeled Datacited by 75
- 2021Strategic Classification in the Darkcited by 66
- 2021Strategic Classification Made Practicalcited by 58
- 2020PAC-Learning for Strategic Classificationcited by 50
- 2021Information Discrepancy in Strategic Learningcited by 48
- 2021Alternative Microfoundations for Strategic Classificationcited by 47
- 2022Anticipating Performativity by Predicting from Predictionscited by 37
- 2022Probabilistically Robust Learning: Balancing Average- and Worst-case Performancecited by 36
- 2022Generalized Strategic Classification and the Case of Aligned Incentivescited by 34
- 2023Causal Strategic Classification: A Tale of Two Shiftscited by 30
- 2022Learning Losses for Strategic Classificationcited by 22
- 2021Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Updatecited by 20
- 2020Linear Classifiers that Encourage Constructive Adaptationcited by 16
- 2023One-Shot Strategic Classification Under Unknown Costscited by 13
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.