jmlr jmlr2012 jmlr2012-110 jmlr2012-110-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Michael Brückner, Christian Kanzow, Tobias Scheffer
Abstract: The standard assumption of identically distributed training and test data is violated when the test data are generated in response to the presence of a predictive model. This becomes apparent, for example, in the context of email spam filtering. Here, email service providers employ spam filters, and spam senders engineer campaign templates to achieve a high rate of successful deliveries despite the filters. We model the interaction between the learner and the data generator as a static game in which the cost functions of the learner and the data generator are not necessarily antagonistic. We identify conditions under which this prediction game has a unique Nash equilibrium and derive algorithms that find the equilibrial prediction model. We derive two instances, the Nash logistic regression and the Nash support vector machine, and empirically explore their properties in a case study on email spam filtering. Keywords: static prediction games, adversarial classification, Nash equilibrium
Tamer Basar and Geert J. Olsder. Dynamic Noncooperative Game Theory. Society for Industrial and Applied Mathematics, 1999. Stephen Boyd and Lieven Vandenberghe. Convex Optimization. Cambridge University Press, 2004. Michael Br¨ ckner and Tobias Scheffer. Nash equilibria of static prediction games. In Advances in u Neural Information Processing Systems. MIT Press, 2009. Michael Br¨ ckner and Tobias Scheffer. Stackelberg games for adversarial prediction problems. In u Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), San Diego, CA, USA. ACM, 2011. Ofer Dekel and Ohad Shamir. Learning to classify with missing and corrupted features. In Proceedings of the International Conference on Machine Learning. ACM, 2008. Ofer Dekel, Ohad Shamir, and Lin Xiao. Learning to classify with missing and corrupted features. Machine Learning, 81(2):149–178, 2010. Carl Geiger and Christian Kanzow. Theorie und Numerik restringierter Optimierungsaufgaben. Springer, 1999. 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. 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. 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. 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. Roger A. Horn and Charles R. Johnson. Topics in Matrix Analysis. Cambridge University Press, Cambridge, 1991. 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. 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. Sebastian Mika, Bernhard Sch¨ lkopf, Alex J. Smola, Klaus-Robert M¨ ller, Matthias Scholz, and o u Gunnar R¨ tsch. Kernel PCA and de–noising in feature spaces. In Advances in Neural Information a Processing Systems. MIT Press, 1999. 2653 ¨ B R UCKNER , K ANZOW, AND S CHEFFER J. Ben Rosen. Existence and uniqueness of equilibrium points for concave n-person games. Econometrica, 33(3):520–534, 1965. Bernhard Sch¨ lkopf and Alex J. Smola. Learning with Kernels. The MIT Press, Cambridge, MA, o 2002. Bernhard Sch¨ lkopf, Ralf Herbrich, and Alex J. Smola. A generalized representer theorem. In o COLT: Proceedings of the Workshop on Computational Learning Theory, Morgan Kaufmann Publishers, 2001. Christian Siefkes, Fidelis Assis, Shalendra Chhabra, and William S. Yerazunis. Combining Winnow 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. 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. 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. 2654