mlsanityData to 7 Oct 2026

Embedding And Clustering Your Data Can Improve Contrastive Pretraining

arXiv 2407.18887 ↗First posted 26 Jul 2024cs.LG cs.CLcited by 17

Not on the map. Why?

Abstract (arXiv)

Recent studies of large-scale contrastive pretraining in the text embedding domain show that using single-source minibatches, rather than mixed-source minibatches, can substantially improve overall model accuracy. In this work, we explore extending training data stratification beyond source granularity by leveraging a pretrained text embedding model and the classic k-means clustering algorithm to further split training data apart by the semantic clusters within each source. Experimentally, we observe a notable increase in NDCG@10 when pretraining a BERT-based text embedding model on query-passage pairs from the MSMARCO passage retrieval dataset. Additionally, we conceptually connect our clustering approach to both the Topic Aware Sampling (TAS) aspect of the TAS-B methodology and the nearest-neighbor-based hard-negative mining aspect of the ANCE methodology and discuss how this unified view motivates future lines of research on the organization of contrastive pretraining data.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). Builds on 8 of its 11 references that are in the map. First posted on arXiv 26 Jul 2024.

Builds on

8 of 11 references.

References · 8

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  3. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
  4. 2022Text Embeddings by Weakly-Supervised Contrastive Pre-trainingcited by 1,216
  5. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
  6. 2024Nomic Embed: Training a Reproducible Long Context Text Embeddercited by 255
  7. 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
  8. 2023Mini-Batch Optimization of Contrastive Losscited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 9; 2026: 5.

17 papers.

Sort:

By area:

  1. 2024Improved Large Language Model Jailbreak Detection via Pretrained Embeddingscited by 10
  2. 2025Stronger Baselines for Retrieval-Augmented Generation with Long-Context Language Modelscited by 9
  3. 2025Building High-Quality Datasets for Portuguese LLMs: From Common Crawl Snapshots to Industrial-Grade Corporacited by 7
  4. 2025LexSemBridge: Fine-Grained Dense Representation Enhancement through Token-Aware Embedding Augmentationcited by 5
  5. 2025DRAGON: Domain-specific Robust Automatic Data Generation for RAG Optimizationcited by 4
  6. 2025DisastIR: A Comprehensive Information Retrieval Benchmark for Disaster Managementcited by 3
  7. 2026Overview of the TREC 2025 Retrieval Augmented Generation (RAG) Trackcited by 3
  8. 2024OnlySportsLM: Optimizing Sports-Domain Language Models with SOTA Performance under Billion Parameterscited by 2
  9. 2025Learning Task-Agnostic Representations through Multi-Teacher Distillationcited by 2
  10. 2024ICLERB: In-Context Learning Embedding and Reranker Benchmarkcited by 1
  11. 2025SHRAG: AFrameworkfor Combining Human-Inspired Search with RAGcited by 1
  12. 2026DARE: Aligning LLM Agents with the R Statistical Ecosystem via Distribution-Aware Retrievalcited by 1
5 more
  1. 2026Is a Document Educational or Just Wikipedia-Style? -- Pitfalls of Classifier-Based Quality Filteringcited by 1
  2. 2026LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attentioncited by 1
  3. 2025Plan-and-Refine: Diverse and Comprehensive Retrieval-Augmented Generationcited by 0
  4. 2025GraphMatch: Fusing Language and Graph Representations in a Dynamic Two-Sided Work Marketplacecited by 0
  5. 2026EmbeddingRWKV: State-Centric Retrieval with Reusable Statescited by 0