Quantifying construct validity in large language model evaluations
Organizations: St Catherine’s College
Abstract
The LLM community often reports benchmark results as if they are synonymous with general model capabilities. However, benchmarks can have problems that distort performance, like test set contamination and annotator error. How can we know that a benchmark is a reliable indicator of some capability that we want to measure? This question concerns the construct validity of LLM benchmarks, and it requires separating benchmark results from capabilities when we model and predict LLM performance. Both social scientists and computer scientists propose formal models - latent factor models and scaling laws - for identifying the capabilities underlying benchmark scores. However, neither technique is satisfactory for construct validity. Latent factor models ignore scaling laws, and as a result, the capabilities they extract often proxy model size. Scaling laws ignore measurement error, and as a result, the capabilities they extract are both uninterpretable and overfit to the observed benchmarks. This thesis presents the structured capabilities model, the first model to extract interpretable and generalisable capabilities from a large collection of LLM benchmark results. I fit this model and its two alternatives on a large sample of results from the OpenLLM Leaderboard. Structured capabilities outperform latent factor models on parsimonious fit indices, and exhibit better out-of-distribution benchmark prediction than scaling laws. These improvements are possible because neither existing approach separates model scale from capabilities in the appropriate way. Model scale should inform capabilities, as in scaling laws, and these capabilities should inform observed results up to measurement error, as in latent factor models. In combining these two insights, structured capabilities demonstrate better explanatory and predictive power for quantifying construct validity in LLM evaluations.
Figures & tables
| Subtask | # Questions | # Multiple-choice options |
|---|---|---|
| Boolean expressions | 250 | 2 |
| Causal judgement | 187 | 2 |
| Date understanding | 250 | 6 |
| Disambiguation QA | 250 | 3 |
| Formal fallacies | 250 | 2 |
| Geometric shapes | 250 | 11 |
| Eq. | Str. | Log. | CFI | RMSEA | SRMR | AIC | BIC | |
|---|---|---|---|---|---|---|---|---|
| ( 13a ) | ✗ | ✗ | 2984 | 0.9737 | 0.0876 | 0.0134 | -217242 | -216578 |
| ( 13b ) | ✓ | ✗ | 3615 | 0.9680 | 0.0894 | 0.0163 | -220369 | -219673 |
| ( 13c ) | ✗ | ✓ | 1547 | 0.9836 | 0.0623 | 0.0110 | 222038 | 222703 |
| ( 13d ) | ✓ | ✓ | 2127 | 0.9782 | 0.0679 | 0.0135 | 218743 | 219439 |
| Withheld subtask | SC | OSL | Size | SC | OSL | Size |
|---|---|---|---|---|---|---|
| Boolean expressions | 1.056 | 1.153 | 2.487 | 0.206 | 0.239 | 1.144 |
| Causal judgement | 0.476 | 0.469 | 0.846 | 0.338 | 0.293 | 0.687 |
| Date understanding | 0.464 | 0.462 | 1.419 | 0.250 | 0.149 | 1.022 |
| Disambiguation QA | 1.536 | 1.519 | 2.592 | 0.608 | 0.680 | 1.764 |
| Formal fallacies | 0.961 | 0.984 | 1.490 | 0.862 | 1.092 | 4.411 |
Appendix figures & tables2 assets
Supplementary material from the paper’s appendix.
Appendix
| Benchmark | Dataset description | Citation |
| GSM8K | Grade school-level arithmetic word problems. | Cobbe et al. (2021) |
| MATH | Challenging high school-level competition mathematics problems. | Hendrycks et al. (2021) |
| FrontierMath | Unpublished, expert-level research mathematics problems. | Glazer et al. (2024) |
| GPQA | “Google-Proof Q&A.” PhD-level biology, physics, and chemistry multiple choice questions. | Rein et al. (2024) |
| MMLU-Pro | Broad knowledge and reasoning benchmark with questions spanning 14 academic subjects. | Wang et al. (2025) |
| Commonsense QA | Crowd-sourced multiple choice questions targeting simple concepts. | Talmor et al. (2019) |
LLM Evaluation
Large language model evaluation measures what models can do, how reliably they do it, and whether benchmark scores predict real-world performance.
See all 2,355 papers