about
A Watermark for Large Language Models (arxiv.org)
3 points by EndXA on Nov 15, 2023 | hide | past | pdf | discuss on HN

In plain words: Before each word is chosen, the system marks a random set of words 'green' and nudges the model toward them, leaving a hidden pattern. It barely hurt text quality and was detected from a short passage without the model's code or weights.

Abstract

Potential harms of large language models can be mitigated by watermarking model output, i.e., embedding signals into generated text that are invisible to humans but algorithmically detectable from a short span of tokens. We propose a watermarking framework for proprietary language models. The watermark can be embedded with negligible impact on text quality, and can be detected using an efficient open-source algorithm without access to the language model API or parameters. The watermark works by selecting a randomized set of "green" tokens before a word is generated, and then softly promoting use of green tokens during sampling. We propose a statistical test for detecting the watermark with interpretable p-values, and derive an information-theoretic framework for analyzing the sensitivity of the watermark. We test the watermark using a multi-billion parameter model from the Open Pretrained Transformer (OPT) family, and discuss robustness and security.

John Kirchenbauer, Jonas Geiping, Yuxin Wen, Jonathan Katz, Ian Miers, Tom Goldstein
arXiv:2301.10226 · cs.LG, cs.CL, cs.CR · submitted Jan 24, 2023 · updated May 1, 2024
abstract · pdf · html · 13 pages in the main body. Published at ICML 2023. Code is available at github.com/jwkirchenbauer/lm-watermarking

add comment on HN
Also discussed: Aug 2026 (4 points, 0 comments) · Aug 2026 (3 points, 0 comments) · Feb 2023 (2 points, 0 comments) · Feb 2023 (1 point, 0 comments) · Jan 2023 (4 points, 1 comment) · Jan 2023 (3 points, 0 comments) · Jan 2023 (4 points, 3 comments)