A Function-Level Vulnerability Score Measures Flag Rate More Than the Model: Protocol Effects on Paired Benchmarks
cs.LG
Submitted: 2026-09-26
Updated: 2026-09-26
Comments: NeurIPS 2026 Workshop on Trust-AI-Eval (TAE): Can We Trust AI Evaluation? 8 pages plus appendix, 5 figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: Language models are increasingly evaluated as vulnerability detectors, and scores reported for similar models differ widely between papers.
Terminology
Abstract
Language models are increasingly evaluated as vulnerability detectors, and scores reported for similar models differ widely between papers. We measured how much of that difference evaluation protocol accounts for, with model outputs held fixed. In a paired test, a model must flag a vulnerable function and clear its version after a fixing commit. Three choices that published evaluations make differently were varied one at a time: metric, verdict extraction and output budget. Seven frontier and large open models were evaluated on five released pair benchmarks and a set pooled for this work under one protocol, and 61 open models of 1.5B to 36B parameters on the pooled set. Function-level F1 follows how often a model flags both functions of a pair (Spearman +0.86 over 42 combinations) and is nearly unrelated to pair-level correctness (+0.16). On the pair score, extraction changes a model's number by +0.001 at the median and budget by +0.02 with an interval through zero, whereas the model changes a benchmark's number by up to 0.18 and the benchmark a model's by up to 0.16; a function-level score therefore measures flag rate more than model. For 37 of 68 models the difference between correct and reversed pairs is within its 95% interval of zero, the value for a null model that flags each function at a fixed rate, while both-flagged and both-cleared rates exceed that null by 0.055 on median, and for 64 of 68 both functions of a pair receive one answer more often than independence predicts: verdicts are determined by the text common to both functions. On length-matched pairs a linear probe on activations separates 0.78 by within-pair ranking, against 0.64 for a tf-idf baseline and 0.5 for length; the generated verdict is near chance for three of six models and at 0.55 to 0.57 for the other three, and a prompted logit is at chance for all six.
Sources
- Understanding intermediate layers using linear classifier probes
- The Internal State of an LLM Knows When It's Lying
- Probing Classifiers: Promises, Shortcomings, and Advances
- Discovering Latent Knowledge in Language Models Without Supervision
- Deep Learning based Vulnerability Detection: Are We There Yet?
- Data Quality for Software Vulnerability Datasets
- Vulnerability Detection with Code Language Models: How Far Are We?
- Vul-RAG: Enhancing LLM-based Vulnerability Detection via Knowledge-level RAG
- Amnesic Probing: Behavioral Explanation with Amnesic Counterfactuals
- Designing and Interpreting Probes with Control Tasks
- Activation Oracles: Training and Evaluating LLMs as General-Purpose Activation Explainers
- "Give Me BF16 or Give Me Death"? Accuracy-Performance Trade-Offs in LLM Quantization
- Inference-Time Intervention: Eliciting Truthful Answers from a Language Model
- VULPO: Context-Aware Vulnerability Detection via On-Policy LLM Optimization
- From SFT to RL: Demystifying the Post-Training Pipeline for LLM-based Vulnerability Detection
- The Geometry of Truth: Emergent Linear Structure in Large Language Model Representations of True/False Datasets
- ARVO: Atlas of Reproducible Vulnerabilities for Open-Source Software
- LLMs Know More Than They Show: On the Intrinsic Representation of LLM Hallucinations
- Probing the Probing Paradigm: Does Probing Accuracy Entail Task Relevance?
- Top Score on the Wrong Exam: On Benchmarking in Machine Learning for Vulnerability Detection
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks