The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Models
Open accessAbstract
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 distribution over documents via the signals from the discriminative model, and (ii) the discriminative model is able to exploit the unlabelled data selected by the generative model to achieve a better estimation for document ranking. Our experimental results have demonstrated significant performance gains as much as 23.96% on [email protected] and 15.50% on MAP over strong baselines in a variety of applications including web search, item recommendation, and question answering.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Distributed Representations of Words and Phrases and their Compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1310.4546 · Cited by 24,533
Conditional Generative Adversarial Nets
Mirza, M., & Osindero, S. (2014) · arXiv · doi:10.48550/arxiv.1411.1784 · Cited by 8,863
Improved Techniques for Training GANs
Salimans, T., Goodfellow, I., Zaremba, W., Cheung, V., Radford, A., & Chen, X. (2016) · arXiv · doi:10.48550/arxiv.1606.03498 · Cited by 6,965
Probabilistic latent semantic indexing
Hofmann, T. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312649 · Cited by 3,976
Optimizing search engines using clickthrough data
Joachims, T. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775067 · Cited by 3,873
Deep Neural Networks for YouTube Recommendations
Covington, P., Adams, J., & Sargin, E. (2016) · Proceedings of the 10th ACM Conference on Recommender Systems · doi:10.1145/2959100.2959190 · Cited by 3,539
Rendle, S. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.127 · Cited by 3,189
Learning to rank using gradient descent
Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102363 · Cited by 2,836
Learning to rank: from pairwise approach to listwise approach
Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., & Li, H. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273513 · Cited by 1,960
A language modeling approach to information retrieval
Ponte, J. M., & Croft, W. B. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.291008 · Cited by 1,821 · cited 1×
“One possible direction is to delve into the word weighting schemes such as [32, 35, 48] learned from the IRGAN generative retrieval model and then derive new ranking features on that basis.”
Background
Cited by
Deep Learning Based Recommender System: A Survey and New Perspectives
Zhang, S., Yao, L., Sun, A., & Tay, Y. (2020) · ACM Computing Surveys · doi:10.1145/3285029 · Cited by 3,485
A Review on Generative Adversarial Networks: Algorithms, Theory, and Applications
Gui, J., Sun, Z., Wen, Y., Tao, D., & Ye, J. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3130191 · Cited by 1,231
Bias and Debias in Recommender System: A Survey and Future Directions
Chen, J., Dong, H., Wang, X., Feng, F., Wang, M., & He, X. (2023) · ACM Transactions on Information Systems · doi:10.1145/3564284 · Cited by 741
“An example is the adaptive negative sampler [40], [41], [42], [43], which aims to over-sample the “difficult” instances in order to increase learning speed, even though the resultant loss function will differ significantly from the original.”
BackgroundGraphGAN: Graph Representation Learning With Generative Adversarial Nets
Wang, H., Wang, J., Wang, J., Zhao, M., Zhang, W., Zhang, F., Xie, X., & Guo, M. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11872 · Cited by 653
Self-citationTexygen: A Benchmarking Platform for Text Generation Models
Zhu, Y., Lu, S., Zheng, L., Guo, J., Zhang, W., Wang, J., & Yu, Y. (2018) · The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval · doi:10.1145/3209978.3210080 · Cited by 408
Self-citationRecommendation system based on deep learning methods: a systematic review and new directions
Da’u, A., & Salim, N. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-019-09744-1 · Cited by 402
Adversarial Personalized Ranking for Recommendation
He, X., He, Z., Du, X., & Chua, T.-S. (2018) · The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval · doi:10.1145/3209978.3209981 · Cited by 376
A Survey on Generative Adversarial Networks: Variants, Applications, and Training
Jabbar, A., Li, X., & Omar, B. (2022) · ACM Computing Surveys · doi:10.1145/3463475 · Cited by 360
Deep Joint-Semantics Reconstructing Hashing for Large-Scale Unsupervised Cross-Modal Retrieval
Su, S., Zhong, Z., & Zhang, C. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00312 · Cited by 342
An Introduction to Neural Information Retrieval
Mitra, B., & Craswell, N. (2018) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000061 · Cited by 317
CM-GANs: Cross-modal Generative Adversarial Networks for Common Representation Learning
Peng, Y., & Qi, J. (2019) · ACM Transactions on Multimedia Computing, Communications, and Applications · doi:10.1145/3284750 · Cited by 290
Wang, W., Xu, Y., Feng, F., Lin, X., He, X., & Chua, T.-S. (2023) · Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3539618.3591663 · Cited by 285
Self-citationA Comprehensive Review on Fake News Detection With Deep Learning
Mridha, M. F., Keya, A. J., Hamid, M. A., Monowar, M. M., & Rahman, M. S. (2021) · IEEE Access · doi:10.1109/access.2021.3129329 · Cited by 281
Collaborative Memory Network for Recommendation Systems
Ebesu, T., Shen, B., & Fang, Y. (2018) · The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval · doi:10.1145/3209978.3209991 · Cited by 275
A Survey of Recommender Systems Based on Deep Learning
Mu, R. (2018) · IEEE Access · doi:10.1109/access.2018.2880197 · Cited by 254
KBGAN: Adversarial Learning for Knowledge Graph Embeddings
Cai, L., & Wang, W. Y. (2018) · Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers) · doi:10.18653/v1/n18-1133 · Cited by 164
Understanding Negative Sampling in Graph Representation Learning
Yang, Z., Ding, M., Zhou, C., Yang, H., Zhou, J., & Tang, J. (2020) · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3394486.3403218 · Cited by 159
Adversarial attacks on an oblivious recommender
Christakopoulou, K., & Banerjee, A. (2019) · Proceedings of the 13th ACM Conference on Recommender Systems · doi:10.1145/3298689.3347031 · Cited by 105
Multi-pathway generative adversarial hashing for unsupervised cross-modal retrieval
Zhang, J., & Peng, Y. (2020) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2019.2922128 · Cited by 103
Gray-Box Shilling Attack: An Adversarial Learning Approach
Wang, Z., Gao, M., Li, J., Zhang, J., & Zhong, J. (2022) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3512352 · Cited by 28
Personalized Negative Reservoir for Incremental Learning in Recommender Systems
Valkanas, A., Wang, Y., Zhang, Y., & Coates, M. (2024) · arXiv · doi:10.48550/arxiv.2403.03993 · Cited by 1
Metadata
- Authors
- Wang, J., Yu, L., Zhang, W., Gong, Y., Xu, Y., Wang, B., Zhang, P., & Zhang, D.
- Venue
- Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval
- Publisher
- ACM
- Published
- 2017-08-07
- Pages
- 515-524
- OpenAlex
- W2619206542
- Cited by
- 567
- References
- 24
- FWCI
- 48.50
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.