MCTSBug: Generating Adversarial Text Sequences via Monte Carlo Tree Search and Homoglyph AttackDownload PDF

Sep 27, 2018 (edited Nov 16, 2018)ICLR 2019 Conference Withdrawn SubmissionReaders: Everyone
  • Abstract: Crafting adversarial examples on discrete inputs like text sequences is fundamentally different from generating such examples for continuous inputs like images. This paper tries to answer the question: under a black-box setting, can we create adversarial examples automatically to effectively fool deep learning classifiers on texts by making imperceptible changes? Our answer is a firm yes. Previous efforts mostly replied on using gradient evidence, and they are less effective either due to finding the nearest neighbor word (wrt meaning) automatically is difficult or relying heavily on hand-crafted linguistic rules. We, instead, use Monte Carlo tree search (MCTS) for finding the most important few words to perturb and perform homoglyph attack by replacing one character in each selected word with a symbol of identical shape. Our novel algorithm, we call MCTSBug, is black-box and extremely effective at the same time. Our experimental results indicate that MCTSBug can fool deep learning classifiers at the success rates of 95% on seven large-scale benchmark datasets, by perturbing only a few characters. Surprisingly, MCTSBug, without relying on gradient information at all, is more effective than the gradient-based white-box baseline. Thanks to the nature of homoglyph attack, the generated adversarial perturbations are almost imperceptible to human eyes.
  • Keywords: Adversarial sample, Text, Black-box, MCTS, Homoglyph
  • TL;DR: Use Monte carlo Tree Search and Homoglyphs to generate indistinguishable adversarial samples on text data
4 Replies