aspireai.
PUBLIC EDITION

Multi-bit watermarking for images that already exist, with no retraining

AspireAI community · arXiv
Watermarking methods trade off against each other: applying to pre-existing images, multi-bit capacity, training-free deployment, and resilience to attack. This paper proposes a training-free framework that uses the overcompleteness of diffusion latent spaces to embed multi-bit payloads into arbitrary images while preserving visual quality. Decoding combines magnitude-weighted majority voting with BCH and Chase decoding to survive channel noise, and the adversarial side adds a steganalysis-resistant noise camouflage layer plus a dual-layer forgery defence combining perceptual hashing with a Reed-Solomon fuzzy commitment over CLIP features. Reported results cover natural and AI-generated images at 32 to 128 bit capacity, a 94.6% decode rate against CtrlRegen+ regeneration attacks, and 98.8% forgery-detection accuracy. The practical value is the combination: capacity and post-hoc applicability usually cost each other, and this one claims both.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.