mlsanityData to 7 Oct 2026

ListConRanker: A Contrastive Text Reranker with Listwise Encoding

arXiv 2501.07111 ↗First posted 13 Jan 2025cs.CL cs.IRcited by 3

On the map: Retrieval-augmented generation → Generation and context integration

Abstract (arXiv)

Reranker models aim to re-rank the passages based on the semantics similarity between the given query and passages, which have recently received more attention due to the wide application of the Retrieval-Augmented Generation. Most previous methods apply pointwise encoding, meaning that it can only encode the context of the query for each passage input into the model. However, for the reranker model, given a query, the comparison results between passages are even more important, which is called listwise encoding. Besides, previous models are trained using the cross-entropy loss function, which leads to issues of unsmooth gradient changes during training and low training efficiency. To address these issues, we propose a novel Listwise-encoded Contrastive text reRanker (ListConRanker). It can help the passage to be compared with other passages during the encoding process, and enhance the contrastive information between positive examples and between positive and negative examples. At the same time, we use the circle loss to train the model to increase the flexibility of gradients and solve the problem of training efficiency. Experimental results show that ListConRanker achieves state-of-the-art performance on the reranking benchmark of Chinese Massive Text Embedding Benchmark, including the cMedQA1.0, cMedQA2.0, MMarcoReranking, and T2Reranking datasets.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Placed in Generation and context integration, one of 15 directions in Retrieval-augmented generation. Builds on 24 of its 35 references that are in the map. First posted on arXiv 13 Jan 2025.

Builds on

24 of 35 references.

Closest ancestors · 1

Same direction, newest first

  1. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks22 May

Other references · 23

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2020Scaling Laws for Neural Language Modelscited by 6,411
  4. 2021Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolationcited by 1,085
  5. 2023Extending Context Window of Large Language Models via Positional Interpolationcited by 721
  6. 2019Passage Re-ranking with BERTcited by 629
  7. 2023C-Pack: Packed Resources For General Chinese Embeddingscited by 556
  8. 2020Circle Loss: A Unified Perspective of Pair Similarity Optimizationcited by 402
  9. 2020Document Ranking with a Pretrained Sequence-to-Sequence Modelcited by 373
  10. 2024Retrieval-Augmented Generation for AI-Generated Content: A Surveycited by 352
  11. 2021XL-Sum: Large-Scale Multilingual Abstractive Summarization for 44 Languagescited by 346
  12. 2023Large Language Models are Effective Text Rankers with Pairwise Ranking Promptingcited by 302
11 more
  1. 2022Improving Passage Retrieval with Zero-Shot Question Generationcited by 164
  2. 2020The Multilingual Amazon Reviews Corpuscited by 142
  3. 2021mMARCO: A Multilingual Version of the MS MARCO Passage Ranking Datasetcited by 116
  4. 2019Deeper Text Understanding for IR with Contextual Neural Language Modelingcited by 111
  5. 2019A Deep Look into Neural Ranking Models for Information Retrievalcited by 79
  6. 2021Rethink Training of BERT Rerankers in Multi-Stage Retrieval Pipelinecited by 65
  7. 2023T2Ranking: A large-scale Chinese Benchmark for Passage Rankingcited by 59
  8. 2019SetRank: Learning a Permutation-Invariant Ranking Model for Information Retrievalcited by 48
  9. 2022CSL: A Large-scale Chinese Scientific Literature Datasetcited by 45
  10. 2022ERNIE-Search: Bridging Cross-Encoder with Dual-Encoder via Self On-the-fly Distillation for Dense Passage Retrievalcited by 41
  11. 2024Conan-embedding: General Text Embedding with More and Better Negative Samplescited by 15

Built on by

Cited by year

Citing papers per year: 2025: 3.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Efficient Listwise Reranking with Compressed Document Representations
  2. 2025Rank-K: Test-Time Reasoning for Listwise Reranking
  3. 2026ResRank: Unifying Retrieval and Listwise Reranking via End-to-End Joint Training with Residual Passage Compression
  4. 2024Leveraging Passage Embeddings for Efficient Listwise Reranking with Large Language Models
  5. 2025GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs
  6. 2025Supervised Fine-Tuning or Contrastive Learning? Towards Better Multimodal LLM Reranking
  7. 2025DeAR: Dual-Stage Document Reranking with Reasoning Agents via LLM Distillation
  8. 2025Embedding-Based Context-Aware Reranker