Zipfian Whitening
Not on the map. Why?
Abstract (arXiv)
The word embedding space in neural models is skewed, and correcting this can improve task performance. We point out that most approaches for modeling, correcting, and measuring the symmetry of an embedding space implicitly assume that the word frequencies are uniform; in reality, word frequencies follow a highly non-uniform distribution, known as Zipf's law. Surprisingly, simply performing PCA whitening weighted by the empirical word frequency that follows Zipf's law significantly improves task performance, surpassing established baselines. From a theoretical perspective, both our approach and existing methods can be clearly categorized: word representations are distributed according to an exponential family with either uniform or Zipfian base measures. By adopting the latter approach, we can naturally emphasize informative low-frequency words in terms of their vector norm, which becomes evident from the information-geometric perspective, and in terms of the loss functions for imbalanced classification. Additionally, our theory corroborates that popular natural language processing methods, such as skip-gram negative sampling, WhiteningBERT, and headless language models, work well just because their word embeddings encode the empirical word frequency into the underlying probabilistic model.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 30 of its 61 references that are in the map. First posted on arXiv 1 Nov 2024.
Builds on
30 of 61 references.
References · 30
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
- 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,181
- 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,173
- 2016Enriching Word Vectors with Subword Informationcited by 1,583
- 2022Text Embeddings by Weakly-Supervised Contrastive Pre-trainingcited by 1,253
- 2017SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluationcited by 1,001
- 2019How Contextual are Contextualized Word Representations? Comparing the Geometry of BERT, ELMo, and GPT-2 Embeddingscited by 784
18 more
- 2022MTEB: Massive Text Embedding Benchmarkcited by 640
- 2020Long-tail learning via logit adjustmentcited by 618
- 2021ConSERT: A Contrastive Framework for Self-Supervised Sentence Representation Transfercited by 231
- 2017All-but-the-Top: Simple and Effective Postprocessing for Word Representationscited by 212
- 2019BPE-Dropout: Simple and Effective Subword Regularizationcited by 195
- 2024A Tale of Tails: Model Collapse as a Change of Scaling Lawscited by 130
- 2022Revisiting Over-smoothing in BERT from the Perspective of Graphcited by 72
- 2021WhiteningBERT: An Easy Unsupervised Sentence Embedding Approachcited by 69
- 2021IsoScore: Measuring the Uniformity of Embedding Space Utilizationcited by 53
- 2018FRAGE: Frequency-Agnostic Word Representationcited by 47
- 2020Word Rotator's Distancecited by 32
- 2018A Survey of Word Embeddings Evaluation Methodscited by 26
- 2015Measuring Word Significance using Distributed Representations of Wordscited by 21
- 2022Norm of Word Embedding Encodes Information Gaincited by 21
- 2023Transformer Language Models Handle Word Frequency in Prediction Headcited by 8
- 2020Improving Text Generation Evaluation with Batch Centering and Tempered Word Mover Distancecited by 5
- 2023Headless Language Models: Learning without Predicting with Contrastive Weight Tyingcited by 5
- 2023Contrastive Learning-based Sentence Encoders Implicitly Weight Informative Wordscited by 5
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.