July 31, 2023, 1:10 a.m. | Rohith Kuditipudi, John Thickstun, Tatsunori Hashimoto, Percy Liang

cs.CR updates on arXiv.org arxiv.org

We propose a methodology for planting watermarks in text from an
autoregressive language model that are robust to perturbations without changing
the distribution over text up to a certain maximum generation budget. We
generate watermarked text by mapping a sequence of random numbers -- which we
compute using a randomized watermark key -- to a sample from the language
model. To detect watermarked text, any party who knows the key can align the
text to the random number sequence. We …

budget changing compute distribution free key language language models mapping numbers random random numbers text watermarks

Lead Security Engineer

@ JPMorgan Chase & Co. | Tampa, FL, United States

GTI Manager of Cybersecurity Operations

@ Grant Thornton | Tulsa, OK, United States

GCP Incident Response Engineer

@ Publicis Groupe | Dallas, Texas, United States

DevSecOps Engineer - CL - Santiago

@ Globant | Santiago de Chile, Santiago, CL

IT Security Analyst - State Government & Healthcare

@ NTT DATA | Little Rock, AR, US

Exploit Developer

@ Peraton | Fort Meade, MD, United States