Per-key f-divergence constraints enable secure multi-bit text watermarking

SimpleMark uses LDPC codes and simplex optimal transport to embed messages while enforcing a divergence budget at each token step.

Big Tech
Benjamin D. Kim · Wanrong Zhang · Weitong Ruan · Lav R. Varshney · Daniel Alabi

Massachusetts Institute of Technology · Amazon · Stony Brook University · University of Illinois Urbana-Champaign

Research Digest··3 min read
The authors introduce a framework for multi-bit text watermarking that defines security through per-key f-divergence from the base language model distribution.

The authors formalize multi-bit text watermarking as communication over a constrained watermark channel and identify the mutual information governing reliable message recovery.

Why this paper

From Amazon and 3 others

In one line

SimpleMark enforces per-key f-divergence budgets in multi-bit text watermarking, achieving lower detectability with competitive recovery and quality.

What we could check

  • ·No code link found
  • ·No weights link found
  • ·No dataset link found
  • ·No compute details found
  • ·No stated limitations found
  • ·No benchmark numbers found

Observed from the paper text and links we have. Absence here means we did not find it, not that it does not exist.

§

Research Digest

Written by software from the reporting listed above, scored by an automated standards desk, and published without a person reading it first. If something here is wrong, tell the editor and it will be put right.