CORTEXA
← Browse
arxivstat.MLcs.LG2026-06-25

When are likely answers right? On Sequence Probability and Correctness in LLMs

Johannes Zenn, Jonas Geiping

Many decoding methods for large language models can be understood as shifting probability mass toward outputs that are more likely under the model, either locally at the token level or globally at the sequence level. Therefore, their success depends on a fundamental question: when does sequence probability, that is, the conditional probability of a continuation given a prompt, actually align with correctness? In this paper, we set out to quantify this relationship across decoding methods, models, and benchmarks at four levels: across decoding methods, across hyperparameters within a method, across prompt-answer pairs within a dataset, and across repeated responses to the same prompt. We find that higher sequence probability is often predictive of correctness across prompt-answer pairs within a fixed dataset. However, this relationship does not generally transfer to decoding decisions: increasing sequence probability by changing hyperparameters or methods does not reliably improve accuracy. Further, sequence probability is not a good indicator of correctness for responses to the same prompt. These findings clarify when decoding can and cannot be expected to improve correctness, and provide practical guidance for decoding, self-consistency, and verifier-free self-improvement.

View free PDFSource page

Related papers

arxivcs.LGstat.ML2026-07-06

Probably Correct Optimal Stable Matching under Two-Sided Uncertainty

Andreas Athanasopoulos, Anne-Marie George, Christos Dimitrakakis

We study a sequential learning problem for stable matchings in two-sided markets where preferences on both sides are initially unknown. We focus on a centralized setting where an algorithm matches agents at each time step and receives noisy rewards that reflect the preferences of…

View free PDFSource page
arxivcs.LGcs.AIcs.CLstat.ML2026-06-27

When More Sampling Hurts: The Modal Ceiling and Correlation Ceiling of Test-Time Scaling

Yong Yi Bay, Kathleen A. Yearick

People overthink; language models over-sample, and the extra effort can talk both into a worse answer. Reasoning systems answer a hard question by sampling it many times (test-time scaling), and the more they draw, the more often a correct answer turns up somewhere, so coverage,…

View free PDFSource page
arxivcs.LGcs.AIcs.CLstat.ML2026-06-30

GRPO, Dr. GRPO, and DAPO Are Three Operations on One Number: The Group-Standard-Deviation Identity

Yong Yi Bay, Kathleen A. Yearick

Three of the most popular methods for training language models to reason look like three different tricks. They are not. All three adjust a single number: standard deviation, reflecting how much a prompt's sampled answers disagree. When such a model is trained, it answers each pr…

View free PDFSource page
arxivstat.MLcs.AIcs.LG2026-07-05

Fixed-Confidence Best-Arm Identification for Causal Mediation Analysis

Harsh Shrivastava, Yuta Kawakami, Junpei Komiyama, Jin Tian

This paper studies the problem of identifying the treatment that maximizes the expected natural direct potential outcome (NDPO), which captures the potential outcome of an intervention while excluding the pathway transmitted through a mediator that researchers may wish to remove…

View free PDFSource page
arxivcs.CLcs.AIcs.LGstat.ML2026-07-05

Telescope: Improving Zero Shot Detection of LLM Generated Content By Measuring Token Repetition Probability

Christopher Nassif, Josh F. Cooper

Distinguishing Large Language Model (LLM) generated text from human writing is a critical and difficult challenge. While LLMs are trained to write like humans, we hypothesize that this training leaves an indelible mark. LLMs develop a particularly strong aversion to token repetit…

View free PDFSource page
arxivcs.LGcs.AIstat.ML2026-07-13

Are we Merging the Right Models? Impact of Expert Training Duration on Model Merging for LLMs

Nikita Kozodoi, Zainab Afolabi, Jack Butler

Multi-task model merging combines separately trained expert models into a single model that handles all tasks without co-training. Standard practice merges experts at their optimal validation loss. We challenge this convention by systematically studying how training duration of d…

View free PDFSource page