<p>Adversarial text attack research is crucial for evaluating NLP model robustness and addressing privacy concerns. However, the increasing complexity of transformer and pretrained</p>
<p>language models has led to significant time and resource requirements for training and testing. This challenge is particularly pronounced in black-box attacks, where hundreds</p>
<p>or thousands of queries may be needed to identify critical words leveraged by the target model. To overcome this, we introduce BinarySelect, a novel method combining binary search</p>
<p>with adversarial attack techniques to reduce query numbers significantly while maintaining attack effectiveness. Our experiments show that BinarySelect requires far fewer queries than traditional methods, making adversarial attack research more accessible to researchers with limited resources. We demonstrate the efficacy of BinarySelect across multiple datasets and classifiers, showcasing its potential for efficient adversarial attack exploration and addressing related black-box challenges.</p>
| Identifer | oai:union.ndltd.org:purdue.edu/oai:figshare.com:article/25687323 |
| Date | 28 April 2024 |
| Creators | Shatarupa Ghosh (18438924) |
| Source Sets | Purdue University |
| Detected Language | English |
| Type | Text, Thesis |
| Rights | CC BY 4.0 |
| Relation | https://figshare.com/articles/thesis/Enhancing_Accessibility_in_Black-Box_Attack_Research_with_BinarySelect_pdf/25687323 |
Page generated in 0.0022 seconds