Abstract
Robust machine learning algorithms have been widely studied in adversarial environments where the adversary maliciously manipulates data samples to evade security systems. In this paper, we propose randomized SVMs against generalized adversarial attacks under uncertainty, through learning a classifier distribution rather than a single classifier in traditional robust SVMs. The randomized SVMs have advantages on better resistance against attacks while preserving high accuracy of classification, especially for non-separable cases. The experimental results demonstrate the effectiveness of our proposed models on defending against various attacks, including aggressive attacks with uncertainty.
Original language | English (US) |
---|---|
Title of host publication | Advances in Knowledge Discovery and Data Mining - 22nd Pacific-Asia Conference, PAKDD 2018, Proceedings |
Editors | Geoffrey I. Webb, Dinh Phung, Mohadeseh Ganji, Lida Rashidi, Vincent S. Tseng, Bao Ho |
Publisher | Springer Verlag |
Pages | 556-568 |
Number of pages | 13 |
ISBN (Print) | 9783319930398 |
DOIs | |
State | Published - 2018 |
Event | 22nd Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2018 - Melbourne, Australia Duration: Jun 3 2018 → Jun 6 2018 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 10939 LNAI |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 22nd Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2018 |
---|---|
Country/Territory | Australia |
City | Melbourne |
Period | 06/3/18 → 06/6/18 |
Bibliographical note
Publisher Copyright:© Springer International Publishing AG, part of Springer Nature 2018.
Keywords
- Adversarial learning
- Randomization
- Robust SVM
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science