Estimating Great Expectations Under Autoregressive Language Models with Potentials
Lists
Only you see this
Abstract
Many applications of language models hinge not on individual samples but on the expectation of a test functional under the model. Estimating such expectations reliably can be computationally expensive. In this paper, we show how to make estimation more efficient by exploiting the next-token conditional probabilities which are available as a by-product of sampling. We do so through potentials: real-valued functions on prefixes that decompose the test functional additively. We construct an estimator whose variance depends on the chosen potential, and derive conditions under which a potential reduces this variance. We then develop practical potentials for several estimands and applications, and demonstrate substantial variance reductions across several estimands at comparable computational cost.
BibTeX
@misc{re2026estimating,
author = {Francesco I. Re and Shubhangi Ghosh and Tim Vieira and Ryan Cotterell},
title = {{Estimating Great Expectations Under Autoregressive Language Models with Potentials}},
year = {2026},
eprint = {2610.11399},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.11399},
}