CONTESTS: a Framework for Consistency Testing of Span Probabilities in Language Models
Not on the map. Why?
Abstract (arXiv)
Although language model scores are often treated as probabilities, their reliability as probability estimators has mainly been studied through calibration, overlooking other aspects. In particular, it is unclear whether language models produce the same value for different ways of assigning joint probabilities to word spans. Our work introduces a novel framework, ConTestS (Consistency Testing over Spans), involving statistical tests to assess score consistency across interchangeable completion and conditioning orders. We conduct experiments on post-release real and synthetic data to eliminate training effects. Our findings reveal that both Masked Language Models (MLMs) and autoregressive models exhibit inconsistent predictions, with autoregressive models showing larger discrepancies. Larger MLMs tend to produce more consistent predictions, while autoregressive models show the opposite trend. Moreover, for both model types, prediction entropies offer insights into the true word span likelihood and therefore can aid in selecting optimal decoding strategies. The inconsistencies revealed by our analysis, as well their connection to prediction entropies and differences between model types, can serve as useful guides for future research on addressing these limitations.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 23 of its 41 references that are in the map. First posted on arXiv 30 Sep 2024.
Builds on
23 of 41 references.
References · 23
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2022Training language models to follow instructions with human feedbackcited by 15,712
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2019Unsupervised Cross-lingual Representation Learning at Scalecited by 3,907
- 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,747
- 2019The Curious Case of Neural Text Degenerationcited by 2,881
- 2021Measuring and Improving Consistency in Pretrained Language Modelscited by 361
- 2020Calibration of Pre-trained Transformerscited by 307
- 2019Theoretical Limitations of Self-Attention in Neural Sequence Modelscited by 286
- 2022Efficient Training of Language Models to Fill in the Middlecited by 248
11 more
- 2019BERT has a Mouth, and It Must Speak: BERT as a Markov Random Field Language Modelcited by 184
- 2017Breaking the Softmax Bottleneck: A High-Rank RNN Language Modelcited by 147
- 2022Calibrating Sequence likelihood Improves Conditional Language Generationcited by 121
- 2020Trading Off Diversity and Quality in Natural Language Generationcited by 94
- 2019A Logic-Driven Framework for Consistency of Neural Modelscited by 64
- 2022A Close Look into the Calibration of Pre-trained Language Modelscited by 57
- 2019Calibration, Entropy Rates, and Memory in Language Modelscited by 32
- 2022A Measure-Theoretic Characterization of Tight Language Modelscited by 32
- 2023Conformal Nucleus Samplingcited by 32
- 2023Preserving Pre-trained Features Helps Calibrate Fine-tuned Language Modelscited by 29
- 2020On the Discrepancy between Density Estimation and Sequence Generationcited by 3
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.
- 2025Express Your Doubts -- Probabilistic World Modeling Should not be Based on Token logprobscited by 1
- 2026Path-Dependent Denoising: A Non-Conservative Field Perspective on Order Collapse in Diffusion Language Modelscited by 0
- 2026Probability Contracts: Accuracy, Coherence, and Decisions Across LLM Interfacescited by 0
- 2026Probability Contracts: Accuracy, Coherence, and Decisions Across LLM Interfaces27 Sep 2026
- 2026Path-Dependent Denoising: A Non-Conservative Field Perspective on Order Collapse in Diffusion Language Models10 May 2026
- 2025Express Your Doubts -- Probabilistic World Modeling Should not be Based on Token logprobs4 May 2025