Simple linear translators between text embedding models work only for architecturally and training-similar pairs, so embedding spaces are not universally related by such maps.
Characterizing Linear Alignment Across Language Models
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Language models increasingly appear to learn similar representations, despite differences in training objectives, architectures, and data modalities. This emerging compatibility between independently trained models introduces new opportunities for cross-model alignment to downstream objectives. Moreover, this capability unlocks new potential application domains, such as settings where security, privacy, or competitive constraints prohibit direct data or model sharing. In this work, we investigate the extent to which representational convergence enables practical linear alignment between large language models. Specifically, we learn affine transformations between the final hidden states of independent models and empirically evaluate these mappings across text generation, embedding classification, and out-of-distribution detection. We find that performance is largely preserved across model pairs, and show for the first time that linear alignment sometimes enables text generation across independently trained models. We further highlight a potential application of linear alignment for privacy-preserving cross-silo inference. The framework learns an affine transformation over a shared public dataset and uses homomorphic encryption to protect client queries. By encrypting only the linear classification operation, the method achieves sub-second inference latency.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
How Far Do Simple Transformations Translate Across Text Embedding Models?
Simple linear translators between text embedding models work only for architecturally and training-similar pairs, so embedding spaces are not universally related by such maps.