Randomly Removing 50% of Dimensions in Text Embeddings has Minimal Impact on Retrieval and Classification Tasks
Sotaro Takeshita, Yurina Takeshita, Daniel Ruffinelli, Simone Paolo Ponzetto
TL;DR
The paper investigates why randomly removing up to 50% of embedding dimensions minimally affects downstream retrieval and classification, a pattern observed across 6 encoders and 26 tasks and related to truncations in language models. It combines empirical truncation experiments with analyses of anisotropy, dimensional collapse, outlier dimensions, and per-dimension attribution to understand the robustness. The findings reveal a substantial set of degrading dimensions that are broadly distributed, explaining why random removals cancel positive and negative contributions, with PCA offering similar benefits to random truncation. The work suggests inefficiencies in current representation spaces and points to opportunities for training objectives or architectures that reduce degrading dimensions, potentially enabling more compact representations without sacrificing performance for retrieval and classification tasks.
Abstract
In this paper, we study the surprising impact that truncating text embeddings has on downstream performance. We consistently observe across 6 state-of-the-art text encoders and 26 downstream tasks, that randomly removing up to 50% of embedding dimensions results in only a minor drop in performance, less than 10%, in retrieval and classification tasks. Given the benefits of using smaller-sized embeddings, as well as the potential insights about text encoding, we study this phenomenon and find that, contrary to what is suggested in prior work, this is not the result of an ineffective use of representation space. Instead, we find that a large number of uniformly distributed dimensions actually cause an increase in performance when removed. This would explain why, on average, removing a large number of embedding dimensions results in a marginal drop in performance. We make similar observations when truncating the embeddings used by large language models to make next-token predictions on generative tasks, suggesting that this phenomenon is not isolated to classification or retrieval tasks.
