mlsanityData to 7 Oct 2026

Isotropic Representation Can Improve Dense Retrieval

arXiv 2209.00218 ↗First posted 1 Sep 2022cs.CLcited by 8

Not on the map. Why?

Abstract (arXiv)

The recent advancement in language representation modeling has broadly affected the design of dense retrieval models. In particular, many of the high-performing dense retrieval models evaluate representations of query and document using BERT, and subsequently apply a cosine-similarity based scoring to determine the relevance. BERT representations, however, are known to follow an anisotropic distribution of a narrow cone shape and such an anisotropic distribution can be undesirable for the cosine-similarity based scoring. In this work, we first show that BERT-based DR also follows an anisotropic distribution. To cope with the problem, we introduce unsupervised post-processing methods of Normalizing Flow and whitening, and develop token-wise method in addition to the sequence-wise method for applying the post-processing methods to the representations of dense retrieval models. We show that the proposed methods can effectively enhance the representations to be isotropic, then we perform experiments with ColBERT and RepBERT to show that the performance (NDCG at 10) of document re-ranking can be improved by 5.17%~8.09% for ColBERT and 6.88%~22.81% for RepBERT. To examine the potential of isotropic representation for improving the robustness of DR models, we investigate out-of-distribution tasks where the test dataset differs from the training dataset. The results show that isotropic representation can achieve a generally improved performance. For instance, when training dataset is MS-MARCO and test dataset is Robust04, isotropy post-processing can improve the baseline performance by up to 24.98%. Furthermore, we show that an isotropic model trained with an out-of-distribution dataset can even outperform a baseline model trained with the in-distribution dataset.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 28 of its 44 references that are in the map. First posted on arXiv 1 Sep 2022.

Builds on

28 of 44 references.

References · 28

  1. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  2. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  3. 2017Billion-scale similarity search with GPUscited by 2,477
  4. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
  5. 2018Glow: Generative Flow with Invertible 1x1 Convolutionscited by 1,539
  6. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
  7. 2014NICE: Non-linear Independent Components Estimationcited by 1,052
  8. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
  9. 2019How Contextual are Contextualized Word Representations? Comparing the Geometry of BERT, ELMo, and GPT-2 Embeddingscited by 770
  10. 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 464
  11. 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 410
  12. 2019Bridging Theory and Algorithm for Domain Adaptationcited by 332
16 more
  1. 2019Representation Degeneration Problem in Training Natural Language Generation Modelscited by 250
  2. 2020Revisiting Few-sample BERT Fine-tuningcited by 237
  3. 2017All-but-the-Top: Simple and Effective Postprocessing for Word Representationscited by 205
  4. 2021Whitening Sentence Representations for Better Semantics and Faster Retrievalcited by 198
  5. 2021RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-rankingcited by 175
  6. 2021All Bark and No Bite: Rogue Dimensions in Transformer Language Models Obscure Representational Qualitycited by 150
  7. 2021COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted Listcited by 113
  8. 2021BERT Busters: Outlier Dimensions that Disrupt Transformerscited by 110
  9. 2019CEDR: Contextualized Embeddings for Document Rankingcited by 77
  10. 2020RepBERT: Contextualized Text Embeddings for First-Stage Retrievalcited by 46
  11. 2021Robust Machine Learning Systems: Challenges, Current Trends, Perspectives, and the Road Aheadcited by 40
  12. 2020Positional Artefacts Propagate Through Masked Language Model Embeddingscited by 34
  13. 2021Rare Tokens Degenerate All Tokens: Improving Neural Text Generation via Adaptive Gradient Gating for Rare Token Embeddingscited by 27
  14. 2021Are Neural Ranking Models Robust?cited by 16
  15. 2018Ranking Robustness Under Adversarial Document Manipulationscited by 15
  16. 2021Semi-Siamese Bi-encoder Neural Ranking Model Using Lightweight Fine-Tuningcited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 1; 2024: 2; 2025: 1; 2026: 3.

8 papers.