Adversarial Prompts for Acceptance Collapse in Speculative Decoding
It reveals a critical operational vulnerability in lossless acceleration schemes like speculative decoding, which are widely used for inference speedups.
This paper introduces ADSD, the first prompt-suffix attack that collapses verifier acceptance in speculative decoding, increasing mean sample time by 62.3% on GSM8K while preserving task quality.
Lossless acceleration schemes, such as speculative decoding, promise significant inference speedups by relying on dynamic token-level alignment between a draft and a target model. However, this guarantee of semantic equivalence masks a severe operational vulnerability: draft-target alignment can be systematically attacked. In this paper, we introduce ADSD, which, to the best of our knowledge, is the first prompt-suffix attack that collapses verifier acceptance by pushing draft probability mass toward tokens the target is unlikely to accept. ADSD uses Soft-Collapse, a verifier-aligned surrogate derived from the asymmetric speculative acceptance rule, together with a target-preservation objective that discourages obvious task corruption. ADSD successfully generates highly effective adversarial suffixes. On the GSM8K dataset, our attack increases the mean sample time by 62.3% while preserving the task quality. We further show that this vulnerability exists across different domains, speculative decoding strategies, and model architectures.