Cascading architecture has been widely adopted in large-scale advertising systems to balance efficiency and effectiveness. In this architecture, the pre-ranking model is expected to be a lightweight approximation of the ranking model, which handles more candidates with strict latency requirements. Due to the gap in model capacity, the pre-ranking and ranking models usually generate inconsistent ranked results, thus hurting the overall system effectiveness. The paradigm of score alignment is proposed to regularize their raw scores to be consistent. However, it suffers from inevitable alignment errors and error amplification by bids when applied in online advertising. To this end, we introduce a consistency-oriented pre-ranking framework for online advertising, which employs a chunk-based sampling module and a plug-and-play rank alignment module to explicitly optimize consistency of ECPM-ranked results. A ΔNDCG-based weighting mechanism is adopted to better distinguish the importance of inter-chunk samples in optimization. Both online and offline experiments have validated the superiority of our framework. When deployed in Taobao display advertising system, it achieves an improvement of up to +12.3% CTR and +5.6% RPM.
COPR: Consistency-Oriented Pre-Ranking for Online Advertising
Zhishan Zhao,Jing Gao,Yu Zhang,Shuguang Han,Siyuan Lou,Xiang-Rong Sheng,Zhe Wang,Han Zhu,Yuning Jiang,Jian Xu,Bo Zheng
Published 2023 in International Conference on Information and Knowledge Management
ABSTRACT
PUBLICATION RECORD
- Publication year
2023
- Venue
International Conference on Information and Knowledge Management
- Publication date
2023-06-06
- Fields of study
Business, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-31 of 31 references · Page 1 of 1
CITED BY
Showing 1-22 of 22 citing papers · Page 1 of 1