K-semstamp A Clustering-based Semantic Watermark For Detection Of Machine-generated Text | Awesome Learning to Hash Add your paper to Learning2Hash

K-semstamp A Clustering-based Semantic Watermark For Detection Of Machine-generated Text

Hou Abe Bohan, Zhang Jingyu, Wang Yichen, Khashabi Daniel, He Tianxing. Arxiv 2024

[Paper]    
ARXIV LSH Unsupervised

Recent watermarked generation algorithms inject detectable signatures during language generation to facilitate post-hoc detection. While token-level watermarks are vulnerable to paraphrase attacks, SemStamp (Hou et al., 2023) applies watermark on the semantic representation of sentences and demonstrates promising robustness. SemStamp employs locality-sensitive hashing (LSH) to partition the semantic space with arbitrary hyperplanes, which results in a suboptimal tradeoff between robustness and speed. We propose k-SemStamp, a simple yet effective enhancement of SemStamp, utilizing k-means clustering as an alternative of LSH to partition the embedding space with awareness of inherent semantic structure. Experimental results indicate that k-SemStamp saliently improves its robustness and sampling efficiency while preserving the generation quality, advancing a more effective tool for machine-generated text detection.

Similar Work