mlsanityData to 7 Oct 2026

Towards a Better Tradeoff between Effectiveness and Efficiency in Pre-Ranking: A Learnable Feature Selection based Approach

arXiv 2105.07706 ↗First posted 17 May 2021cs.IR cs.AIcited by 14

Not on the map. Why?

Abstract (arXiv)

In real-world search, recommendation, and advertising systems, the multi-stage ranking architecture is commonly adopted. Such architecture usually consists of matching, pre-ranking, ranking, and re-ranking stages. In the pre-ranking stage, vector-product based models with representation-focused architecture are commonly adopted to account for system efficiency. However, it brings a significant loss to the effectiveness of the system. In this paper, a novel pre-ranking approach is proposed which supports complicated models with interaction-focused architecture. It achieves a better tradeoff between effectiveness and efficiency by utilizing the proposed learnable Feature Selection method based on feature Complexity and variational Dropout (FSCD). Evaluations in a real-world e-commerce sponsored search system for a search engine demonstrate that utilizing the proposed pre-ranking, the effectiveness of the system is significantly improved. Moreover, compared to the systems with conventional pre-ranking models, an identical amount of computational resource is consumed.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 8 of its 13 references that are in the map. First posted on arXiv 17 May 2021.

Builds on

8 of 13 references.

References · 8

  1. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
  2. 2018Billion-scale Commodity Embedding for E-commerce Recommendation in Alibabacited by 105
  3. 2019A Deep Look into Neural Ranking Models for Information Retrievalcited by 79
  4. 2020COLD: Towards the Next Generation of Pre-Ranking Systemcited by 30
  5. 2017Cascade Ranking for Operational E-commerce Searchcited by 29
  6. 2017Dropout Feature Ranking for Deep Learning Modelscited by 13
  7. 2017PBODL : Parallel Bayesian Online Deep Learning for Click-Through Rate Prediction in Tencent Advertising Systemcited by 9
  8. 2018EENMF: An End-to-End Neural Matching Framework for E-Commerce Sponsored Searchcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 3; 2024: 1; 2025: 6; 2026: 2.

14 papers.

Sort: