Corect: A Framework For Evaluating Embedding Compression Techniques At Scale

Abstract

Dense retrieval systems have proven to be effective across various benchmarks, but require substantial memory to store large search indices. Recent advances in embedding compression show that index sizes can be greatly reduced with minimal loss in ranking quality. However, existing studies often overlook the role of corpus complexity -- a critical factor, as recent work shows that both corpus size and document length strongly affect dense retrieval performance. In this paper, we introduce CoRECT (Controlled Retrieval Evaluation of Compression Techniques), a framework for large-scale evaluation of embedding compression methods, supported by a newly curated dataset collection. To demonstrate its utility, we benchmark eight representative types of compression methods. Notably, we show that non-learned compression achieves substantial index size reduction, even on up to 100M passages, with statistically insignificant performance loss. However, selecting the optimal compression method remai

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keycaspari2025corect

Related papers

• Experimental Analysis Of Large-scale Learnable Vector Storage Compression (2023)7.50
• CODER: An Efficient Framework For Improving Retrieval Through Contextual Document Embedding Reranking (2021)7.16
• Compressible And Searchable: Ai-native Multi-modal Retrieval System With Learned Image Compression (2024)0.00
• Scaling Laws For Embedding Dimension In Information Retrieval (2026)0.00
• Dimension Vs. Precision: A Comparative Analysis Of Autoencoders And Quantization For Efficient Vector Retrieval On BEIR Scifact (2025)0.00
• EHI: End-to-end Learning Of Hierarchical Index For Efficient Dense Retrieval (2023)0.00
• Dense Retrievers Can Fail On Simple Queries: Revealing The Granularity Dilemma Of Embeddings (2025)2.86
• Dimension Reduction For Efficient Dense Retrieval Via Conditional Autoencoder (2022)8.13