AI & ML
Towards Efficient Whole Page Ranking with One-Pass Inference
arXiv stat.ML0 views
arXiv:2611.05542v1 Announce Type: cross 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.
Source:https://arxiv.org/abs/2611.05542PreviousTight Lower Bounds under Matched High-Order H\"older Smoothness and Uniform ConvexityNextSupport Vector Machines Directly Minimise KL Divergence
Related posts
How Chiron Changes AI Incident Investigation on ORCA-bench
0Hacker News New
Ask HN: How do small teams pragmatically manage Dependabot fatigue?
0Hacker News New
How WeRateDogs Is Fighting A.I. Slop, One Perfect Puppy at a Time
0Hacker News New
Piston – small causal model for time series that can refuse
0Hacker News New
Novel AI framework runs on optical hardware
0Hacker News New
Nexus-Q: the first commits were a threat model and architecture, not code
0Hacker News New