BinarySelect locates influential tokens with about log2(n)*2 queries instead of n, trading a modest drop in attack effectiveness for large query savings in black-box text attacks.
In Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Vol- ume 1: Long Papers) , pages 7424–7438, Dublin, Ireland
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
BinarySelect to Improve Accessibility of Black-Box Attack Research
BinarySelect locates influential tokens with about log2(n)*2 queries instead of n, trading a modest drop in attack effectiveness for large query savings in black-box text attacks.