mlsanityData to 14 Oct 2026

Your UnEmbedding Matrix is Secretly a Feature Lens for Text Embeddings

arXiv 2606.07502 ↗First posted 5 Jun 2026cs.CL cs.IRcited by 1

Not on the map. Why?

Abstract (arXiv)

Large language models exhibit impressive zero-shot capabilities across a wide range of downstream tasks. However, they struggle to function as off-the-shelf embedding models, leading to suboptimal performance on massive text embedding benchmarks. In this paper, we identify a potential cause underlying this deficiency. Our motivation stems from an unexpected observation: text embeddings tend to align with frequent but uninformative tokens when projected onto the vocabulary space. We argue that this excessive expression of high-frequency tokens suppresses the model's ability to capture nuanced semantics. To address this, we introduce EmbedFilter, a simple linear transformation designed to refine text embeddings derived from LLMs directly. Specifically, we uncover that the unembedding matrix within LLMs encodes a latent space that is actively writing these frequent tokens into embedding space. By filtering out this subspace, EmbedFilter suppress the influence of high-frequency tokens, thereby enhancing semantic representations. As a compelling byproduct, this enables an inherent dimensionality reduction, lowering index storage and speedup retrieval while fully preserving the refined embedding quality. Our experiments across multiple LLM backbones demonstrate that LLMs equipped with EmbedFilter achieve superior zero-shot downstream performance even with significantly reduced embedding dimensions. We hope our findings provide deeper insights into the mechanisms of LLM-based representations and inspire more principled designs to improve text embeddings training. Our code is available at https://github.com/CentreChen/EmbFilter.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 22 of its 33 references that are in the map. First posted on arXiv 5 Jun 2026.

Builds on

22 of 33 references.

References · 22

  1. 2020Scaling Laws for Neural Language Modelscited by 6,586
  2. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,173
  3. 2015A large annotated corpus for learning natural language inferencecited by 1,847
  4. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
  5. 2026DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligencecited by 1,040
  6. 2019How Contextual are Contextualized Word Representations? Comparing the Geometry of BERT, ELMo, and GPT-2 Embeddingscited by 784
  7. 2022MTEB: Massive Text Embedding Benchmarkcited by 640
  8. 2023Eliciting Latent Predictions from Transformers with the Tuned Lenscited by 623
  9. 2020Fact or Fiction: Verifying Scientific Claimscited by 554
  10. 2020SPECTER: Document-level Representation Learning using Citation-informed Transformerscited by 430
  11. 2024LLM2Vec: Large Language Models Are Secretly Powerful Text Encoderscited by 404
  12. 2022Matryoshka Representation Learningcited by 282
10 more
  1. 2021Unsupervised Corpus Aware Language Model Pre-training for Dense Passage Retrievalcited by 203
  2. 2021Whitening Sentence Representations for Better Semantics and Faster Retrievalcited by 202
  3. 2023Scaling Sentence Embeddings with Large Language Modelscited by 85
  4. 2020On the Sentence Embeddings from Pre-trained Language Modelscited by 83
  5. 2024Spectral Filters, Dark Signals, and Attention Sinkscited by 56
  6. 2024Your Mixture-of-Experts LLM Is Secretly an Embedding Model For Freecited by 37
  7. 2021Searching for Scientific Evidence in a Pandemic: An Overview of TREC-COVIDcited by 19
  8. 2024Meta-Task Prompting Elicits Embeddings from Large Language Modelscited by 16
  9. 2024GenEOL: Harnessing the Generative Power of LLMs for Training-Free Sentence Embeddingscited by 15
  10. 2024A Text is Worth Several Tokens: Text Embedding from LLMs Secretly Aligns Well with The Key Tokenscited by 8

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.