@inproceedings{
hu2024efficient,
title={Efficient {LLM} Jailbreak via Adaptive Dense-to-sparse Constrained Optimization},
author={Kai Hu and Weichen Yu and Yining Li and Tianjun Yao and Xiang Li and Wenhe Liu and Lijun Yu and Zhiqiang Shen and Kai Chen and Matt Fredrikson},
booktitle={The Thirty-eighth Annual Conference on Neural Information Processing Systems},
year={2024},
url={https://openreview.net/forum?id=bN5PA3HHo8}
}
Recent research indicates that large language models (LLMs) are susceptible to jailbreaking attacks that can generate harmful content. This paper introduces a novel token-level attack method, Adaptive Dense-to-Sparse Constrained Optimization (ADC), which has been shown to successfully jailbreak multiple open-source LLMs. Drawing inspiration from the difficulties of discrete token optimization, our method relaxes the discrete jailbreak optimization into a continuous optimization process while gradually increasing the sparsity of the optimizing vectors. This technique effectively bridges the gap between discrete and continuous space optimization. Experimental results demonstrate that our method is more effective and efficient than state-of-the-art token-level methods. On Harmbench, our approach achieves the highest attack success rate on seven out of eight LLMs compared to the latest jailbreak methods. \textcolor{red}{Trigger Warning: This paper contains model behavior that can be offensive in nature.}
Efficient LLM Jailbreak via Adaptive Dense-to-sparse Constrained Optimization
Kai Hu Weichen Yu Yining Li Tianjun Yao Xiang Li Wenhe Liu Lijun Yu Zhiqiang Shen Kai Chen Matt Fredrikson