cs.AINov 3, 2026

Towards Efficient Whole Page Ranking with One-Pass Inference

Authors: Qi Xu, Zhigang Hua, Zijie Lei, Yan Xie, Jizhe Zhang, Lynn Lu, Delun Du, Sha Hua, 

Organizations: Meta Platforms, Inc. United States

Abstract

Whole-page ranking jointly optimizes advertisements and organic content to balance business outcomes and user engagement under complex layout and business constraints. Existing non-autoregressive (NAR) approaches enable efficient page generation but typically score candidate items independently of previously selected items, limiting their ability to capture order-dependent interactions. Autoregressive (AR) methods address this limitation through sequential conditioning, but incur substantial inference overhead that challenges large-scale deployment. Bridging this quality-efficiency gap remains a challenge in industrial whole-page ranking. We propose Multi-Item Scoring (MIS), a prefix-aware NAR-style framework that incorporates sequential context into efficient multi-item scoring. MIS integrates global candidate interactions, localized prefix conditioning, and position-aware scoring within a shared representation architecture. By computing reusable representations once per request and performing lightweight prefix-conditioned scoring during constrained beam search, MIS captures important sequential dependencies without repeated full-model inference. Experiments on KuaiRand-1K and RL4RS demonstrate that MIS approaches the generation quality of an autoregressive CGA baseline while achieving 4.07x and 3.54x faster CPU decoding, respectively. In a randomized evaluation on a large-scale social-video platform, MIS improves the realization metric by 0.104% and watch time by 0.058%, while reducing ranking-service CPU consumption by 9.73%. These results demonstrate that prefix-aware multi-item scoring can narrow the quality gap between NAR and AR generation while retaining the efficiency required for industrial scalability.

Figures & tables

Appendix figures & tables1 asset

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Learning Generative Ranking Policies for Whole-Page Optimization

    Nov 19, 2026Chen Qiu, Zhigang Hua, Qi Xu +4Generative RecommendationLearning to Rank

  2. Dual-Rerank: Fusing Causality and Utility for Industrial Generative Reranking

    Apr 8, 2026Chao Zhang, Shuai Lin, ChengLei Dai +5Learning to RankRL for IR

  3. Efficient Personalized Reranking with Semi-Autoregressive Generation and Online Knowledge Distillation

    Mar 7, 2026Kai Cheng, Hao Wang, Wei Guo +4Online Knowledge DistillationRecommender Systems