AI
New Compression Method Shrinks Language Model Embeddings Without Sacrificing Search Performance
DIVE offers a more efficient way to compress high-dimensional embeddings while maintaining accuracy on standard retrieval benchmarks.
Researchers have developed a new approach to making language model embeddings smaller and cheaper to store and search. The technique, called DIVE (Dimensionality reduction with Implicit View Ensembles), combines a specialized neural adapter with a novel training strategy that avoids the typical problem of overfitting when labeled data is limited.
The Core Challenge#
Dense embeddings generated by large language models capture semantic meaning but consume significant computational and storage resources. Compressing these representations to lower dimensions traditionally requires careful supervised learning with plenty of labeled examples—a requirement that often goes unmet in real-world applications.
How DIVE Works#
The method uses three interrelated components that work together during training:
- A residual adapter that learns how to transform high-dimensional embeddings into more compact versions
- A self-limiting hinge loss that stops applying gradient updates once ranking constraints are satisfied, preventing unnecessary optimization
- Geometry distillation and coordinate-wise contrastive learning across implicit multi-head representations to maintain the geometric properties of the original embedding space
At deployment, only the main adapter head is used, keeping inference lightweight.
Empirical Results#
When tested on retrieval tasks across five standard benchmarks (the BEIR evaluation suite), DIVE outperformed six competing compression baselines at both 128-dimensional and 256-dimensional output sizes. The approach also exceeded performance of classical unsupervised methods like PCA and modern autoencoders, suggesting the learning strategy is fundamentally more effective than simpler alternatives.

