IRGAN: A Minimax Game For Unifying Generative And Discriminative Information Retrieval Models

Abstract

This paper provides a unified account of two schools of thinking in information retrieval modelling: the generative retrieval focusing on predicting relevant documents given a query, and the discriminative retrieval focusing on predicting relevancy given a query-document pair. We propose a game theoretical minimax game to iteratively optimise both models. On one hand, the discriminative model, aiming to mine signals from labelled and unlabelled data, provides guidance to train the generative model towards fitting the underlying relevance distribution over documents given the query. On the other hand, the generative model, acting as an attacker to the current discriminative model, generates difficult examples for the discriminative model in an adversarial way by minimising its discrimination objective. With the competition between these two models, we show that the unified framework takes advantage of both schools of thinking: (i) the generative model learns to fit the relevance distrib

Stats

• citations491
• S2 citations—
• github stars0
• HF likes0
• heat score20.19
• arxiv keywang2017irgan

Related papers

• Generative Adversarial Nets For Information Retrieval: Fundamentals And Advances (2018)0.00
• Irgen: Generative Modeling For Image Retrieval (2023)7.16
• Lightweight And Direct Document Relevance Optimization For Generative Information Retrieval (2025)4.52
• Generative Retrieval Meets Multi-graded Relevance (2024)2.26
• Scalable And Effective Generative Information Retrieval (2023)10.48
• Does Generative Retrieval Overcome The Limitations Of Dense Retrieval? (2025)0.00
• Differentiable Geometric Indexing For End-to-end Generative Retrieval (2026)0.00
• Uniir: Training And Benchmarking Universal Multimodal Information Retrievers (2023)10.48