ArXiv

Partition, Prompt, Aggregate: Statistical Self-Consistency in Language Models

Authors
Patrik Wolf, Thomas Kleine Buening, Andreas Krause...
Categories
cs.CL
arXiv
https://arxiv.org/abs/2607.15277v1
PDF
https://arxiv.org/pdf/2607.15277v1

Brief

Partition, Prompt, Aggregate evaluates whether in‑context LLM outputs behave like conditional probability estimates by testing the law of total probability via recursive binary-tree partitions: prompt models on verbalized subpopulations, aggregate back to the population, and compare across partition granularities. Across problem domains and frontier models the authors find widespread inconsistencies and identify a "macro fallacy" where fine-grained (persona) prompts yield aggregates closer to human references than direct population prompts. They propose statistical self-consistency as a reference-free metric, showing models encode subpopulation knowledge but fail to propagate it reliably.

Why it matters

LLMs often violate the law of total probability under test: using binary-tree partitions (prompting models with verbalized subpopulation descriptions and aggregating estimates) yields inconsistent population-level marginals across partitions for state-of-the-art 'frontier' models and multiple problem domains.

Key details

  • Macro fallacy discovered: population estimates reconstructed from more fine-grained persona/subpopulation prompts frequently align better with human reference data than direct population-level estimates; this effect is robust across tree structures and estimation tasks and can be partially recovered via implicit prompting.
  • The authors propose statistical self-consistency (partition-aggregate consistency) as a reference-free evaluation criterion, arguing models possess relevant subpopulation knowledge but do not reliably propagate it into aggregate estimates.
Source evidence

Abstract

In-context learning is commonly interpreted as a form of conditional inference, in which the prompt specifies a context and the model's output is treated as an estimate of the corresponding conditional distribution. If this interpretation holds, then LLM estimates should satisfy basic probabilistic identities. In particular, the law of total probability asserts that prior-weighted conditional distributions aggregate into population-level marginals over any valid partition of the population. In this work, we investigate to what extent LLM estimates adhere to this self-consistency principle. We use binary trees as an evaluation scaffold to recursively partition a population into increasingly fine-grained subpopulations. We then prompt LLMs with verbalized subpopulation descriptions in context, aggregate the resulting estimates back into population-level estimates, and compare them across partitions of varying granularity. Applying this protocol across problem domains and state-of-the-art frontier models, we show widespread violations of basic consistency properties. An in-depth study of persona prompting reveals a pattern we call the macro fallacy: estimates reconstructed from more fine-grained subpopulation responses are often better aligned with human reference data than direct population-level estimates. This effect persists across variations in tree structure and estimation task, and can be partially recovered through implicit prompting. Together, these findings suggest that models possess relevant subpopulation knowledge but do not reliably propagate it into aggregate estimates. This gap establishes statistical self-consistency as an unsaturated, reference-free criterion for evaluating LLMs.