Towards Efficient Whole Page Ranking with One-Pass Inference
中文摘要
该研究提出一种高效的一遍式推理全页排序方法,解决了非自回归模型无法捕捉广告与有机内容间顺序依赖交互的局限。
English Summary
This paper proposes efficient one-pass inference for whole-page ranking, capturing order-dependent interactions between ads and organic content that non-autoregressive methods fail to address.
arXiv:2611.05542v1 Announce Type: new 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-mo…