Sign inGet started
Paper · arXiv

Forking Fast: Efficiently Estimating Uncertainty Dynamics in Text Generation

LLM reasoning is stochastic, and so understanding a model requires grappling with the distribution of reasoning chains that it might produce for a given question, i.e., its uncertainty. Resampling-based analyses characterize this distribution, revealing which steps of a rollout determine how the model arrives at its answer. However, a major limitation of these approaches is that resampling text sequences at every token or sentence in a reasoning chain is very costly. Our work strives to make resampling analysis more computationally efficient, while also shedding light on an important scientific question: what is the right statistical model for explaining uncertainty dynamics in text gener...

AuthorsEric Bigelow, Amir Zur, Satchel Grant et al.
Primary categorycs.CL
Published20 August 2026
Last updated at source20 August 2026
cs.CLcs.AIcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/8832808f-92ae-4e3b-b8f9-727ccc02ffc6" 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.