Query strategies for evading convex-inducing classifiers

Journal of Machine Learning Research

Volumn 13, Issue , 2012, Pages 1293-1332

  Nelson, Blaine ^a   Rubinstein, Benjamin I P ^b   Huang, Ling ^c   Joseph, Anthony D ^d   Lee, Steven J ^d   Rao, Satish ^d   Tygar, J D ^d  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b MICROSOFT RESEARCH   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Adversarial learning; Evasion; Query algorithms; Reverse engineering

Indexed keywords

ADVERSARIAL LEARNING; DECISION BOUNDARY; EVASION; FEATURE SPACE; MINIMAL COST; QUERY ALGORITHMS; QUERY STRATEGIES;

COSTS; QUERY PROCESSING; REVERSE ENGINEERING; SEARCH ENGINES;

APPROXIMATION ALGORITHMS;

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

References (34)

1. Dana Angluin. Queries and concept learning. Machine Learning, 2:319-342, 1988.
2. Keith Ball. An elementary introduction to modern convex geometry. In Flavors of Geometry, volume 31 of MSRIPublications, pages 1-58. Cambridge University Press, 1997.
3. Dimitris Bertsimas and Santosh Vempala. Solving convex programs by random walks. Journal of the ACM, 51(4):540-556, 2004.
4. Christopher M. Bishop. Pattern Recognition and Machine Learning. Springer, 2006.
5. Stephen Boyd and Lieven Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
6. Richard P. Brent. Algorithms for Minimization without Derivatives. Prentice-Hall, 1973.
7. Michael Brückner and Tobias Scheffer. Nash equilibria of static prediction games. In Advances in Neural Information Processing Systems (NIPS), volume 22, pages 171-179. 2009.
8. th edition, 2000.
9. th International Conference on Knowledge Discovery and Data Mining, pages 99-108, 2004. (Pubitemid 40114920)
10. Sanjoy Dasgupta, Adam Tauman Kalai, and Claire Monteleoni. Analysis of perceptron-based active learning. Journal of Machine Learning Research, 10:281-299, 2009.
11. Vitaly Feldman. On the power of membership queries in agnostic learning. Journal of Machine Learning Research, 10:163-182, 2009.
12. Jörg Flum and Martin Grohe. Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Secaucus, NJ, USA, 2006.
13. Lee-Ad Gottlieb, Aryeh Kontorovich, and Elchanan Mossel. VC bounds on the cardinality of nearly orthogonal function classes. Technical Report arXiv: 1007.4915v2 [math. CO], arXiv, 2011.
14. Donald R. Jones. A taxonomy of global optimization methods based on response surfaces. Journal of Global Optimization, 21(4):345-383, 2001. (Pubitemid 33672374)
15. Donald R. Jones, Cary D. Perttunen, and Bruce E. Stuckman. Lipschitzian optimization without the Lipschitz constant. Journal Optimization Theory and Application, 79(1):157-181, 1993.
16. Murat Kantarcioglu, Bowei Xi, and Chris Clifton. Classifier evaluation and attribute selection against active adversaries. Technical Report 09-01, Purdue University, 2009.
17. Tamara G. Kolda, Robert Michael Lewis, and Virginia Torczon. Optimization by direct search: New perspectives on some classical and modern methods. SIAMReview, 45(3):385-482, 2003.
18. Anukool Lakhina, Mark Crovella, and Christophe Diot. Diagnosing network-wide traffic anomalies. In Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pages 219-230, 2004. (Pubitemid 40954882)
19. th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03), pages 650-659, 2003.
20. th Annual ACM Symposium on Theory of Computing (STOC), pages 310-314, 2004.
21. th International Conference on Knowledge Discovery in Data Mining, pages 641-647, 2005. (Pubitemid 43218333)
22. John A. Nelder and Roger Mead. A simplex method for function minimization. The Computer Journal, 7(4):308-313, 1965.
23. th International Conference on Artificial Intelligence and Statistics (AISTATS), pages 549-556, 2010a.
24. Blaine Nelson, Benjamin I. P. Rubinstein, Ling Huang, Anthony D. Joseph, Steven Lee, Satish Rao, and J. D. Tygar. Query strategies for evading convex-inducing classifiers. Technical Report arXiv:1007.0484vl [cs. LG], arXiv, 2010b.
25. Blaine Nelson, Benjamin I. P. Rubinstein, Ling Huang, Anthony D. Joseph, and J. D. Tygar. Classifier evasion: Models and open problems. In Privacy and Security Issues in Data Mining and Machine Learning, volume 6549 of Lecture Notes in Computer Science, pages 92-98. 2011.
26. nd Annual Conference on Learning Theory (COLT), pages 303-308, 2009.
27. th International Conference on Machine Learning (ICML), pages 839-846, 2000.
28. Burr Settles. Active learning literature survey. Computer Sciences Technical Report 1648, University of Wisconsin-Madison, 2009.
29. th Conference on Winter Simulation (WSC'96), pages 260-264, 1996.
30. th International Conference on Recent Advances in Intrusion Detection (RAID), volume 2516 of Lecture Notes in Computer Science, pages 54-73, 2002.
31. th ACM Conference on Computer and Communications Security, pages 255-264, 2002.
32. th International Conference on Recent Advances in Intrusion Detection (RAID), volume 3224 of Lecture Notes in Computer Science, pages 203-222, 2004. (Pubitemid 39741895)
33. th International Conference on Recent Advances in Intrusion Detection (RAID), volume 4219 of Lecture Notes in Computer Science, pages 226-248, 2006. (Pubitemid 44617855)
34. Aaron D. Wyner. Capabilities of bounded discrepancy decoding. The Bell System Technical Journal, 44:1061-1122, 1965.