mlsanityData to 7 Oct 2026

Adversarial Sampling and Training for Semi-Supervised Information Retrieval

arXiv 1811.04155 ↗First posted 9 Nov 2018cs.IR cs.LGcited by 23

Not on the map. Why?

Abstract (arXiv)

Ad-hoc retrieval models with implicit feedback often have problems, e.g., the imbalanced classes in the data set. Too few clicked documents may hurt generalization ability of the models, whereas too many non-clicked documents may harm effectiveness of the models and efficiency of training. In addition, recent neural network-based models are vulnerable to adversarial examples due to the linear nature in them. To solve the problems at the same time, we propose an adversarial sampling and training framework to learn ad-hoc retrieval models with implicit feedback. Our key idea is (i) to augment clicked examples by adversarial training for better generalization and (ii) to obtain very informational non-clicked examples by adversarial sampling and training. Experiments are performed on benchmark data sets for common ad-hoc retrieval tasks such as Web search, item recommendation, and question answering. Experimental results indicate that the proposed approaches significantly outperform strong baselines especially for high-ranked documents, and they outperform IRGAN in NDCG@5 using only 5% of labeled data for the Web search task.

Key facts. Cited by 23 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Nov 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 4; 2023: 4; 2024: 5; 2025: 3; 2026: 3.

23 papers.

Sort:

By area:

  1. 2021ReconVAT: A Semi-Supervised Automatic Music Transcription Framework for Low-Resource Real-World Datacited by 20
  2. 2023On the Theories Behind Hard Negative Sampling for Recommendationcited by 18
  3. 2024Robust Neural Information Retrieval: An Adversarial and Out-of-distribution Perspectivecited by 15
  4. 2022Rethinking Collaborative Metric Learning: Toward an Efficient Alternative without Negative Samplingcited by 14
  5. 2024Does Negative Sampling Matter? A Review with Insights into its Theory and Applicationscited by 14
  6. 2025Unsupervised Corpus Poisoning Attacks in Continuous Space for Dense Retrievalcited by 11
  7. 2025Reproducing HotFlip for Corpus Poisoning Attacks in Dense Retrievalcited by 7
  8. 2021Learning Explicit User Interest Boundary for Recommendationcited by 6
  9. 2023Learning To Rank Resources with GNNcited by 6
  10. 2024From Overfitting to Robustness: Quantity, Quality, and Variety Oriented Negative Sample Selection in Graph Contrastive Learningcited by 4
  11. 2022Generating Negative Samples for Sequential Recommendationcited by 3
  12. 2023Towards More Robust and Accurate Sequential Recommendation with Cascade-guided Adversarial Trainingcited by 2
11 more
  1. 2023Dimension Independent Mixup for Hard Negative Sample in Collaborative Filteringcited by 2
  2. 2024FINEST: Stabilizing Recommendations by Rank-Preserving Fine-Tuningcited by 2
  3. 2026RAGuard: A Layered Defense Framework for Retrieval-Augmented Generation Systems Against Data Poisoningcited by 2
  4. 2022Bayesian Negative Sampling for Recommendationcited by 1
  5. 2022Towards Robust Recommender Systems via Triple Cooperative Defensecited by 1
  6. 2021Understanding the Effects of Adversarial Personalized Ranking Optimization Method on Recommendation Qualitycited by 0
  7. 2021Knowledge Graph-enhanced Sampling for Conversational Recommender Systemcited by 0
  8. 2024Securing Recommender System via Cooperative Trainingcited by 0
  9. 2025MixDec Sampling: A Soft Link-based Sampling Method of Graph Neural Network for Recommendationcited by 0
  10. 2026From Noise to Order: Learning to Rank via Denoising Diffusioncited by 0
  11. 2026Denoising Implicit Feedback for Cold-start Recommendationcited by 0