cd /news/machine-learning/towards-efficient-whole-page-ranking… · home › topics › machine-learning › article
[ARTICLE · art-164321] src=arxiv.org ↗ pub= topic=machine-learning verified=true sentiment=↑ positive

Towards Efficient Whole Page Ranking with One-Pass Inference

A new arXiv paper (2611.05542v1) proposes Multi-Item Scoring (MIS), a prefix-aware non-autoregressive framework for whole-page ranking that approaches the generation quality of an autoregressive CGA baseline while decoding 4.07x and 3.54x faster on CPU on the KuaiRand-1K and RL4RS benchmarks, respectively. In a randomized evaluation on a large-scale social-video platform, MIS improved the realization metric by 0.104% and watch time by 0.058% while cutting ranking-service CPU consumption by 9.73%. The authors present MIS as a way to narrow the quality-efficiency gap between non-autoregressive and autoregressive page generation for industrial deployment.

by read1 min views1 publishedNov 5, 2026

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-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.

── more in #machine-learning 4 stories · sorted by recency
── more on @multi-item scoring 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
→ Live at https://your-agent.zahid.host ✓
Get free account → Pricing
from €0/mo · no card required
LIVE [news/towards-efficient-wh…] indexed:0 read:1min 2026-11-05 · —