KV-Embedding: Training-free Text Embedding via Internal KV Re-routing in Decoder-only LLMs
Yixuan Tang, Yi Yang
TL;DR
KV-Embedding tackles the problem of obtaining high-quality text embeddings from frozen decoder-only LLMs without fine-tuning. It leverages internal KV states by re-routing the final token’s KV pair as a global prefix in selected layers, enabling all tokens to access a sequence-wide summary in a single forward pass. An intrinsic dimensionality–based layer selection scheme identifies where semantic compression is maximal, ensuring model-agnostic applicability. Across MTEB and LoCoV1 benchmarks on Qwen, Mistral, and Llama backbones, KV-Embedding consistently outperforms training-free baselines by up to 10% and maintains robustness up to 4{,}096 tokens, while improving embedding space isotropy and semantic alignment. This work highlights the potential of internal state manipulation as an efficient alternative to input modification for representation learning in large language models.
Abstract
While LLMs are powerful embedding backbones, their application in training-free settings faces two structural challenges: causal attention restricts early tokens from accessing subsequent context, and the next-token prediction objective biases representations toward generation rather than semantic compression. To address these limitations, we propose KV-Embedding, a framework that activates the latent representation power of frozen LLMs. Our method leverages the observation that the key-value (KV) states of the final token at each layer encode a compressed view of the sequence. By re-routing these states as a prepended prefix, we enable all tokens to access sequence-level context within a single forward pass. To ensure model-agnostic applicability, we introduce an automated layer selection strategy based on intrinsic dimensionality. Evaluations on MTEB across Qwen, Mistral, and Llama backbones show that KV-Embedding outperforms existing training-free baselines by up to 10%, while maintaining robust performance on sequences up to 4,096 tokens. These results demonstrate that internal state manipulation offers an efficient alternative to input modification, and we hope this work encourages further exploration of LLM internals for representation learning.
