When benchmark inferences do not compose: Projectibility in AI evaluation

Brett Reynolds
7/28/2026
cs.AIcs.CYcs.LG

No official code found. Best implementation: BrettRey/benchmark-inference-composition (0 stars, last commit 2026-07-28).

Abstract

An AI benchmark result rarely reaches a consequential claim in one step. Evaluators generalize it to further cases, interpret it as evidence of capability, extrapolate it to new tasks, transport it to another system or site, and combine it with assumptions about human review and downstream consequences. Validity-centred approaches require evidence for each claim. This paper identifies a further epistemic problem: warranted links don't automatically make a warranted chain. The target of one study may not be the source of the next; system, population, outcome, or conditions may change at the interface; and shared data or model lineage may make apparently independent support dependent. Projectibility concerns whether a bounded extension from observed to unobserved cases is warranted. Goodman supplies the problem of rival extensions; argument-based validity supplies an architecture for testing them. The paper's distinctive claim is a non-composition principle: support for adjacent projections warrants their composition only when endpoints and assumptions align and dependence and uncertainty are carried through. A legal-research case shows how benchmark evidence and a deployment study can each be sound while remaining parallel. A reanalysis and simulation show why aggregate stability can erase distinctions a later projection requires. The resulting projectibility audit diagnoses unsupported joins in benchmark-to-use arguments.

View on arXivView PDF

Code Implementations(1)

When Benchmark Inferences Do Not Compose: Projectibility in AI Evaluation — paper source and empirical companion (reanalysis + estimator code)

00Apr 6, 20262 months agoNOASSERTION

Similar Papers

Cite this paper

@article{reynolds2026when,
  title  = {When benchmark inferences do not compose: Projectibility in AI evaluation},
  author = {Brett Reynolds},
  year   = {2026},
  eprint = {2607.26159},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2607.26159v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2607.26159.svg)](https://codeofpaper.com/paper/2607.26159)

Discussion