mlsanityData to 14 Oct 2026

When Hard Negatives Hurt: Bridging the Generative-Discriminative Gap in Hard Negative Synthesis for Retrieval

arXiv 2606.01304 ↗First posted 31 May 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Hard negative mining has become the dominant strategy for training retrievers, yet it faces intrinsic limitations: negatives are bounded by corpus availability, selected by retriever score rather than diagnostic value, and increasingly contaminated by false positives as the retriever improves. LLM-based synthesis offers a principled alternative, where negatives that are unconstrained, targeted, and free from false positive risk. But we show that naively incorporating generated negatives into contrastive learning often degrades retrieval performance. We identify and formalize the root cause as a generative-discriminative gap: LLM generation optimizes for fluent, plausible text, while contrastive learning demands strategic violations of relevance at the decision boundary. Our analysis reveals two compounding failure modes: discriminative-agnostic generation, where the LLM lacks an explicit model of query information needs and defaults to generic or topic-drifted text that provides no contrastive signal; and source-dependent shortcuts, where distributional artifacts enable the model to distinguish negatives by origin rather than relevance, causing gradient drift that actively corrupts optimization. To close this gap, we propose CausalNeg consisting of two main modules: (1) CoT-guided counterfactual perturbation for data construction: decomposes why a document satisfies a query into explicit information requirements, then surgically violates individual requirements to construct negatives with controlled, interpretable hardness. (2) Query-view entropy maximization during training: disperses generated negatives across the similarity spectrum, minimizing the mutual information between source identity and similarity scores to suppress shortcut exploitation. We make our code publicly available at https://github.com/mzhangzhicheng/CausalNeg.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 36 of its 58 references that are in the map. First posted on arXiv 31 May 2026.

Builds on

36 of 58 references.

References · 36

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  2. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  3. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
  4. 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,754
  5. 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
  6. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,605
  7. 2025Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Modelscited by 1,261
  8. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
  9. 2024M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillationcited by 1,073
  10. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 849
  11. 2020Dataset Cartography: Mapping and Diagnosing Datasets with Training Dynamicscited by 425
  12. 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 413
24 more
  1. 2024SWIFT:A Scalable lightWeight Infrastructure for Fine-Tuningcited by 355
  2. 2023Improving Text Embeddings with Large Language Modelscited by 303
  3. 2020Pretrained Transformers for Text Ranking: BERT and Beyondcited by 267
  4. 2024On LLMs-Driven Synthetic Data Generation, Curation, and Evaluation: A Surveycited by 244
  5. 2021Optimizing Dense Retrieval Model Training with Hard Negativescited by 155
  6. 2024A Note on Shumailov et al. (2024): `AI Models Collapse When Trained on Recursively Generated Data'cited by 115
  7. 2024CoIR: A Comprehensive Benchmark for Code Information Retrieval Modelscited by 60
  8. 2022Describing Differences between Text Distributions with Natural Languagecited by 54
  9. 2025MMDocIR: Benchmarking Multimodal Retrieval for Long Documentscited by 43
  10. 2025Prismatic Synthesis: Gradient-based Data Diversification Boosts Generalization in LLM Reasoningcited by 40
  11. 2025Benchmarking Retrieval-Augmented Multimodal Generation for Document Question Answeringcited by 36
  12. 2024Perception Compressor: A Training-Free Prompt Compression Framework in Long Context Scenarioscited by 23
  13. 2022SimANS: Simple Ambiguous Negatives Sampling for Dense Text Retrievalcited by 21
  14. 2025GMSA: Enhancing Context Compression via Group Merging and Layer Semantic Alignmentcited by 21
  15. 2024Towards a Theoretical Understanding of Synthetic Data in LLM Post-Training: A Reverse-Bottleneck Perspectivecited by 15
  16. 2024SyNeg: LLM-Driven Synthetic Hard-Negatives for Dense Retrievalcited by 14
  17. 2024Bridging Relevance and Reasoning: Rationale Distillation in Retrieval-Augmented Generationcited by 13
  18. 2026COMI: Coarse-to-fine Context Compression via Marginal Information Gaincited by 13
  19. 2024TriSampler: A Better Negative Sampling Principle for Dense Retrievalcited by 10
  20. 2025Few-shot LLM Synthetic Data with Distribution Matchingcited by 10
  21. 2026Read As Human: Compressing Context via Parallelizable Close Reading and Skimmingcited by 10
  22. 2025Provably Improving Generalization of Few-Shot Models with Synthetic Datacited by 3
  23. 2026Beyond Position Bias: Shifting Context Compression from Position-Driven to Semantic-Drivencited by 3
  24. 2026Length-Adaptive Interest Network for Balancing Long and Short Sequence Modeling in CTR Predictioncited by 2

Built on by

Not cited yet.