Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 17 May 2021 in cs.IR and cs.AI

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

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (9)
  1. Xu Ma (39 papers)
  2. Pengjie Wang (51 papers)
  3. Hui Zhao (114 papers)
  4. Shaoguo Liu (19 papers)
  5. Chuhan Zhao (1 paper)
  6. Wei Lin (207 papers)
  7. Jian Xu (209 papers)
  8. Bo Zheng (206 papers)
  9. Kuang-chih Lee (23 papers)
Citations (23)

Summary

We haven't generated a summary for this paper yet.