mlsanityData to 7 Oct 2026

AIF: Asynchronous Inference Framework for Cost-Effective Pre-Ranking

arXiv 2511.12934 ↗First posted 17 Nov 2025cs.LG cs.IRcited by 2

Not on the map. Why?

Abstract (arXiv)

In industrial recommendation systems, pre-ranking models based on deep neural networks (DNNs) commonly adopt a sequential execution framework: feature fetching and model forward computation are triggered only after receiving candidates from the upstream retrieval stage. This design introduces inherent bottlenecks, including redundant computations of identical users/items and increased latency due to strictly sequential operations, which jointly constrain the model's capacity and system efficiency. To address these limitations, we propose the Asynchronous Inference Framework (AIF), a cost-effective computational architecture that decouples interaction-independent components, those operating within a single user or item, from real-time prediction. AIF reorganizes the model inference process by performing user-side computations in parallel with the retrieval stage and conducting item-side computations in a nearline manner. This means that interaction-independent components are calculated just once and completed before the real-time prediction phase of the pre-ranking stage. As a result, AIF enhances computational efficiency and reduces latency, freeing up resources to significantly improve the feature set and model architecture of interaction-independent components. Moreover, we delve into model design within the AIF framework, employing approximated methods for interaction-dependent components in online real-time predictions. By co-designing both the framework and the model, our solution achieves notable performance gains without significantly increasing computational and latency costs. This has enabled the successful deployment of AIF in the Taobao display advertising system.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 17 of its 28 references that are in the map. First posted on arXiv 17 Nov 2025.

Builds on

17 of 28 references.

References · 17

  1. 2017Squeeze-and-Excitation Networkscited by 4,763
  2. 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 952
  3. 2016Wide & Deep Learning for Recommender Systemscited by 745
  4. 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 673
  5. 2017Deep & Cross Network for Ad Click Predictionscited by 392
  6. 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 336
  7. 2018xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systemscited by 277
  8. 2020Search-based User Interest Modeling with Lifelong Sequential Behavior Data for Click-Through Rate Predictioncited by 176
  9. 2019Poly-encoders: Transformer Architectures and Pre-training Strategies for Fast and Accurate Multi-sentence Scoringcited by 164
  10. 2021One Model to Serve All: Star Topology Adaptive Recommender for Multi-Domain CTR Predictioncited by 78
  11. 2018Ranking Distillation: Learning Compact Ranking Models With High Performance for Recommender Systemcited by 60
  12. 2020COLD: Towards the Next Generation of Pre-Ranking Systemcited by 30
5 more
  1. 2024Enhancing Taobao Display Advertising with Multimodal Representations: Challenges, Approaches and Insightscited by 23
  2. 2022Joint Optimization of Ranking and Calibration with Contextualized Hybrid Modelcited by 22
  3. 2022IntTower: the Next Generation of Two-Tower Model for Pre-Ranking Systemcited by 18
  4. 2021Towards a Better Tradeoff between Effectiveness and Efficiency in Pre-Ranking: A Learnable Feature Selection based Approachcited by 14
  5. 2023COPR: Consistency-Oriented Pre-Ranking for Online Advertisingcited by 10

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.