Sign inGet started
Paper · arXiv

From Token Probabilities to Semantic Constraints: Towards Declarative Probabilistic Evaluation of Language Models

While Large Language Models have improved rapidly, many fundamental questions remain about how to evaluate the knowledge and reasoning abilities they acquire, and how such evaluations relate to the learning signals used in pre-training. In this paper, we propose ModelLog, a declarative probabilistic framework for pre-training evaluation that makes the semantic structure of model behavior explicit and provides new formal tools for relating evaluation to learning. ModelLog specifies evaluation targets as symbolic constraints over token-level predictions and measures how strongly a model's distribution satisfies those constraints. We explore the framework through a new suite of tasks targeti...

AuthorsKyle Richardson, Cullen Anderson, Pranav Balakrishnan et al.
Primary categorycs.CL
Published11 September 2026
Last updated at source11 September 2026
cs.CL
Embed this entry
<iframe src="https://silytics.si/embed/item/ad7eacdb-d927-4982-a067-f57f1fa068d6" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.