EACL2027
SALSA: Sampling Adversarial Suffixes from Learned Distributions for LLM Safety Assessment
Findings of the Association for Computational Linguistics: EACL 2027 · to appear
* Equal contribution
Fast sampling of adversarial suffixes from learned distributions for LLM safety assessment
Large language models (LLMs) remain vulnerable to jailbreak attacks, where adversaries append optimized suffixes to otherwise benign looking prompts to bypass safety alignment. Existing optimization-based GCG-style attacks can be effective, but they are expensive at inference time, and suffer from poor transfer. We present, SALSA, a generative framework that learns a distribution over jailbreak suffixes from optimization-derived attack corpora. Once trained, the model supports efficient sampling-based attacks. On open-source targets, it achieves attack success rates comparable to state-of-the-art optimization baselines, while reducing generation time from 3.46s to 0.04s per prompt. In black-box transfer, it remains highly effective against proprietary systems, including 99% ASR on GPT-3.5-Turbo, and reaches 45% ASR on the substantially harder GPT-4o, more than doubling the strongest baseline at an equal sampling budget. We further provide a theoretical motivation for why generative sampling can preserve high attack success, when the learned suffix distribution is close to the distribution of optimization outputs. Overall, our results show that learning adversarial suffix distributions yields a scalable, and practically efficient foundation for continuous LLM vulnerability discovery.
@inproceedings{rajput2027salsa,
title = {{SALSA: Sampling Adversarial Suffixes from Learned Distributions for LLM Safety Assessment}},
author = {Shivank Rajput and Himanshu Singh and A V Subramanyam},
booktitle = {Findings of the Association for Computational Linguistics: EACL 2027},
month = mar,
year = {2027}
}
A V Subramanyam
Himanshu Singh
Rameshwar Mishra
Nilanjana Chatterjee
Ayaan Haider



