Distillability of LLM Security Logic: Predicting Attack Success Rate of Outline Filling Attack via Ranking Regression
Tianyu Zhang, Zihang Xi, Jingyu Hua, Sheng Zhong
TL;DR
<3-5 sentence high-level summary> This work investigates whether a lightweight Narrow Safety Proxy can predict LLM jailbreak outcomes in a black-box setting. It introduces the Outline Filling Attack to generate dense samples of security boundaries and a Ranking Regression framework to handle ASR domain shift, culminating in a global scoring method for attack optimization. The results show that ASR and ALR are largely predictable across multiple LLMs, that ranking regression achieves strong ordinal accuracy and generalizes to unseen prompts, and that proxy-guided scoring substantially reduces the cost of first successful jailbreaks. These findings highlight the distillability of LLM safety mechanisms and have implications for both advancing defensive research and informing attack-aware safety design.
Abstract
In the realm of black-box jailbreak attacks on large language models (LLMs), the feasibility of constructing a narrow safety proxy, a lightweight model designed to predict the attack success rate (ASR) of adversarial prompts, remains underexplored. This work investigates the distillability of an LLM's core security logic. We propose a novel framework that incorporates an improved outline filling attack to achieve dense sampling of the model's security boundaries. Furthermore, we introduce a ranking regression paradigm that replaces standard regression and trains the proxy model to predict which prompt yields a higher ASR. Experimental results show that our proxy model achieves an accuracy of 91.1 percent in predicting the relative ranking of average long response (ALR), and 69.2 percent in predicting ASR. These findings confirm the predictability and distillability of jailbreak behaviors, and demonstrate the potential of leveraging such distillability to optimize black-box attacks.
