vix.ing · top · new · best · stats · spec

Language Models are Injective and Hence Invertible

2025/10/17 by Giorgos Nikolaou, Tommaso Mencattini, Nikolaou, Giorgos +9 · 43 voices · 5 citations
#cs.LG #cs.AI

paper · pdf · doi:10.48550/arxiv.2510.15511

Abstract

Transformer components such as non-linear activations and normalization are inherently non-injective, suggesting that different inputs could map to the same output and prevent exact recovery of the input from a model's representations. In this paper, we challenge this view. First, we prove mathematically that transformer language models mapping discrete input sequences to their corresponding sequence of continuous representations are injective and therefore lossless, a property established at initialization and preserved during training. Second, we confirm this result empirically through billions of collision tests on six state-of-the-art language models, and observe no collisions. Third, we operationalize injectivity: we introduce SipIt, the first algorithm that provably and efficiently reconstructs the exact input text from hidden activations, establishing linear-time guarantees and demonstrating exact invertibility in practice. Overall, our work establishes injectivity as a fundamental and exploitable property of language models, with direct implications for transparency, interpretability, and safe deployment.

Citations

Cited by

Discussions

Related