An Efficient Framework for Whole-Page Reranking via Single-Modal Supervision (2026.acl-industry)
Copied to clipboard
Zishuai Zhang, Sihao Yu, null Xiewenyi, Ying Nie, Junfeng Wang, Zhiming Zheng, Dawei Yin, Hainan Zhang
| Challenge: | Existing whole-page reranking methods require large-scale expert annotations to achieve high-quality results. |
| Approach: | They propose a whole-page reranking framework that converts single-modal rankers into page-level guidance by constructing budget-aware candidates for cross-modal annotations and distilling intra-modality preferences to align relevance scales across modalities. |
| Outcome: | The proposed framework reduces annotation costs by 70-90% while outperforming fully-annotated reranking baselines. |
Similar Papers
Retrieve Fast, Rerank Smart: Cooperative and Joint Approaches for Improved Cross-Modal Retrieval (2022.tacl-1)
Copied to clipboard
| Challenge: | Current approaches to cross-modal retrieval process text and visual input jointly . current approaches are pretrained from scratch and suffer from huge retrieval latency and inefficiency issues . |
| Approach: | They propose a cooperative retrieve-and-rerank framework that turns pretrained text-image multi-modal models into efficient retrieval models. |
| Outcome: | The proposed framework improves retrieval performance over current approaches . it uses twin networks to encode all items of a corpus and a cross-encoder component for a more nuanced ranking . |
Region-R1: Reinforcing Query-Side Region Cropping for Multi-Modal Re-Ranking (2026.findings-acl)
Copied to clipboard
| Challenge: | Multi-modal retrieval-augmented generation relies heavily on re-rankers to surface the most relevant evidence for image-question queries. |
| Approach: | They propose a query-side region cropping framework that makes region selection a decision-making problem during re-ranking. |
| Outcome: | The proposed framework learns to retain the full image or focus only on a question-relevant region before scoring the retrieved candidates. |
GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs (2026.findings-acl)
Copied to clipboard
Meixiu Long, Duolin Sun, Dan Yang, Yihan Jiao, Lei Liu, Jiahai Wang, Binbin Hu, Yue Shen, Jie Feng, Zhehao Tan, Junjie Wang, Lianzhen Zhong, Jian Wang, Peng Wei, Jinjie Gu
| Challenge: | Existing rankers excel in lexical-matching scenarios, while they struggle with complex queries requiring deep reasoning. |
| Approach: | They propose a new paradigm that balances flexibility and context awareness to unlock the full potential of groupwise reranking. |
| Outcome: | The proposed approach achieves a state-of-the-art 65.2 NDCG@10 on BRIGHT and surpasses baselines by 2.1 points on R2MED while delivering a 6.4 inference speedup. |
Self-Supervised Document Similarity Ranking via Contextualized Language Models and Hierarchical Inference (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to document-to-document similarity ranking are limited to relatively short documents or lack similarity labels. |
| Approach: | They propose a self-supervised method for document similarity ranking that can be applied to documents of arbitrary length. |
| Outcome: | The proposed model outperforms existing methods on large documents datasets. |
FAA: Fine-grained Attention Alignment for Cascade Document Ranking (2023.acl-long)
Copied to clipboard
| Challenge: | Contemporary document ranking methods focus on transforming documents into passages to handle long inputs, but intensive query-irrelevant content may lead to harmful distraction and high query latency. |
| Approach: | They propose a fine-grained attention alignment approach to jointly optimize a cascade document ranking model. |
| Outcome: | Experiments on MS MARCO and TREC DL show that the proposed method is effective in document ranking tasks. |
Modularized Transfomer-based Ranking Framework (2020.emnlp-main)
Copied to clipboard
| Challenge: | Recent innovations in Transformer-based ranking models have advanced the state-of-the-art in information retrieval. |
| Approach: | They propose to modularize a Transformer ranker into separate modules for text representation and interaction. |
| Outcome: | The proposed model is faster than previous models and is easier to interpret and understand. |
Ground Then Rank: Revisiting Knowledge-Based VQA with Training-Free Entity Identification (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing multi-modal retrieval augmented generation (MM-RAG) methods tightly couple entity discrimination and section-level evidence ranking into a single re-ranking stage, leading to high cost and limited generalization. |
| Approach: | They propose a framework that decouples entity identification from section-level re-ranking. |
| Outcome: | The proposed framework outperforms fine-tuned multi-modal re-ranking baselines while reducing training and inference complexity. |
Query-aware Multi-modal based Ranking Relevance in Video Search (2023.emnlp-industry)
Copied to clipboard
| Challenge: | Existing relevance ranking methods focus on text modality, incapable of fully exploiting cross-modal cues present in video. |
| Approach: | They propose a QUery-Aware pre-training model with multi-modality that integrates video tag information as alignment targets and enhances ranking optimization method based on ordinal regression. |
| Outcome: | The proposed model significantly improves video search performance. |
EcoRank: Budget-Constrained Text Re-ranking Using Large Language Models (2024.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated dominant performance in text re-ranking. |
| Approach: | They propose a suite of budget-constrained methods to perform text re-ranking using LLMs. |
| Outcome: | The proposed method outperforms other budget-aware methods on four datasets. |
Re3val: Reinforced and Reranked Generative Retrieval (2024.findings-eacl)
Copied to clipboard
| Challenge: | generative retrieval models encode pointers to information in a corpus as an index within the model’s parameters. |
| Approach: | They propose a generative retrieval model that leverages contextual information to rerank retrieved page titles and utilizes REINFORCE to maximize rewards generated by constrained decoding. |
| Outcome: | The proposed model can't be tuned for the downstream readers as decoding the page title is a non-differentiable operation. |