A Measure-Theoretic Characterization of Tight Language Models
Not on the map. Why?
Abstract (arXiv)
Language modeling, a central task in natural language processing, involves estimating a probability distribution over strings. In most cases, the estimated distribution sums to 1 over all finite strings. However, in some pathological cases, probability mass can ``leak'' onto the set of infinite sequences. In order to characterize the notion of leakage more precisely, this paper offers a measure-theoretic treatment of language modeling. We prove that many popular language model families are in fact tight, meaning that they will not leak in this sense. We also generalize characterizations of tightness proposed in previous works.
Key facts. Cited by 33 papers in the map (data through 14 Oct 2026). Builds on 16 of its 51 references that are in the map. First posted on arXiv 20 Dec 2022.
Builds on
16 of 51 references.
References · 16
- 2017Attention Is All You Needcited by 60,361
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2019The Curious Case of Neural Text Degenerationcited by 2,916
- 2018Deep contextualized word representationscited by 2,290
- 2019Language Models as Knowledge Bases?cited by 1,936
- 2016From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classificationcited by 341
- 2020Byte Pair Encoding is Suboptimal for Language Model Pretrainingcited by 192
- 2019Sparse Sequence-to-Sequence Modelscited by 170
- 2022Locally Typical Samplingcited by 111
- 2021A Recipe For Arbitrary Text Style Transfer with Large Language Modelscited by 107
- 2021Revisiting the Uniform Information Density Hypothesiscited by 68
- 2020Limitations of Autoregressive Models and Their Alternativescited by 55
4 more
- 2020Consistency of a Recurrent Language Model With Respect to Incomplete Decodingcited by 54
- 2022Autoregressive Structured Prediction with Language Modelscited by 43
- 2017Recurrent Neural Networks as Weighted Language Recognizerscited by 30
- 2021Reconciling the Discrete-Continuous Divide: Towards a Mathematical Theory of Sparse Communicationcited by 1
Built on by
Citing papers per year: 2023: 11; 2024: 14; 2025: 4; 2026: 4.
33 papers.
Sort:
By area:
- 2024The pitfalls of next-token predictioncited by 160
- 2024How to Compute the Probability of a Wordcited by 36
- 2024Transformers Can Represent n-gram Language Modelscited by 32
- 2023A Geometric Notion of Causal Probingcited by 25
- 2024Training Neural Networks as Recognizers of Formal Languagescited by 24
- 2024On the Role of Context in Reading Time Predictioncited by 20
- 2023A Cross-Linguistic Pressure for Uniform Information Density in Word Ordercited by 17
- 2023On the Efficacy of Sampling Adapterscited by 17
- 2023MixCE: Training Autoregressive Language Models by Mixing Forward and Reverse Cross-Entropiescited by 16
- 2025Causal Estimation of Tokenisation Biascited by 16
- 2024Gumbel Counterfactual Generation From Language Modelscited by 14
- 2024Next-token prediction capacity: general upper bounds and a lower bound for transformerscited by 11
21 more
- 2023Language Models as a Service: Overview of a New Paradigm and its Challengescited by 10
- 2024Generalists vs. Specialists: Evaluating LLMs on Highly-Constrained Biophysical Sequence Optimization Taskscited by 10
- 2023Deriving Language Models from Masked Language Modelscited by 9
- 2023Recurrent Neural Language Models as Probabilistic Finite-state Automatacited by 6
- 2025Circuit Stability Characterizes Language Model Generalizationcited by 6
- 2023Structured Voronoi Samplingcited by 4
- 2023Principled Gradient-based Markov Chain Monte Carlo for Text Generationcited by 4
- 2024Lower Bounds on the Expressivity of Recurrent Neural Language Modelscited by 4
- 2024On Affine Homotopy between Language Encoderscited by 3
- 2024CONTESTS: a Framework for Consistency Testing of Span Probabilities in Language Modelscited by 3
- 2023On the Representational Capacity of Recurrent Neural Language Modelscited by 1
- 2024On Efficiently Representing Regular Languages as RNNscited by 1
- 2024Analyzing constrained LLM through PDFA-learningcited by 1
- 2025Express Your Doubts -- Probabilistic World Modeling Should not be Based on Token logprobscited by 1
- 2023Structure-Aware Path Inference for Neural Finite State Transducerscited by 0
- 2024A Probability--Quality Trade-off in Aligned Language Models and its Relation to Sampling Adaptorscited by 0
- 2025A fine-grained look at causal effects in causal spacescited by 0
- 2026Surprisal Theory is Tautological (without Rational Grounding)cited by 0
- 2026The Probabilistic Structure of Large Language Modelscited by 0
- 2026TULIP: Targeted LLM Unlearning at Layers Identified Per-Inputcited by 0
- 2026Modeling the Arrival Time of Information-Bearing Events in Natural Languagecited by 0
- 2026Modeling the Arrival Time of Information-Bearing Events in Natural Language9 Oct 2026
- 2026TULIP: Targeted LLM Unlearning at Layers Identified Per-Input28 Sep 2026
- 2026The Probabilistic Structure of Large Language Models20 Sep 2026
- 2026Surprisal Theory is Tautological (without Rational Grounding)23 Jul 2026
- 2025A fine-grained look at causal effects in causal spaces11 Dec 2025
- 2025Causal Estimation of Tokenisation Bias3 Jun 2025
- 2025Circuit Stability Characterizes Language Model Generalization30 May 2025
- 2025Express Your Doubts -- Probabilistic World Modeling Should not be Based on Token logprobs4 May 2025
- 2024Gumbel Counterfactual Generation From Language Models11 Nov 2024
- 2024Training Neural Networks as Recognizers of Formal Languages11 Nov 2024
- 2024Generalists vs. Specialists: Evaluating LLMs on Highly-Constrained Biophysical Sequence Optimization Tasks29 Oct 2024
- 2024CONTESTS: a Framework for Consistency Testing of Span Probabilities in Language Models30 Sep 2024
21 more
- 2024On the Role of Context in Reading Time Prediction12 Sep 2024
- 2024How to Compute the Probability of a Word20 Jun 2024
- 2024A Probability--Quality Trade-off in Aligned Language Models and its Relation to Sampling Adaptors14 Jun 2024
- 2024Analyzing constrained LLM through PDFA-learning12 Jun 2024
- 2024On Affine Homotopy between Language Encoders4 Jun 2024
- 2024Lower Bounds on the Expressivity of Recurrent Neural Language Models29 May 2024
- 2024Next-token prediction capacity: general upper bounds and a lower bound for transformers22 May 2024
- 2024Transformers Can Represent n-gram Language Models23 Apr 2024
- 2024The pitfalls of next-token prediction11 Mar 2024
- 2024On Efficiently Representing Regular Languages as RNNs24 Feb 2024
- 2023Principled Gradient-based Markov Chain Monte Carlo for Text Generation29 Dec 2023
- 2023Structure-Aware Path Inference for Neural Finite State Transducers21 Dec 2023
- 2023On the Representational Capacity of Recurrent Neural Language Models19 Oct 2023
- 2023Recurrent Neural Language Models as Probabilistic Finite-state Automata8 Oct 2023
- 2023Language Models as a Service: Overview of a New Paradigm and its Challenges28 Sep 2023
- 2023A Geometric Notion of Causal Probing27 Jul 2023
- 2023On the Efficacy of Sampling Adapters7 Jul 2023
- 2023A Cross-Linguistic Pressure for Uniform Information Density in Word Order6 Jun 2023
- 2023Structured Voronoi Sampling5 Jun 2023
- 2023MixCE: Training Autoregressive Language Models by Mixing Forward and Reverse Cross-Entropies26 May 2023
- 2023Deriving Language Models from Masked Language Models24 May 2023
- 2024Training Neural Networks as Recognizers of Formal Languagescited by 24
- 2024Training Neural Networks as Recognizers of Formal Languages11 Nov 2024
- 2024The pitfalls of next-token predictioncited by 160
- 2024How to Compute the Probability of a Wordcited by 36
- 2024Transformers Can Represent n-gram Language Modelscited by 32
- 2023A Geometric Notion of Causal Probingcited by 25
- 2024On the Role of Context in Reading Time Predictioncited by 20
- 2023A Cross-Linguistic Pressure for Uniform Information Density in Word Ordercited by 17
- 2023On the Efficacy of Sampling Adapterscited by 17
- 2023MixCE: Training Autoregressive Language Models by Mixing Forward and Reverse Cross-Entropiescited by 16
- 2025Causal Estimation of Tokenisation Biascited by 16
- 2024Gumbel Counterfactual Generation From Language Modelscited by 14
- 2024Next-token prediction capacity: general upper bounds and a lower bound for transformerscited by 11
- 2023Language Models as a Service: Overview of a New Paradigm and its Challengescited by 10
12 most cited of 28 All 28 (JSON)
- 2026Modeling the Arrival Time of Information-Bearing Events in Natural Language9 Oct 2026
- 2026The Probabilistic Structure of Large Language Models20 Sep 2026
- 2026Surprisal Theory is Tautological (without Rational Grounding)23 Jul 2026
- 2025A fine-grained look at causal effects in causal spaces11 Dec 2025
- 2025Causal Estimation of Tokenisation Bias3 Jun 2025
- 2024Gumbel Counterfactual Generation From Language Models11 Nov 2024
- 2024Generalists vs. Specialists: Evaluating LLMs on Highly-Constrained Biophysical Sequence Optimization Tasks29 Oct 2024
- 2024CONTESTS: a Framework for Consistency Testing of Span Probabilities in Language Models30 Sep 2024
- 2024On the Role of Context in Reading Time Prediction12 Sep 2024
- 2024How to Compute the Probability of a Word20 Jun 2024
- 2024Analyzing constrained LLM through PDFA-learning12 Jun 2024
- 2024On Affine Homotopy between Language Encoders4 Jun 2024
12 newest of 28 All 28 (JSON)