The DOI matches its Crossref record; 18 of the 19 references it cites were found in a registry or an index.
Stackelberg games for adversarial prediction problems
Abstract
The standard assumption of identically distributed training and test data is violated when test data are generated in response to a predictive model. This becomes apparent, for example, in the context of email spam filtering, where an email service provider employs a spam filter and the spam sender can take this filter into account when generating new emails. We model the interaction between learner and data generator as a Stackelberg competition in which the learner plays the role of the leader and the data generator may react on the leader's move. We derive an optimization problem to determine the solution of this game and present several instances of the Stackelberg prediction game. We show that the Stackelberg prediction game generalizes existing prediction models. Finally, we explore properties of the discussed models empirically in the context of email spam filtering.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Evasion attacks can be protected against by devising systems composed of multiple classifiers, as outlined in [137], or other adversary-aware learning algorithms (e.g.one-and-a-halfclass multiple classifiers) as outlined in [135].”
From Operationalising ethics in artificial intelligence for healthcare: a framework for AI developers (2023) · cites this paper as [137]
Citations
Cites
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 15,539
Wächter, A., & Biegler, L. T. (2006) · Mathematical Programming · doi:10.1007/s10107-004-0559-y · Cited by 9,483 · cited 1×
“To solve the nonlinear program of the SPG with logistic loss we use the Ipopt solver [16].”
MethodAdvances in Neural Information Processing Systems 20
Bonilla, E. V., Chai, K. M. A., & Williams, C. K. I. (2008) · neural information processing systems · Cited by 2,846
A Generalized Representer Theorem
Schölkopf, B., Herbrich, R., & Smola, A. J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44581-1_27 · Cited by 1,589 · cited 1×
“Making use of the representer theorem [13], we can now express weight vector w as a linear combination of the mapped training instances; that is,”
MethodDataset Shift in Machine Learning
(2008) · doi:10.7551/mitpress/9780262170055.001.0001 · Cited by 1,553
An overview of bilevel optimization
Colson, B., Marcotte, P., & Savard, G. (2007) · Annals of Operations Research · doi:10.1007/s10479-007-0176-2 · Cited by 1,409 · cited 1×
“Numerous approaches that address bilevel programs have been studied, for instance, based on gradient descent, penalty function, and trust-region methods; see, for instance, [2] for a detailed survey.”
BackgroundThe polynomial hierarchy and a simple model for competitive analysis
Jeroslow, R. G. (1985) · Mathematical Programming · doi:10.1007/bf01586088 · Cited by 425 · cited 2×
“Even the simplest instance in which all constraints and objectives are linear is known to be NP-hard [8].”
BackgroundNightmare at test time: robust learning by feature deletion
Globerson, A., & Roweis, S. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143889 · Cited by 309 · cited 1×
“Similarly, worstcase solutions to classification games in which the adversary deletes input features or performs arbitrary feature transformation have been studied [3, 6, 7, 14, 4].”
Background(2000) · Applied Physics Letters · doi:10.1162/153244303321897726 · Cited by 157
Learning to classify with missing and corrupted features
Dekel, O., Shamir, O., & Xiao, L. (2009) · Machine Learning · doi:10.1007/s10994-009-5124-8 · Cited by 137 · cited 1×
“Similarly, worstcase solutions to classification games in which the adversary deletes input features or performs arbitrary feature transformation have been studied [3, 6, 7, 14, 4].”
Background
Cited by
Evasion attacks against machine learning at test time
Biggio, B., Corona, I., Maiorca, D., Nelson, B. A., Srndic, N., Laskov, P., Giacinto, G., & Roli, F. (2017) · CINECA IRIS Institutial Research Information System (University of Genoa) · Cited by 1,870
Evasion Attacks against Machine Learning at Test Time
Biggio, B., Corona, I., Maiorca, D., Nelson, B., Šrndić, N., Laskov, P., Giacinto, G., & Roli, F. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40994-3_25 · Cited by 890
“Under certain conditions, such problems can be solved using a Nash equilibrium approach [7, 8].”
MethodSoK: Security and Privacy in Machine Learning
Papernot, N., McDaniel, P., Sinha, A., & Wellman, M. P. (2018) · 2018 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2018.00035 · Cited by 502
“ifier) and the adversary responds optimally (choose a least cost evasion). Stackelberg games also allow for scalability compared to the corresponding simultaneous move game [90], [91]. Bruckner et al. [92] first recognized that test data manipulation can be seen in the PAC framework as modifying the distribution D to :…”
BackgroundCertified Defenses for Data Poisoning Attacks
Steinhardt, J., Koh, P. W., & Liang, P. (2017) · arXiv · doi:10.48550/arxiv.1706.03691 · Cited by 479
“Bilevel optimization has been considered in the related setting of Stackelberg games (Brückner and Scheffer, 2011; Brückner et al., 2012; Zhou and Kantarcioglu, 2016), and is natural to apply here as well.”
MethodA Survey on Security Threats and Defensive Techniques of Machine Learning: A Data Driven View
Liu, Q., Li, P., Zhao, W., Cai, W., Yu, S., & Leung, V. C. M. (2018) · IEEE Access · doi:10.1109/access.2018.2805680 · Cited by 421
“[86] M. Brückner, C. Kanzow, and T. Scheffer, ‘‘Static prediction games for adversarial learning problems,’’ J. Mach.”
Method
Metadata
- Authors
- Brückner, M., & Scheffer, T.
- Affiliations
- University of Potsdam (DE)
- ORCID
- Scheffer, Tobias
- Venue
- Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2011-08-21
- Pages
- 547-555
- OpenAlex
- W1966912382
- Cited by
- 229
- References
- 19
- Citations by year
- 2026: 6 · 2025: 9 · 2024: 11 · 2023: 32 · 2022: 9 · 2021: 29 · 2020: 25 · 2019: 16 · 2018: 28 · 2017: 16 · 2016: 21 · 2015: 7 · 2014: 8 · 2013: 6 · 2012: 6
- FWCI
- 4.80
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion)
- Funders
- Deutsche Forschungsgemeinschaft
- Topics
- Physical Sciences › Computer Science › Information Systems › Spam and Phishing Detection
- Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
- Social Sciences › Decision Sciences › Management Science and Operations Research › Game Theory and Applications
- Keywords
- Stackelberg game, email spam detection, game-theoretic optimization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Stackelberg games for adversarial prediction problems. https://app.cochat.ai/papers/10.1145/2020408.2020495
- The paper
- Brückner, M., & Scheffer, T. (2011). Stackelberg games for adversarial prediction problems. Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. https://doi.org/10.1145/2020408.2020495
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.