Static prediction games for adversarial learning problems

Journal of Machine Learning Research

Volumn 13, Issue , 2012, Pages 2617-2654

  Brückner, Michael ^a   Kanzow, Christian ^b   Scheffer, Tobias ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

^b UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

Adversarial classification; Nash equilibrium; Static prediction games

Indexed keywords

ADVERSARIAL LEARNING; E-MAIL SPAM; EMAIL SERVICE PROVIDERS; HIGH RATE; LOGISTIC REGRESSIONS; NASH EQUILIBRIA; PREDICTION MODEL; PREDICTIVE MODELS; SPAM FILTER; STANDARD ASSUMPTIONS; STATIC GAMES; STATIC PREDICTION GAMES; TEST DATA;

ELECTRONIC MAIL; GAME THEORY; INTERNET; LOGISTICS;

FORECASTING;

EID: 84869200775     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. Tamer Basar and Geert J. Olsder. Dynamic Noncooperative Game Theory. Society for Industrial and Applied Mathematics, 1999.
2. Stephen Boyd and Lieven Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
3. Michael Br ückner and Tobias Scheffer. Nash equilibria of static prediction games. In Advances in Neural Information Processing Systems. MIT Press, 2009.
4. Michael Br ückner and Tobias Scheffer. Stackelberg games for adversarial prediction problems. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), San Diego, CA, USA. ACM, 2011.
5. Ofer Dekel and Ohad Shamir. Learning to classify with missing and corrupted features. In Proceedings of the International Conference on Machine Learning. ACM, 2008.
6. Ofer Dekel, Ohad Shamir, and Lin Xiao. Learning to classify with missing and corrupted features. Machine Learning, 81(2):149-178, 2010.
7. Carl Geiger and Christian Kanzow. Theorie und Numerik restringierter Optimierungsaufgaben. Springer, 1999.
8. Laurent El Ghaoui, Gert R. G. Lanckriet, and Georges Natsoulis. Robust classification with interval data. Technical Report UCB/CSD-03-1279, EECS Department, University of California, Berkeley, 2003.
9. Amir Globerson and Sam T. Roweis. Nightmare at test time: Robust learning by feature deletion. In Proceedings of the International Conference on Machine Learning. ACM, 2006.
10. Amir Globerson, Choon Hui Teo, Alex J. Smola, and Sam T. Roweis. An adversarial view of covariate shift and a minimax approach. In Dataset Shift in Machine Learning, pages 179-198. MIT Press, 2009.
11. Patrick T. Harker and Jong-Shi Pang. Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications. Mathematical Programming, 48(2):161-220, 1990.
12. Roger A. Horn and Charles R. Johnson. Topics in Matrix Analysis. Cambridge University Press, Cambridge, 1991.
13. James T. Kwok and Ivor W. Tsang. The pre-image problem in kernel methods. In Proceedings of International Conference on Machine Learning, pages 408-415. AAAI Press, 2003. ISBN 1-57735-189-4.
14. Gert R. G. Lanckriet, Laurent El Ghaoui, Chiranjib Bhattacharyya, and Michael I. Jordan. A robust minimax approach to classification. Journal of Machine Learning Research, 3:555-582, 2002.
15. Sebastian Mika, Bernhard Schölkopf, Alex J. Smola, Klaus-Robert Müller, Matthias Scholz, and Gunnar Rätsch. Kernel PCA and de-noising in feature spaces. In Advances in Neural Information Processing Systems. MIT Press, 1999.
16. J. Ben Rosen. Existence and uniqueness of equilibrium points for concave n-person games. Econometrica, 33(3):520-534, 1965.
17. Bernhard Schölkopf and Alex J. Smola. Learning with Kernels. The MIT Press, Cambridge, MA, 2002.
18. Bernhard Schölkopf, Ralf Herbrich, and Alex J. Smola. A generalized representer theorem. In COLT: Proceedings of the Workshop on Computational Learning Theory, Morgan Kaufmann Publishers, 2001.
19. Christian Siefkes, Fidelis Assis, Shalendra Chhabra, andWilliam S. Yerazunis. CombiningWinnow and orthogonal sparse bigrams for incremental spam filtering. In Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD), volume 3202 of Lecture Notes in Artificial Intelligence, pages 410-421. Springer, 2004. (Pubitemid 39740421)
20. Choon Hui Teo, Amir Globerson, Sam T. Roweis, and Alex J. Smola. Convex learning with invariances. In Advances in Neural Information Processing Systems. MIT Press, 2007.
21. Anna von Heusinger and Christian Kanzow. Relaxation methods for generalized Nash equilibrium problems with inexact line search. Journal of Optimization Theory and Applications, 143(1): 159-183, 2009.