Skip to content

Predictive Likelihood Ratios for Language Model Watermark Detection

Sep 2026 · 0 citations
Mathematics Computer Science

TL;DR

Predictive likelihood ratios that average over uncertain probability deficits and residual-tail distributions are constructed, showing robustness across the evaluated alternatives, not uniform power guarantees or resistance to arbitrary text edits.

Abstract

Keyed watermark detection tests dependence between observed tokens and pseudorandom variables reconstructed from a secret key. Building on the pivotal framework of Li et al. (2025), we construct predictive likelihood ratios that average over uncertain probability deficits and residual-tail distributions. The aim is robust detection power across alternative specifications without requiring a single signal-strength tuning. A mixture prior combines tail shape and effective width; hierarchical extensions allow within-document variation in deficit or width. The test maximizes prior-averaged power at a fixed size, but is not generally uniformly most powerful or minimax. Under the exact conditional pivot null, normalized predictive alternatives selected before each observation yield a Bayes factor that is also a test martingale: Type I error control is unaffected by alternative misspecification and remains valid under optional stopping. This guarantee does not cover violations of the conditional null, and the interpolated implementation has no certified anytime guarantee. Gumbel marginal likelihoods are evaluated by fixed quadrature. Across the evaluated tail-shape and tail-width alternatives and three horizons, the union-tail mixture has maximum observed Type II error regret .0080, compared with .0962 for the equal-tail mixture, relative to the best tested rule. On temperature-matched outputs from two open models, it improves AUC over the equal-tail baseline in all eight non-saturated model-temperature cells, although the leading reference score generally has higher AUC. Supplementary experiments show retained power under independent null-like replacement and smaller changes from hierarchical dependence modeling. The evidence supports robustness across the evaluated alternatives, not uniform power guarantees or resistance to arbitrary text edits.

View source

Similar papers

Preprint Aug 2026

Optimal Watermark Localization in Mixed-Source Large Language Model Texts

Watermarking provides a principled way to authenticate text generated by large language models (LLMs). In practice, however, the final text may be mixed-source, with watermark evidence surviving at only a subset of token positions after rewriting, insertion, deletion, or paraphrasing. Although prior work has studied gl...

José H. Blanchet, T. Cai, Xiang Li et al. · 1 citation · ⚡1
#natural language process... Preprint Sep 2026

CertMark: Distortion-Free Multi-Bit Watermarking with Certified Decoding

Leading multi-bit watermarking methods for language models encode messages by biasing the model's next-token probabilities, creating a trade-off between message recovery and text quality. Their decoders typically return the highest-scoring candidate from accumulated token-level evidence, without a certified abstention...

Pawel Batorski, P. Spurek, Paul Swoboda · 0 citations
#machine learning Preprint Sep 2026

Flip, Don't Shuffle: Watermarking LLMs at the Speed of Inference

Stateless Bernoulli Watermarking (SBW) is introduced, a new statistical watermark for Large Language Models that determines green list membership through independent per-token Bernoulli trials, reducing membership complexity to $O(1)$ and enabling single-kernel execution with zero intermediate allocations.

Simone Ceppi, Ignacio Sanchez · 0 citations
#machine learning Preprint Sep 2026

Membership Inference via Pairwise Likelihood Ratios

Pairwise Likelihood MIA (PL-MIA), a unified method that combines a Gaussian likelihood-ratio (GLR) statistic with population calibration and the Cauchy combination test, is proposed, demonstrating how statistical principles can turn noisy model outputs into more powerful, calibrated, and reproducible evidence for membe...

Sheng-Jie Niu, Ze-Bin Yun, Ye-Heng Ge et al. · 0 citations
Preprint Sep 2026

What Does a Benford Test Actually Test? Marginal Conformity, Sampling Structure, and Forensic Inference

Benford's law specifies a marginal distribution for significant digits, whereas the usual first-digit Pearson $p$-value is calibrated under an independent multinomial sampling model. We separate these statements with four constructions that share the same one-time or pooled Benford target but have different joint struc...

Arthur Charpentier · 0 citations
Open access Sep 2026

Gamark: adaptive entropy-threshold watermarking via gaussian mixture modeling for large language models

Existing generative watermarking methods rely on fixed or heuristic entropy thresholds in cross-task generation scenarios, leading to redundant watermark injection, detection noise, and degraded generation quality. To address these limitations, we propose GAMark, a Gaussian Mixture Model (GMM)-based semantics-aware Ada...

Jing Zhao, Hong-Wei Yang, Heng-Ji Dong et al. · 0 citations

Related blog posts

GPT-Lab Sep 3, 2026

Adaptive AI Agents in Construction Workflows

Adaptive AI agents can help make BIM data more machine-readable by navigating IFC models, interpreting inconsistent information, and mapping it to defined standards. In this blog, Alok Rawat shares findings from a real-world pilot in construction workflows. The post Adaptive AI Agents in Construction Workflows appeared first on GPT-Lab.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.