An Efficient Framework for Whole-Page Reranking via Single-Modal Supervision

• URL: http://arxiv.org/abs/2510.16803v1
• Date: Sun, 19 Oct 2025 11:58:24 GMT
• Title: An Efficient Framework for Whole-Page Reranking via Single-Modal Supervision
• Abstract summary: Whole-page reranking plays a critical role in shaping the user experience of search engines.<n>Existing methods mainly rely on large-scale human-annotated data.<n>We propose SMAR, a novel whole-page reranking framework.
• Score: 33.94227889598032
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The whole-page reranking plays a critical role in shaping the user experience of search engines, which integrates retrieval results from multiple modalities, such as documents, images, videos, and LLM outputs. Existing methods mainly rely on large-scale human-annotated data, which is costly to obtain and time-consuming. This is because whole-page annotation is far more complex than single-modal: it requires assessing the entire result page while accounting for cross-modal relevance differences. Thus, how to improve whole-page reranking performance while reducing annotation costs is still a key challenge in optimizing search engine result pages(SERP). In this paper, we propose SMAR, a novel whole-page reranking framework that leverages strong Single-modal rankers to guide Modal-wise relevance Alignment for effective Reranking, using only limited whole-page annotation to outperform fully-annotated reranking models. Specifically, high-quality single-modal rankers are first trained on data specific to their respective modalities. Then, for each query, we select a subset of their outputs to construct candidate pages and perform human annotation at the page level. Finally, we train the whole-page reranker using these limited annotations and enforcing consistency with single-modal preferences to maintain ranking quality within each modality. Experiments on the Qilin and Baidu datasets demonstrate that SMAR reduces annotation costs by about 70-90\% while achieving significant ranking improvements compared to baselines. Further offline and online A/B testing on Baidu APPs also shows notable gains in standard ranking metrics as well as user experience indicators, fully validating the effectiveness and practical value of our approach in real-world search scenarios.

Related papers

• Task-Adaptive Embedding Refinement via Test-time LLM Guidance [3.6468227618496627]
  We explore the effectiveness of an LLM-guided query refinement paradigm for extending the usability of embedding models to challenging zero-shot search and classification tasks.<n>Our approach refines the embedding representation of a user query using feedback from a generative LLM on a small set of documents.<n>We conduct extensive experiments with state-of-the-art text embedding models across a diverse set of challenging search and classification benchmarks.
  arXiv  Detail & Related papers  (2026-05-12T17:58:27Z)
• E2Rank: Your Text Embedding can Also be an Effective and Efficient Listwise Reranker [39.61739668491574]
  We propose a simple yet effective unified framework E2Rank, which extends a single text embedding model to perform both high-quality retrieval and listwise reranking.<n>By applying cosine similarity between the query and document embeddings as a unified ranking function, the listwise ranking prompt serves as an enhanced query enriched with signals from the top-K documents.<n>E2Rank achieves state-of-the-art results on the reasoning-intensive BRIGHT benchmark, with very low reranking latency.
  arXiv  Detail & Related papers  (2025-10-26T16:04:48Z)
• Generating Query-Relevant Document Summaries via Reinforcement Learning [5.651096645934245]
  ReLSum is a reinforcement learning framework designed to generate query-relevant summaries of product descriptions optimized for search relevance.<n>The framework employs a trainable large language model (LLM) to produce summaries, which are then used as input for a cross-encoder ranking model.<n> Experimental results demonstrate significant improvements in offline metrics, including recall and NDCG, as well as online user engagement metrics.
  arXiv  Detail & Related papers  (2025-08-11T18:52:28Z)
• SPARE: Single-Pass Annotation with Reference-Guided Evaluation for Automatic Process Supervision and Reward Modelling [58.05959902776133]
  We introduce Single-Pass.<n>with Reference-Guided Evaluation (SPARE), a novel structured framework that enables efficient per-step annotation.<n>We demonstrate SPARE's effectiveness across four diverse datasets spanning mathematical reasoning (GSM8K, MATH), multi-hop question answering (MuSiQue-Ans), and spatial reasoning (SpaRP)<n>On ProcessBench, SPARE demonstrates data-efficient out-of-distribution generalization, using only $sim$16% of training samples compared to human-labeled and other synthetically trained baselines.
  arXiv  Detail & Related papers  (2025-06-18T14:37:59Z)
