paper-with-me

Papers

DiffuRank: Effective Document Reranking with Diffusion Language Models

2026-02-13 · Qi Liu, Kun Ai, Jiaxin Mao, Yanzhao Zhang, Mingxin Li, Dingkun Long, Pengjun Xie, Fengbin Zhu, Ji-Rong Wen arxiv

Recent advances in large language models (LLMs) have inspired new paradigms for document reranking. While this paradigm better exploits the reasoning and contextual understanding capabilities of LLMs, most existing LLM-based rerankers rely on autoregressive generation, which limits their efficiency and flexibility. In particular, token-by-token decoding incurs high latency, while the fixed left-to-right generation order causes early prediction errors to propagate and is difficult to revise. To address these limitations, we explore the use of diffusion language models (dLLMs) for document reranking and propose DiffuRank, a reranking framework built upon dLLMs. Unlike autoregressive models, dLLMs support more flexible decoding and generation processes that are not constrained to a left-to-right order, and enable parallel decoding, which may lead to improved efficiency and controllability. Specifically, we investigate three reranking strategies based on dLLMs: (1) a pointwise approach that uses dLLMs to estimate the relevance of each query-document pair; (2) a logit-based listwise approach that prompts dLLMs to jointly assess the relevance of multiple documents and derives ranking lists directly from model logits; and (3) a permutation-based listwise approach that adapts the canonical decoding process of dLLMs to the reranking tasks. For each approach, we design corresponding training methods to fully exploit the advantages of dLLMs. We evaluate both zero-shot and fine-tuned reranking performance on multiple benchmarks. Experimental results show that dLLMs achieve performance comparable to, and in some cases exceeding, that of autoregressive LLMs with similar model sizes. These findings demonstrate the promise of diffusion-based language models as a compelling alternative to autoregressive architectures for document reranking.

📄 PDF Abstract BibTeX arXiv:2602.12528

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Zero-Shot Cross-Lingual Reranking with Large Language Models for Low-Resource Languages

2023-12-26 · Mofetoluwa Adeyemi, Akintunde Oladipo, Ronak Pradeep, Jimmy Lin

Large language models (LLMs) have shown impressive zero-shot capabilities in various document reranking tasks. Despite their successful implementations, there is still a gap in existing literature on their effectiveness …

Cross-Lingual Information RetrievalInformation RetrievalRerankingRetrieval

LLM-Based Compact Reranking with Document Features for Scientific Retrieval

2025-05-19 · Runchu Tian, Xueqiang Xu, Bowen Jin, SeongKu Kang 외

Scientific retrieval is essential for advancing academic discovery. Within this process, document reranking plays a critical role by refining first-stage retrieval results. However, large language model (LLM) listwise re…

Large Language ModelRerankingRetrieval

View Selection for 3D Captioning via Diffusion Ranking

2024-04-11 · Tiange Luo, Justin Johnson, Honglak Lee

Scalable annotation approaches are crucial for constructing extensive 3D-text datasets, facilitating a broader range of applications. However, existing methods sometimes lead to the generation of hallucinated captions, c…

3D Object CaptioningHallucinationImage CaptioningQuestion Answering+2

Zero-Shot Listwise Document Reranking with a Large Language Model

2023-05-03 · Xueguang Ma, Xinyu Zhang, Ronak Pradeep, Jimmy Lin

Supervised ranking methods based on bi-encoder or cross-encoder architectures have shown success in multi-stage text ranking tasks, but they require large amounts of relevance judgments as training data. In this work, we…

Language ModelingLanguage ModellingLarge Language ModelReranking+1

Quality Estimation Reranking for Document-Level Translation

2025-10-10 · Krzysztof Mrozinski, Minji Kang, Ahmed Khota, Vincent Michael Sutanto 외 arxiv

Quality estimation (QE) reranking is a form of quality-aware decoding which aims to improve machine translation (MT) by scoring and selecting the best candidate from a pool of generated translations. While known to be ef…

Machine Translation