On the Information-Theoretic Limits of Latent-Space Watermarking Through Pretrained Generators

arXiv:2609.24377 · cs.IT, cs.LG, math.IT · Submitted 2026-09-21 · Read on arXiv

cs.IT, cs.LG, math.IT

Submitted: 2026-09-21

Updated: 2026-09-21

Comments: Submitted to the IEEE Transactions on Information Theory for possible publication

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Robustness — 14× in this paper · explained in 5 episodes
• Adaptation — 5× in this paper · explained in 1 episode
• Diffusion Model — 4× in this paper · explained in 8 episodes
• Diffusion Models — 4× in this paper · explained in 6 episodes
• Generative Model — 3× in this paper · explained in 2 episodes
• Decode — 2× in this paper · explained in 2 episodes
• IEEE International Symposium on Information Theory — 2× in this paper
• International Conference on Learning Representations — 2× in this paper
• Latent Diffusion Model — 2× in this paper · explained in 2 episodes
• Latent Diffusion Models — 2× in this paper · explained in 2 episodes
• Latent Representation — 2× in this paper · explained in 2 episodes
• Latent Space — 2× in this paper · explained in 7 episodes
• Anisotropy — 1× in this paper · explained in 3 episodes
• Benchmark — 1× in this paper · explained in 2 episodes
• Benchmarking — 1× in this paper · explained in 3 episodes
• Error Exponents — 1× in this paper · explained in 2 episodes
• Fidelity — 1× in this paper · explained in 2 episodes
• Generative AI — 1× in this paper · explained in 2 episodes
• Generative Modeling — 1× in this paper · explained in 3 episodes
• Generative Models — 1× in this paper · explained in 2 episodes
• Latent Representations — 1× in this paper · explained in 3 episodes
• Provenance — 1× in this paper · explained in 3 episodes
• Quantization — 1× in this paper · explained in 12 episodes
• Resource Constraints — 1× in this paper · explained in 3 episodes

Sources

• Covert Multi-bit LLM Watermarking: An Information Theory and Coding Approach
• Optimized Couplings for Watermarking Large Language Models
• The Rate-Distortion-Perception Tradeoff: The Role of Common Randomness

Related papers

• Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
• Discrepancy for Random Linear Codes
• A New Approach to Code Smoothing Bounds
• Contextual Memory-Enhanced Source Coding for Low-SNR Communications
• Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels
• Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions