Speculative Probing: LLM Monitoring at Speculative-Decoding Cost

Abstract

Real-time classification during language model inference is valuable for safety filtering, behavioral analysis, and model monitoring, but current approaches force a trade-off between accuracy and efficiency. Hidden-state probes are fast but limited: they are either not context-aware, operating on a single vector and unable to model interactions across positions, or they are very costly, requiring dedicated classifier models (Llama Guard, Qwen Guard, LLM-as-judge) or computation on hidden states for all tokens followed by pooling of the results (MultiMax). This shows an intrinsic trade-off between efficiency and accuracy.

However, we find that the speculative-decoding module in recent LLMs can be repurposed for efficient, high-quality classification. By appending a trained soft prompt at the end of the target sequence, we can repurpose the speculative-decoding module into a sequence classifier. At inference time in a speculative-decoding pipeline, the KV cache is already in GPU memory, so classification adds negligible overhead.

We evaluate on four classification tasks across four models (Qwen3.5-4B, 9B, 27B, MiniCPM4.1-8B). Our small probes consistently outperform zero-shot GPT-5.4-mini and, on multilingual prompt safety, match or beat specialized 8B safety classifiers (Qwen3Guard-Gen-8B, Llama-Guard-3-8B) without running a full LLM.

Publication
Preprint, 2026