REVIEW 2 cited by
GumbelSoft: Diversified Language Model Watermarking via the GumbelMax-trick
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Large language models (LLMs) excellently generate human-like text, but also raise concerns about misuse in fake news and academic dishonesty. Decoding-based watermark, particularly the GumbelMax-trick-based watermark(GM watermark), is a standout solution for safeguarding machine-generated texts due to its notable detectability. However, GM watermark encounters a major challenge with generation diversity, always yielding identical outputs for the same prompt, negatively impacting generation diversity and user experience. To overcome this limitation, we propose a new type of GM watermark, the Logits-Addition watermark, and its three variants, specifically designed to enhance diversity. Among these, the GumbelSoft watermark (a softmax variant of the Logits-Addition watermark) demonstrates superior performance in high diversity settings, with its AUROC score outperforming those of the two alternative variants by 0.1 to 0.3 and surpassing other decoding-based watermarking methods by a minimum of 0.1.
Forward citations
Cited by 2 Pith papers
-
Selective Disclosure Watermarking for Large Language Models
HeRo recursively partitions the LLM vocabulary into a hierarchy, embedding multi-bit payloads across layers so that verifiers with different keys recover only their authorized portion while preserving the original sam...
-
Synchronization-Free Algebraic Fingerprints for Large Language Models: From Autoregressive to Diffusion Models
A proposed synchronization-free LLM watermark embeds identity bits as parity values of a Reed-Solomon polynomial evaluated at token-pair hashes, but its probabilistic guarantees rely on an unsupported balanced-evaluat...
Discussion (0). Continue with ORCID to comment.