This work proposes an LLM watermarking scheme \textit{WaterMoE} for the growingly popular Mixture-of-Experts (MoE) LLMs that achieves a fidelity performance close to the unwatermarked and consistently outperforms state-of-the-art watermarking methods on the benchmark.
Abstract
Large language models (LLMs) have achieved remarkable success but raise growing concerns about content provenance and misuse, motivating the need for reliable watermarking techniques. However, these techniques have rarely been adopted in practice mainly for two reasons: i) severely degraded model performance, and ii) additional inference overhead. To confirm the problem, we construct a comprehensive benchmark spanning different generation tasks to systematically evaluate 9 representative watermarking methods. We found almost all existing methods are designed for text fluency, but not for restricted and complicated tasks, and their overhead prevents them from deployment in latency-critical systems. To address i) and ii), we propose an LLM watermarking scheme \textit{WaterMoE} for the growingly popular Mixture-of-Experts (MoE) LLMs. WaterMoE embeds watermarking signals through controlled perturbation into the expert selection at each router, which accumulates to token selection shift at the final output. In contrast to watermarking as a post-processing token-sampling approach, WaterMoE embeds watermark within the inference loop incurring negligible quality degradation and computational overhead. Extensive experiments demonstrate that our method achieves a fidelity performance close to the unwatermarked and consistently outperforms state-of-the-art watermarking methods on the benchmark, with up to $4\times$ speedup, incurring merely 1\% additional inference latency compared to native generation. The results demonstrate the capability of WaterMoE to be deployed in real-world tasks.
This work introduces OpenStamp, a watermarking technique that encodes the watermarking logic directly into the model weights by modifying only the final projection, or unembedding, layer, and shows that OpenStamp achieves superior detection performance, with minimal degradation in model capabilities compared to prior m...
This work develops a novel multi-draft speculative sampling algorithm based on Poisson processes that maintains both watermark strength and sampling efficiency, and is the first multi-draft, drafter-invariant speculative sampling scheme that maintains both watermark strength and sampling efficiency.
Yan-Xiao Liu, Si-Cheng Wan, Zhan Gao et al.· 1 citation
WeaveMark, a robust and scalable multi-bit LLM watermarking scheme based on coded payload spreading, improves payload capacity through multi-bit-per-token spreading (weaving), improving extraction accuracy through soft-decision error-correcting codes, and preserving text quality through unbiased multilayer reweighting.
Gang-Hyun Park, Ju-Hyeong Lee, Heeyoul Kwak et al.· 0 citations
ROSETTA is proposed, a hybrid CKKS/TFHE framework that overcomes inefficiency in evaluating nonlinear operations, which incur substantial overhead and dominate the decode stage and achieves up to $4.8\times$ Softmax speedup and $1.5$--$2.1\times$ end-to-end speedup over the SOTA framework CacheMir.
Jiang-Rui Yu, Bao-Sheng Zhang, Liang Kong et al.· 1 citation
The Adaptive Knowledge Distillation Framework (AKDF), a unified training approach that simultaneously com-presses LLMs and embeds ownership signals for copyright assurance, is introduced, providing a practical path to-ward bandwidth-efficient and ownership-aware deployment of large-scale language models.
Feng Jiang, Hong-Hui Xu, Daehee Seo et al.· Tsinghua Science and Technol...· 0 citations
Stateless Bernoulli Watermarking (SBW) is introduced, a new statistical watermark for Large Language Models that determines green list membership through independent per-token Bernoulli trials, reducing membership complexity to $O(1)$ and enabling single-kernel execution with zero intermediate allocations.
Simone Ceppi, Ignacio Sanchez· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.