Patrick Chao, Edgar Dobriban, Hamed Hassani
Abstract
Recent progress in large language models enables the creation of realistic machine-generated content. Watermarking is a promising approach to distinguish machine-generated text from human text, embedding statistical signals in the output that are ideally undetectable to humans. We propose a watermarking framework that encodes such signals through an error correcting code. Our method, termed robust binary code (RBC) watermark, introduces no distortion compared to the original probability distribution, and no noticeable degradation in quality. We evaluate our watermark on base and instruction fine-tuned models and find our watermark is robust to edits, deletions, and translations. We provide an information-theoretic perspective on watermarking, a powerful statistical test for detection and for generating p-values, and theoretical guarantees. Our empirical findings suggest our watermark is fast, powerful, and robust, comparing favorably to the state-of-the-art.
6.2 Robustness Experiments
In practice, a user may attempt to circumvent watermarks by editing the text generated by a
language model. To emulate this, we use three popular perturbations that may represent an adversary hoping to evade a watermark, as in other works including (Kuditipudi et al., 2023; Piet et al., 2023).
- Delete. We randomly delete 20% of the tokens.
- Swap. We replace a randomly chosen fraction of 20% of the tokens with random tokens.
- Translate. We translate the generated text to Russian then back to English using Argos
Translate (Finlay and Argos Translate, 2023).
For our experiments, we elect to perturb 20% of the tokens, as this represents a relatively high noise regime where one in five tokens are modified. In our translation perturbation, we choose to translate to Russian and then back to English for a powerful attack, as Russian and English are relatively different compared to Spanish and French, see e.g., Anttila (1972), etc.
In Table 3 and Figure 6, we evaluate the robustness of RBC and the distribution shift water- marking scheme to the perturbations. Notably, the LDPC and one-to-one RBC watermarks show the greatest robustness. They achieve consistent detectability with ∼60 tokens.