arXiv Computation and Language

Watermarkability: Measuring and Improving Language-Model Compatibility with Logit-Based Watermarks

The paper introduces "watermarkability," a metric that quantifies how compatible a language model is with a logit‑based watermark that boosts the probability of a specified token set during decoding. By measuring the expected minimum KL divergence needed to achieve a target probability mass, the authors can assess and compare models and watermark rules. They propose a two‑stage approach—first training a low‑rank adapter conditioned on the target set, then applying a minimal uniform logit bias—to reduce this cost, achieving significant perplexity reductions across multiple watermark schedules on OPT‑125M and Qwen3‑8B.

arXiv Machine Learning
2d ago

MarkTune: Improving the Quality-Detectability Trade-off in Model-Embedded LLM Watermarking

MarkTune is a model‑embedded watermarking framework that improves the trade‑off between generation quality and detectability. By regularizing toward a high‑quality reference distribution, it decouples quality preservation from proximity to the base model and uses the GaussMark detection statistic as a reward during on‑policy fine‑tuning. Empirical results show that MarkTune enhances the quality‑detectability frontier, maintains downstream task performance, and remains robust against text‑editing and open‑weight attacks across diverse datasets.

By Yizhou Zhao, Zhiwei Steven Wu, Adam Block
arXiv Machine Learning
Oct 8

Constitution-Guided Watermarking

arXiv:2610.09552v1 Announce Type: cross Abstract: Watermarking enables language model providers to identify text generated by their models. However, its desired properties can conflict (\ie~stronger...

By Toluwani Aremu, Samuele Poppi, Nils Lukas
Hugging Face Trending Papers
Sep 3

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

We introduce Stateless Bernoulli Watermarking (SBW), a new statistical watermark for Large Language Models that determines green list membership through independent per-token Bernoulli trials. Unlike KGW's vocabulary permutation or SynthID's multi-layer tournament, SBW requires only a single comparison per token against a counter-based random number generator, reducing membership complexity to $O(1)$ and enabling single-kernel execution with zero intermediate allocations.

arXiv Machine Learning
Jul 8

Beyond Heuristic Tuning: Power-Calibrated LLM Watermarking

arXiv:2607. 05694v1 Announce Type: cross Abstract: Logit-based watermarking is a widely used mechanism for identifying LLM generated content, yet its effectiveness is governed by a fundamental trade-off between detectability and semantic distortion.

By Xiaopu Wang, Zelin He, Chengyuan Liu, Runze Li