ExpertRank: A Multi-level Coarse-grained Expert-based Listwise Ranking Loss
On the map: Mixture-of-experts → MoE large language models
Abstract (arXiv)
The goal of information retrieval is to recommend a list of document candidates that are most relevant to a given query. Listwise learning trains neural retrieval models by comparing various candidates simultaneously on a large scale, offering much more competitive performance than pairwise and pointwise schemes. Existing listwise ranking losses treat the candidate document list as a whole unit without further inspection. Some candidates with moderate semantic prominence may be ignored by the noisy similarity signals or overshadowed by a few especially pronounced candidates. As a result, existing ranking losses fail to exploit the full potential of neural retrieval models. To address these concerns, we apply the classic pooling technique to conduct multi-level coarse graining and propose ExpertRank, a novel expert-based listwise ranking loss. The proposed scheme has three major advantages: (1) ExpertRank introduces the profound physics concept of coarse graining to information retrieval by selecting prominent candidates at various local levels based on model prediction and inter-document comparison. (2) ExpertRank applies the mixture of experts (MoE) technique to combine different experts effectively by extending the traditional ListNet. (3) Compared to other existing listwise learning approaches, ExpertRank produces much more reliable and competitive performance for various neural retrieval models with different complexities, from traditional models, such as KNRM, ConvKNRM, MatchPyramid, to sophisticated BERT/ALBERT-based retrieval models.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in MoE large language models, one of 12 directions in Mixture-of-experts. First posted on arXiv 29 Jul 2021.
Builds on
No reference list yet.
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025The Evolution of Reranking Models in Information Retrieval: From Heuristic Methods to Large Language Models
- 2026Towards a Relevance Posterior in Neural Information Access ↗
- 2025ListConRanker: A Contrastive Text Reranker with Listwise Encoding
- 2025Rank-K: Test-Time Reasoning for Listwise Reranking
- 2026ResRank: Unifying Retrieval and Listwise Reranking via End-to-End Joint Training with Residual Passage Compression
- 2023CAME: Competitively Learning a Mixture-of-Experts Model for First-stage Retrieval
- 2024Investigating Mixture of Experts in Dense Retrieval
- 2024Enhancing Retrieval Performance: An Ensemble Approach For Hard Negative Mining