Sign inGet started
Paper · arXiv

Refined Detection for Gumbel Watermarking

We propose a simple detection mechanism for the Gumbel watermarking scheme proposed by Aaronson (2022). The new mechanism is proven to be near-optimal in a problem-dependent sense among all model-agnostic watermarking schemes under the assumption that the next-token distribution is sampled i.i.d.

AuthorsTor Lattimore
Primary categorycs.LG
Published31 March 2026
Last updated at source31 March 2026
cs.LGcs.CRstat.ML
Embed this entry
<iframe src="https://silytics.si/embed/item/75085d4b-1d58-4d83-a401-ac72ce4bf6b8" 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.