When Models Know but Can't Linearly Say: Relational Encoding Limits Linear Vulnerability Classification in Code LLMs
Organizations: Carnegie Mellon University, Pittsburgh, PA, USA · Faculty of Engineering, University of Porto, Portugal
Abstract
Large language models can detect vulnerable code, yet the form of vulnerability encoding in their representations remains unclear. We analyze 8 code models spanning 6.7B-15B parameters on C programs using three datasets (DELTASECOMMITS, SVEN, and PRECISE-BUGS), comparing two diagnostic tasks on the same representations: identifying what patterns the code instantiates, and determining whether it is vulnerable. Models encode the first with high fidelity. Under the studied paired C-code datasets and linear-probing setup, vulnerability information is more accessible as a paired relational signal-whether code A is riskier than code B-than as a globally separable categorical label. This structural difference has implications for classification: the model reliably ranks which code is riskier but standard classifiers on isolated samples achieve limited accuracy because vulnerable and secure samples form overlapping distributions in representation space.
Figures & tables
| Model | L3 | L7 | L11 | L15 | L19 | L23 | L27 |
|---|---|---|---|---|---|---|---|
| CodeLlama-7B-Instruct | |||||||
| CodeLlama-13B-Instruct | |||||||
| DeepSeek-Coder-6.7B-Instruct | |||||||
| Qwen2.5-7B-Instruct | |||||||
| Qwen2.5-Coder-7B-Instruct | |||||||
| Qwen2.5-14B-Instruct |
LLMs for Cybersecurity
Large language models for cybersecurity support threat analysis, vulnerability research, security operations, and cyber defense.
See all 255 papers