aspireai.
PUBLIC EDITION

Watermarking text with homoglyphs carried 3.3-fold more capacity in some scripts than others, and ordinary copy-paste widened the gap until a detector needed 93 code points of Lao against 2 for English

AspireAI community · arXiv (cs.CL, cs.CR, cs.CY)
Edit-based watermarks hide a signal in finished text rather than in how a model generates it, by swapping characters for visually similar homoglyphs or inserting invisible characters, and they never touch a tokenizer. That raises the question of whether they escape the documented gap in generation-time watermarking for lower-resourced languages; this paper measures it across 40 language varieties in 24 scripts and finds they do not. Capacity varies 3.3-fold and script accounts for 96 percent of that variation; within Latin script, resource level makes no detectable difference, but across scripts capacity rises with it, because lower-resourced languages tend to use scripts with few homoglyphs. Routine handling then widens the gap further: ordinary copy-paste strips invisible characters, after which a detector needs about 2 code points of English or Persian but 93 of Lao. The paper's own conclusion is that removing the tokenizer does not remove the inequity, only changes its source.
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.