mlsanityData to 7 Oct 2026

Beyond Contrastive Learning: Synthetic Data Enables List-wise Training with Multiple Levels of Relevance

arXiv 2503.23239 ↗First posted 29 Mar 2025cs.IR cs.CL cs.LGcited by 4

On the map: Synthetic data and self-improvement for LLMs → LLM synthetic data generation

Abstract (arXiv)

Although synthetic data has changed various aspects of information retrieval (IR) pipelines, the main training paradigm remains: contrastive learning with binary relevance labels, where one positive document is compared against several negatives using the InfoNCE loss. This objective treats all documents that are not explicitly annotated as relevant on an equally negative footing, regardless of their actual degree of relevance, thus missing subtle nuances useful for ranking. To overcome this limitation, in this work, we forgo real documents and annotations and use large language models to directly generate synthetic documents that answer the MS MARCO queries according to several different levels of relevance. We also propose using Wasserstein distance as a more effective loss function for training transformer-based retrievers with graduated relevance labels. Our experiments on MS MARCO and BEIR benchmark show that our proposed approach outperforms conventional training with InfoNCE by a large margin. Without using any real documents, our method significantly improves self-supervised retrievers and is more robust to distribution shift compared to contrastive learning using real data. Our method also successfully integrates existing real data into the synthetic ranking context, further boosting the performance. Overall, we show that generating multi-level ranking contexts is a better approach to synthetic data generation for IR than just generating the standard positive and negative documents.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Placed in LLM synthetic data generation, one of 13 directions in Synthetic data and self-improvement for LLMs. Builds on 50 of its 78 references that are in the map. First posted on arXiv 29 Mar 2025.

Builds on

50 of 78 references.

References · 50

  1. 2024The Llama 3 Herd of Modelscited by 14,192
  2. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
  3. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  4. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  5. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
  6. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
  7. 2022Text Embeddings by Weakly-Supervised Contrastive Pre-trainingcited by 1,216
  8. 2021Unsupervised Dense Information Retrieval with Contrastive Learningcited by 1,203
  9. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
  10. 2023REPLUG: Retrieval-Augmented Black-Box Language Modelscited by 786
  11. 2024NV-Embed: Improved Techniques for Training LLMs as Generalist Embedding Modelscited by 466
  12. 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 410
38 more
  1. 2023Large Language Models are Effective Text Rankers with Pairwise Ranking Promptingcited by 302
  2. 2023Fine-Tuning LLaMA for Multi-Stage Text Retrievalcited by 271
  3. 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
  4. 2022Promptagator: Few-shot Dense Retrieval From 8 Examplescited by 233
  5. 2021Unsupervised Corpus Aware Language Model Pre-training for Dense Passage Retrievalcited by 203
  6. 2021RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-rankingcited by 175
  7. 2021Condenser: a Pre-training Architecture for Dense Retrievalcited by 162
  8. 2021Optimizing Dense Retrieval Model Training with Hard Negativescited by 154
  9. 2024BRIGHT: A Realistic and Challenging Benchmark for Reasoning-Intensive Retrievalcited by 153
  10. 2023RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!cited by 151
  11. 2020Augmented SBERT: Data Augmentation Method for Improving Bi-Encoders for Pairwise Sentence Scoring Taskscited by 136
  12. 2023Large language models can accurately predict searcher preferencescited by 129
  13. 2021GPL: Generative Pseudo Labeling for Unsupervised Domain Adaptation of Dense Retrievalcited by 119
  14. 2023Perspectives on Large Language Models for Relevance Judgmentcited by 84
  15. 2024NV-Retriever: Improving text embedding models with effective hard-negative miningcited by 83
  16. 2023InPars-v2: Large Language Models as Efficient Dataset Generators for Information Retrievalcited by 73
  17. 2025Rank1: Test-Time Compute for Reranking in Information Retrievalcited by 68
  18. 2018Learning a Deep Listwise Context Model for Ranking Refinementcited by 62
  19. 2024Attention in Large Language Models Yields Efficient Zero-Shot Re-Rankerscited by 42
  20. 2024Promptriever: Instruction-Trained Retrievers Can Be Prompted Like Language Modelscited by 39
  21. 2022Curriculum Learning for Dense Retrieval Distillationcited by 38
  22. 2024APEER: Automatic Prompt Engineering Enhances Large Language Model Rerankingcited by 28
  23. 2024Learning to Generate Instruction Tuning Datasets for Zero-Shot Task Adaptationcited by 27
  24. 2023Large Language Models are Strong Zero-Shot Retrievercited by 25
  25. 2018Learning Groupwise Multivariate Scoring Functions Using Deep Neural Networkscited by 22
  26. 2024GenQREnsemble: Zero-Shot LLM Ensemble Prompting for Generative Query Reformulationcited by 22
  27. 2024Leveraging LLMs for Unsupervised Dense Retriever Rankingcited by 19
  28. 2025DRAMA: Diverse Augmentation from Large Language Models to Smaller Dense Retrieverscited by 19
  29. 2021TripClick: The Log Files of a Large Health Web Search Enginecited by 18
  30. 2025Rankers, Judges, and Assistants: Towards Understanding the Interplay of LLMs in Information Retrieval Evaluationcited by 15
  31. 2023Context Aware Query Rewriting for Text Rankers using LLMcited by 14
  32. 2023Can Query Expansion Improve Generalization of Strong Cross-Encoder Rankers?cited by 12
  33. 2025Can Generative LLMs Create Query Variants for Test Collections? An Exploratory Studycited by 10
  34. 2023Dense Retrieval Adaptation using Target Domain Descriptioncited by 8
  35. 2025Judging the Judges: A Collection of LLM-Generated Relevance Judgementscited by 6
  36. 2023Enhancing the Ranking Context of Dense Retrieval Methods through Reciprocal Nearest Neighborscited by 5
  37. 2021CODER: An efficient framework for improving retrieval through COntextual Document Embedding Rerankingcited by 4
  38. 2020Wasserstein Distance Regularized Sequence Representation for Text Matching in Asymmetrical Domainscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 2.

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Enhancing Transformer-Based Rerankers with Synthetic Data and LLM-Based Supervision
  2. 2025On Synthetic Data Strategies for Domain-Specific Generative Retrieval
  3. 2025InPars+: Supercharging Synthetic Data Generation for Information Retrieval Systems
  4. 2023InPars Toolkit: A Unified and Reproducible Synthetic Data Generation Pipeline for Neural Information Retrieval
  5. 2025Supervised Fine-Tuning or Contrastive Learning? Towards Better Multimodal LLM Reranking
  6. 2025ListConRanker: A Contrastive Text Reranker with Listwise Encoding
  7. 2026CRE-T1 Preview Technical Report: Beyond Contrastive Learning for Reasoning-Intensive Retrieval
  8. 2026Training Dense Retrievers with Multiple Positive Passages