Setrank: Learning A Permutation-invariant Ranking Model For Information Retrieval

Abstract

In learning-to-rank for information retrieval, a ranking model is automatically learned from the data and then utilized to rank the sets of retrieved documents. Therefore, an ideal ranking model would be a mapping from a document set to a permutation on the set, and should satisfy two critical requirements: (1)~it should have the ability to model cross-document interactions so as to capture local context information in a query; (2)~it should be permutation-invariant, which means that any permutation of the inputted documents would not change the output ranking. Previous studies on learning-to-rank either design uni-variate scoring functions that score each document separately, and thus failed to model the cross-document interactions; or construct multivariate scoring functions that score documents sequentially, which inevitably sacrifice the permutation invariance requirement. In this paper, we propose a neural learning-to-rank model called SetRank which directly learns a permutation-i

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keypang2019setrank

Related papers

• A Deep Look Into Neural Ranking Models For Information Retrieval (2019)17.73
• Few-shot Prompting For Pairwise Ranking: An Effective Non-parametric Retrieval Model (2024)5.84
• Neural Models For Information Retrieval (2017)0.00
• Neural Ranking Models For Document Retrieval (2021)11.08
• Towards Axiomatic Explanations For Neural Ranking Models (2021)10.35
• Curriculum Learning Strategies For IR: An Empirical Study On Conversation Response Ranking (2019)0.00
• An Attention-based Deep Net For Learning To Rank (2017)0.00
• On The Calibration And Uncertainty Of Neural Learning To Rank Models (2021)0.00