• Enhanced Whole Page Optimization via Mixed-Grained Reward Mechanism-Adapted Language Models [21.43957709683293]
  We propose a reward-based fine-tuning approach, which employs a mixed-grained reward mechanism that combines page-level and item-level rewards.<n>PageLLM outperforms baselines and achieves a 0.44% GMV increase in an online A/B test with over 10 million users.
  arXiv  Detail & Related papers  (2025-06-10T08:05:42Z)
• Utility-Focused LLM Annotation for Retrieval and Retrieval-Augmented Generation [96.18720164390699]
  This paper explores the use of large language models (LLMs) for annotating document utility in training retrieval and retrieval-augmented generation (RAG) systems.<n>Our results show that LLM-generated annotations enhance out-of-domain retrieval performance and improve RAG outcomes compared to models trained solely on human annotations or downstream QA metrics.
  arXiv  Detail & Related papers  (2025-04-07T16:05:52Z)
• Rank-R1: Enhancing Reasoning in LLM-based Document Rerankers via Reinforcement Learning [76.50690734636477]
  We introduce Rank-R1, a novel LLM-based reranker that performs reasoning over both the user query and candidate documents before performing the ranking task.<n>Our experiments on the TREC DL and BRIGHT datasets show that Rank-R1 is highly effective, especially for complex queries.
  arXiv  Detail & Related papers  (2025-03-08T03:14:26Z)
• Enhanced Retrieval of Long Documents: Leveraging Fine-Grained Block Representations with Large Language Models [24.02950598944251]
  We introduce a novel, fine-grained approach aimed at enhancing the accuracy of relevance scoring for long documents.<n>Our methodology firstly segments a long document into blocks, each of which is embedded using an LLM.<n>We aggregate the query-block relevance scores through a weighted sum method, yielding a comprehensive score for the query with the entire document.
  arXiv  Detail & Related papers  (2025-01-28T16:03:52Z)
• A Distributed Collaborative Retrieval Framework Excelling in All Queries and Corpora based on Zero-shot Rank-Oriented Automatic Evaluation [46.33857318525812]
  We propose a novel Distributed Collaborative Retrieval Framework (DCRF)<n>It integrates various retrieval models into a unified system and dynamically selects the optimal results for each user's query.<n>It can achieve performance comparable to effective listwise methods like RankGPT and ListT5.
  arXiv  Detail & Related papers  (2024-12-16T14:55:57Z)
• Self-Calibrated Listwise Reranking with Large Language Models [137.6557607279876]
  Large language models (LLMs) have been employed in reranking tasks through a sequence-to-sequence approach. This reranking paradigm requires a sliding window strategy to iteratively handle larger candidate sets. We propose a novel self-calibrated listwise reranking method, which aims to leverage LLMs to produce global relevance scores for ranking.
  arXiv  Detail & Related papers  (2024-11-07T10:31:31Z)
• Generative Pre-trained Ranking Model with Over-parameterization at Web-Scale (Extended Abstract) [73.57710917145212]
  Learning to rank is widely employed in web searches to prioritize pertinent webpages based on input queries. We propose a emphulineGenerative ulineSemi-ulineSupervised ulinePre-trained (GS2P) model to address these challenges. We conduct extensive offline experiments on both a publicly available dataset and a real-world dataset collected from a large-scale search engine.
  arXiv  Detail & Related papers  (2024-09-25T03:39:14Z)
• List-aware Reranking-Truncation Joint Model for Search and Retrieval-augmented Generation [80.12531449946655]
  We propose a Reranking-Truncation joint model (GenRT) that can perform the two tasks concurrently. GenRT integrates reranking and truncation via generative paradigm based on encoder-decoder architecture. Our method achieves SOTA performance on both reranking and truncation tasks for web search and retrieval-augmented LLMs.
  arXiv  Detail & Related papers  (2024-02-05T06:52:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.