arXiv Computation and Language By Yu-Shin Huang, Chao Tian, Krishna Narayanan

Optimal Multi-bit Generative Watermarking Schemes Under Worst-Case False-Alarm Constraints

Read the original on arXiv Computation and Language →

The paper addresses multi‑bit generative watermarking for large language models under a worst‑case false‑alarm constraint. It shows that a previously proposed scheme is suboptimal and introduces two new encoding‑decoding constructions that achieve the established lower bound on miss‑detection probability, fully characterizing optimal performance. The authors formulate the problem as a linear program, derive conditions for optimality, identify the failure mode of the earlier construction, and compare trade‑offs between the two new schemes.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv Computation and Language
Sep 30

TTMark: Pairwise Distortion-Free Watermarking Beyond Single-Token Entropy

TTMark introduces a pairwise watermarking framework that extends distortion‑free watermarking from single tokens to adjacent token pairs, enlarging the watermarking alphabet from V to V². By watermarking the joint distribution of consecutive tokens, the detector can exploit both token entropy and conditional entropy while maintaining distortion‑freeness. Experiments on multiple language models and datasets show that TTMARK improves detectability, robustness to edits, and localized watermark detection without degrading generation quality.

By Ruibo Chen, Zhengmian Hu, Donghang Lu, Xuehao Cui, Georgios Milis, Yihan Wu, Jian Du, Heng Huang
arXiv AI
Sep 18

Watermarking Diffusion Language Models

The paper introduces the first watermark designed specifically for diffusion language models (DLMs), which generate tokens in arbitrary order unlike traditional autoregressive models. It overcomes the challenge of missing prior tokens by applying the watermark in expectation over the context and promoting tokens that strengthen the watermark when used as context. Experiments show a >99% true positive rate with minimal quality loss and comparable robustness to existing autoregressive watermarks.

By Thibaud Gloaguen, Robin Staab, Nikola Jovanovi\'c, Martin Vechev