Stackelberg games for adversarial prediction problems

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2011, Pages 547-555

  Brückner, Michael ^a   Scheffer, Tobias ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

Adversarial classification; Prediction game; Spam filtering; Stackelberg competition

Indexed keywords

ELECTRONIC MAIL;

ADVERSARIAL CLASSIFICATIONS; E-MAIL (SPAM); PREDICTION GAME; PREDICTION PROBLEM; SPAM FILTERING; STACKELBERG; STACKELBERG COMPETITION; STACKELBERG GAMES; STANDARD ASSUMPTIONS; TEST DATA;

FORECASTING;

EID: 80052662603     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.2020495     Document Type: Conference Paper

References (16)

1. M. Brückner and T. Scheffer. Nash equilibria of static prediction games. In Advances in Neural Information Processing Systems. MIT Press, 2009.
2. B. Colson, P. Marcotte, and G. Savard. An overview of bilevel optimization. Annals of Operations Research, 153(1):235-256, 2007.
3. O. Dekel and O. Shamir. Learning to classify with missing and corrupted features. In Proceedings of the International Conference on Machine Learning, pages 216-223. ACM, 2008.
4. O. Dekel, O. Shamir, and L. Xiao. Learning to classify with missing and corrupted features. Machine Learning, 81(2):149-178, 2010.
5. L. E. Ghaoui, G. R. G. Lanckriet, and G. Natsoulis. Robust classification with interval data. Technical Report UCB/CSD-03-1279, EECS Department, University of California, Berkeley, 2003.
6. A. Globerson and S. T. Roweis. Nightmare at test time: robust learning by feature deletion. In Proceedings of the International Conference on Machine Learning. ACM, 2006.
7. A. Globerson, C. H. Teo, A. J. Smola, and S. T. Roweis. Dataset Shift in Machine Learning, chapter An adversarial view of covariate shift and a minimax approach, pages 179-198. MIT Press, 2009.
8. R. Jeroslow. The polynomial hierarchy and a simple model for competitive analysis. Mathematical Programming, 32:146-164, 1985. (Pubitemid 15530689)
9. M. Kantarcioglu, B. Xi, and C. Clifton. Classifier evaluation and attribute selection against active adversaries. Data Mining and Knowledge Discovery, 22(1-2):291-335, 2011.
10. G. R. G. Lanckriet, L. E. Ghaoui, C. Bhattacharyya, and M. I. Jordan. A robust minimax approach to classification. Journal of Machine Learning Research, 3:555-582, 2002.
11. Y. Li and J. Shawe-Taylor. The SVM with uneven margins and chinese document categorization. In Proceedings of the Pacific Asia Conference on Language, Information and Computation, pages 216-227, 2003.
12. W. Liu and S. Chawla. A game theoretical model for adversarial learning. In ICDM Workshops, pages 25-30. IEEE Computer Society, 2009.
13. B. Schölkopf, R. Herbrich, and A. J. Smola. A generalized representer theorem. In COLT: Proceedings of the Workshop on Computational Learning Theory, Morgan Kaufmann Publishers, 2001.
14. C. H. Teo, A. Globerson, S. T. Roweis, and A. J. Smola. Convex learning with invariances. In Advances in Neural Information Processing Systems. MIT Press, 2007.
15. S. Veelken. A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints: Theory an Numerical Experience. PhD thesis, Technische Universität München, 2009.
16. A. Wächter and L. T. Biegler. On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Mathematical Programming, 106:25-57, 2006. (Pubitemid 41813168)