Pith. sign in

REVIEW 2 cited by

Embedding And Clustering Your Data Can Improve Contrastive Pretraining

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.18887 v1 pith:FUGD3Y2U submitted 2024-07-26 cs.LG cs.CL

classification cs.LGcs.CL
keywords dataembeddingpretrainingclusteringcontrastivemodeltextaspect
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector

    cs.DB 2026-04 unverdicted novelty 7.0 of 10

    BBC improves large-k ANN efficiency via bucketed candidate buffers and optimized re-ranking, delivering up to 3.8x speedup at recall@k=0.95.

  2. LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention

    cs.LG 2026-07 reject novelty 6.0 of 10

    LiteTopK uses high-dimensional score concentration to bin candidates online and fuse Indexer-TopK with exact correctness and lower memory traffic.

Pith tools