Constraint pruning saves queries to a large language model (LLM) or another noisy oracle by skipping each yes/no question implied by answers accepted earlier, for example through transitivity. Entity-resolution systems and LLM-based rankers use this idea. However, their analyses typically assume a correct oracle. We argue that pruning should be judged by its risk when the oracle errs, since an accepted wrong answer spreads to every question it implies. When each answer is wrong independently with small probability ε, the first-order risk is set by how many facts one wrong answer corrupts on average. We consider two kinds of constraints. For implication rules, as in taxonomies, pruning in a random order adds no first-order risk: a wrong answer that would change k facts is accepted with probability 1/k, so it costs one fact on average. Rules with s premises break this balance: a wrong answer at a premise shared by r rules can cost order r1−1/s facts. For entity resolution with m records of one entity, the first-order risk equals ε times the Wiener index (the total pairwise distance) of the spanning tree built by the query order. Pivot orders, which first compare one record with all others, amplify errors by less than 2 and are optimal; random orders by order m1/3; the common most-similar-first order is the worst in one dimension and, for large m, worse than random in two. With several entities, the cost of wrongly merging two does not depend on how many others exist. Simulations agree with every predicted constant within sampling error.
Figures & tables
Figure 1: Propagation in three synthetic citation records of one publication: one wrong answer produces two wrong pair decisions and saves one query.
Setting
Mean damage (wrong final facts)
Reference
2-CNF, implication rules
1 for unfixed facts, 0 for fixed facts (backbone); ML: ≤1
Cor. 4 ; Prop. 5
Horn hub: k rules, s≥2 premises
∼Γ(1+s1)k1−1/s at the shared premise; ML: 0 ( k≥2 )
Thm. 6 ; Rem. 18
One entity, m records
pivot 2(m−1)/m (optimal); random Θ(m1/3) ; similarity-first under Thm. 11 : ≳(m/logm)1/d
Props. 9 , 10 ; Thm. 11
Cross pair, s records per entity
random g(s)∈[2s−1s−1,13s] , conj. Θ(s2/3) ; pivot (2s−1)/s
Props. 13 , 14 ; Conj. 15
Total orders
randomized quicksort →2
Prop. 24
Table 1: Mean single-error damage; skipped errors count as zero. Logical rows use uniform orders; partition rows average over all within- or cross-cluster pairs, giving first-order amplification over raw risk. Optimality is among greedy orders at first order. Conj.: conjectured growth.
Figure 2: Single-answer error propagation (top) and numerical checks (bottom): (A) logical constraints, (B) within-entity query order, (C) cross-entity false merges. Horn example: k=s=2 , a,ci false, bi true. Shading marks affected true clusters, not the final partition. Thick solid: exact formulas; thin connectors: visual guides; dashed: asymptotes (A), conjecture (C); dotted: fitted guide (B). Open markers: simulations ±1 standard error; diamonds: exact enumeration.
δ
Pivot
Random
Random/Pivot
0.01
0.019±0.002
0.082±0.008
4.2
0.02
0.039±0.002
0.170±0.012
4.3
0.05
0.094±0.003
0.320±0.010
3.4
0.10
0.174±0.004
0.458±0.008
2.6
0.20
0.335±0.004
0.604±0.006
1.8
Table 2: Fraction of wrongly separated pairs on one cluster of m=100 records when each answer is flipped to “different” with probability δ . Means ±1 Monte Carlo standard error over 200 runs; Random/Pivot is the ratio of the mean losses.
Setting
Wrong
Pivot
Random
Sim.-first
One entity
6.6%
1.23
2.31
0.85
One entity, 30 orders
6.6%
1.37
2.19
0.85
Shuffled, 30 orders
6.6%
1.73
3.55
3.48
Multi-entity blocks
6.3%
1.14
1.46
1.20
Table 3: Amplification on Qwen2.5-1.5B answers for Cora: final wrong pairs per wrong answer. Wrong: answer-error rate. Pivot/random use 200 orders in rows 1 and 4; rows 2–3 use 30 matched orders before and after uniformly redistributing errors within each entity, preserving its error count.
Appendix figures & tables5 assets
Supplementary material from the paper’s appendix.
Appendix
Quantity
Reference
Simulated
Conservation, ED(a)
1{a∈/B}
max∣z∣=2.66
Horn hub, s=2 , k=4
2.032
2.095±0.039
Horn hub, s=3 , k=3
2.314
2.291±0.031
g(3) , K=2,3,5
2.0907
2.099 , 2.106 , 2.083
EFP/ε , K=4 , s=3
56.87
58.1±1.1
EFN/ε , K=4 , s=3
72.03
71.9±1.0
Appendix
Table 4: Analytical references and simulated damage. Rows 1–4 use exact values (rounded); rows 5–6 use first-order coefficients. Uncertainty is ±1 Monte Carlo standard error (MCSE); ∣z∣ is the standardized deviation.
(sA,sB)
gFP
gFN
g
(1,1)
1
0
1
(1,2)
1
1/3
4/3
(2,2)
46/45
53/90
29/18=1.611111
(1,3)
1
28/45
73/45=1.622222
(2,3)
1.032959
0.830710
10567/5670=1.863668
(3,3)
1.053091
1.037571
313913/150150=2.090663
Appendix
Table 5: Exact mean damage of one false merge between two clusters of sizes sA and sB , split into wrongly merged pairs ( gFP ) and wrongly separated pairs ( gFN ), with g=gFP+gFN . The mean is over random query orders, with zero damage when the false pair is skipped. Decimals are rounded to six places.
s
Orders
g(s)
sP(q)
g/s2/3
8
40000
3.879±0.050
1.176
0.970
16
40000
5.719±0.112
1.244
0.901
32
30000
8.790±0.295
1.298
0.872
64
16000
14.20±0.93
1.340
0.888
128
5000
22.9±3.9
1.369
0.901
Appendix
Table 6: Two clusters of size s : Monte Carlo estimates of g(s) (mean ±1 Monte Carlo standard error over the given number of random orders), the numerically evaluated rescaled probability sP(q) that the false pair is queried, and g/s2/3 .
δ
Pivot
Random
Random/Pivot
0.01
0.020±0.001
0.106±0.009
5.4
0.02
0.039±0.001
0.200±0.012
5.1
0.05
0.097±0.002
0.361±0.010
3.7
0.10
0.179±0.003
0.502±0.007
2.8
0.20
0.337±0.003
0.646±0.005
1.9
Appendix
Table 7: Scale check for finite noise: fraction of wrongly separated pairs in one cluster of m=200 records. Mean ±1 Monte Carlo standard error over 200 runs per cell; Random/Pivot is the ratio of mean losses.
Wrong
Pivot
Random
Similarity-first
1.1%
1.48
4.85
1.18
2.1%
1.40
3.75
1.05
5.1%
1.26
2.64
0.71
6.6%
1.23
2.31
0.85
10.0%
1.22
1.99
1.21
20.1%
1.20
1.61
1.00
Appendix
Table 8: Amplification in the one-entity setting as the decision threshold changes. Wrong: wrong answers as a percentage of the 62,423 pairs; 6.6% is the threshold 0 of Table 3 .
Large language model reliability studies whether outputs remain correct, calibrated, robust, and controllable across prompts, contexts, and deployment conditions.
LLM assistants often produce more answers than humans can review before users see them. Most evaluations ask whether an answer is wrong, unsupported, or low-confidence. Bounded review budgets instead ask which answers should be checked first under a fixed review budget. Risk alone is not enough: a high-risk answer may be hard to repair, while a moderately risky answer may be directly correctable from available evidence. For generated-answer evaluation, we model review prioritization as exposure reduction, where review value combines estimated wrongness, intervention affordance, impact, and cost. We evaluate review queues with Wrong-Answer Exposure Ratio (WAER), the fraction of wrong answers left unreviewed, and post-repair residual exposure (PRRE), the fraction still exposed after deterministic benchmark-supported repairs. PRRE uses repairability rules that do not numerically reuse the affordance scores used for ranking. On a 720-item TAT-QA/SciFact stress benchmark, review-value ranking keeps answer-level WAER nearly unchanged at 20% budget (0.605 vs. 0.600) but lowers PRRE from 0.881 to 0.716. These results show that trustworthy LLM evaluation should measure not only error detection, but also how limited review capacity reduces exposed wrong answers.
Compressing large language models reduces memory use and inference cost, but it can also create failures that standard benchmarks miss. A pruned model may still perform well on multiple-choice evaluations, yet fail to answer the same question in open generation. We ask what pruning changes: does it erase the correct answer, or does it make the answer harder to produce as the top output? We study this question with multilingual question answering, tracking the same questions before and after pruning. We find a benchmark illusion. Under high-sparsity pruning, especially Wanda, models often fail in greedy open generation while still selecting the correct answer under multiple-choice scoring. In these recognition-only errors, the answer is usually not gone, but demoted: it often reappears with beam search, sampling, or one in-context example. Overall, multiple-choice benchmarks can overstate the usability of compressed LLMs, creating an evaluation blind spot. Compressed models should be tested on what they can produce, not only on what they can recognize.
Rui Wen, Lu Sun, Jiayang Liu +3
Institute of Science Tokyo · Tohoku University · Nanyang Technological University +2
A model should refuse two different things: answers it would get wrong, and questions it should not answer at all, such as unanswerable ones or ones resting on a false premise. The usual recipe thresholds a single confidence score, which cannot tell these apart. Across five instruction-tuned models from three families (2B to 14B), we find they are separate axes. Ordinary answer-confidence tracks whether an answer is right but is nearly blind to whether the question is answerable; a linear probe on hidden states does the reverse. The blind spot does not shrink with scale. It is worst on naturally occurring false-premise questions (CREPE). There, answer-confidence, P(IK), P(True), and even asking the model outright whether a premise is false all stay near chance, while a hidden-state probe reaches 0.69 to 0.77 AUROC: the model represents a problem it will not report. This turns out to be fixable. Instructing a model to check premises backfires, because it then disputes sound and false premises alike (57% false challenges), unable to tell them apart; routing the same instruction with the probe roughly triples challenge precision. We turn the two axes into a calibrated policy that answers only when an answerability score and a correctness score each clear a separately certifies behave differently: the unanswerable-answer rate is controllable at every scale, while the wrong-answer rate is capped by model accuracy, so the guarantee tightens as threshold policy certifies both budgets at 0.75 coverage of correct answers, against 0.31 for a single threshold; at 14B it is the only policy that certifies at all.