Entropy in Large Language Models

Read full text
Authors: Marco Scharringhausen
Cited by: 0

Abstract

In this study, the output of large language models (LLM) is considered an information source generating an unlimited sequence of symbols drawn from a finite alphabet. Given the probabilistic nature of modern LLMs, we assume a probabilistic model for these LLMs, following a constant random distribution and the source itself thus being stationary. We compare this source entropy (per word) to that of natural language (written or spoken) as represented by the Open American National Corpus (OANC). Our results indicate that the word entropy of such LLMs is lower than the word entropy of natural speech both in written or spoken form. The long-term goal of such studies is to formalize the intuitions of information and uncertainty in large language training to assess the impact of training an LLM from LLM generated training data. This refers to texts from the world wide web in particular.

Fields of Study & Subjects

Natural Language Processing Techniques Topic Modeling Speech Recognition and Synthesis

Publication details

Journal / source
arXiv (Cornell University)
Publication date
23 February 2026
Language
EN
Document type
Preprint