Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3534678.3539044acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

CONFLUX: A Request-level Fusion Framework for Impression Allocation via Cascade Distillation

Published: 14 August 2022 Publication History

Abstract

Guaranteed delivery (GD) and real-time bidding (RTB) constitute two parallel profit streams for the publisher. The diverse advertiser demands (brand or instant effect) result in different selling (in bulk or via auction) and pricing (fixed unit price or various bids) patterns, which naturally raises the fusion allocation issue of breaking the two markets' barrier and selling out at the global highest price boosting the total revenue. The fusion process complicates the competition between GD and RTB, and GD contracts with overlapping targeting. The non-stationary user traffic and bid landscape further worsen the situation, making the assignment unsupervised and hard to evaluate. Thus, a static policy or coarse-grained modeling from existing work is inferior to facing the above challenges.
This paper proposes CONFLUX, a fusion framework located at the confluence of the parallel GD and RTB markets. CONFLUX functions in a cascaded process: a paradigm is first forged via linear programming to supervise CONFLUX's training, then a cumbersome network distills such paradigm by precisely modeling the competition at a request level and further transfers the generalization ability to a lightweight student via knowledge distillation. Finally, fine-tuning is periodically executed at the online stage to remedy the student's degradation, and a temporal distillation loss between the current and the previous model serves as a regularizer to prevent over-fitting. The procedure is analogous to a cascade distillation and hence its name. CONFLUX has been deployed on the Tencent advertising system for over six months through extensive experiments. Online A/B tests present a lift of 3.29%, 1.77%, and 3.63% of ad income, overall click-through rate, and cost-per-mille, respectively, which jointly contribute a revenue increase by hundreds of thousands RMB per day. Our code is publicly available at https://github.com/zslomo/CONFLUX.

Supplemental Material

MP4 File
A request-level framework named CONFLUX for impression allocation to handle both guaranteed delivery and real-time bidding advertising markets, thus promoting the publisher's overall revenue. CONFLUX has been deployed on Tencent's ad system for over six months and has generated millions of extra revenue since then.

References

[1]
Santiago R Balseiro, Jon Feldman, Vahab Mirrokni, and Shan Muthukrishnan. 2014. Yield Optimization of Display Advertising with Ad Exchange. Management Science 60, 12 (2014), 2886--2907.
[2]
Vijay Bharadwaj, Peiji Chen, Wenjing Ma, Chandrashekhar Nagarajan, John Tomlin, Sergei Vassilvitskii, Erik Vee, and Jian Yang. 2012. SHALE: An Efficient Algorithm for Allocation of Guaranteed Display Advertising. In Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1195--1203.
[3]
Niv Buchbinder, Moran Feldman, Arpita Ghosh, and Joseph Naor. 2014. Frequency capping in online advertising. Journal of Scheduling 17, 4 (2014), 385--398.
[4]
Bowei Chen, Shuai Yuan, and Jun Wang. 2014. A Dynamic Pricing Model for Unifying Programmatic Guarantee and Real-time Bidding in Display Advertising. In Proceedings of the 8th International Workshop on Data Mining for Online Advertising. 1--9.
[5]
Peiji Chen, Wenjing Ma, Srinath Mandalapu, Chandrashekhar Nagarjan, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Manfai Yu, and Jason Zien. 2012. Ad Serving Using a Compact Allocation Plan. In Proceedings of the 13th ACM Conference on Electronic Commerce. 319--336.
[6]
Ye Chen, Pavel Berkhin, Bo Anderson, and Nikhil R Devanur. 2011. Real-time Bidding Algorithms for Performance-based Display Ad Allocation. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1307--1315.
[7]
Nikhil R Devanur and Thomas P Hayes. 2009. The Adwords Problem: Online Keyword Matching with Budgeted Bidders under Random Permutations. In Proceedings of the 10th ACM Conference on Electronic Commerce. 71--78.
[8]
Zhen Fang, Yang Li, Chuanren Liu, Wenxiang Zhu, Yu Zheng, and Wenjun Zhou. 2019. Large-Scale Personalized Delivery for Guaranteed Display Advertising with Real-Time Pacing. In IEEE International Conference on Data Mining (ICDM). 190--199.
[9]
Arpita Ghosh, Preston McAfee, Kishore Papineni, and Sergei Vassilvitskii. 2009. Bidding for Representative Allocations for Display Advertising. In Internet and Network Economics, Stefano Leonardi (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 208--219.
[10]
Yue He, Xiujun Chen, Di Wu, Junwei Pan, Qing Tan, Chuan Yu, Jian Xu, and Xiaoqiang Zhu. 2021. A Unified Solution to Constrained Bidding in Online Display Advertising. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. 2993--3001.
[11]
Geoffrey Hinton, Oriol Vinyals, and Jeff Dean. 2015. Distilling the Knowledge in a Neural Network. arXiv preprint arXiv:1503.02531 (2015).
[12]
Ali Hojjat, John Turner, Suleyman Cetintas, and Jian Yang. 2014. Delivering guaranteed display ads under reach and frequency requirements. In Twenty- Eighth AAAI Conference on Artificial Intelligence.
[13]
Grégoire Jauvion and Nicolas Grislain. 2018. Optimal allocation of real-time-bidding and direct campaigns. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 416--424.
[14]
Zhizhong Li and Derek Hoiem. 2017. Learning Without Forgetting. IEEE Transactions on Pattern Analysis and Machine Intelligence 40, 12 (2017), 2935--2947.
[15]
Xiao Ma, Liqin Zhao, Guan Huang, Zhi Wang, Zelin Hu, Xiaoqiang Zhu, and Kun Gai. 2018. Entire Space Multi-task Model: An Effective Approach for Estimating Post-click Conversion Rate. In Proceedings of the 41st ACM International Conference on Research & Development in Information Retrieval. 1137--1140.
[16]
Adriana Romero, Nicolas Ballas, Samira Ebrahimi Kahou, Antoine Chassang, Carlo Gatta, and Yoshua Bengio. 2014. Fitnets: Hints for Thin Deep Nets. arXiv preprint arXiv:1412.6550 (2014).
[17]
Konstantin Salomatin, Tie-Yan Liu, and Yiming Yang. 2012. A Unified Optimization Framework for Auction and Guaranteed Delivery in Online Advertising. In Proceedings of the 21st ACM International Conference on Information and Knowledge Management. 2005--2009.
[18]
Frederick Tung and Greg Mori. 2019. Similarity-preserving Knowledge Distillation. In Proceedings of the IEEE/CVF International Conference on Computer Vision. 1365--1374.
[19]
Erik Vee, Sergei Vassilvitskii, and Jayavel Shanmugasundaram. 2010. Optimal Online Assignment with Forecasts. In Proceedings of the 11th ACM Conference on Electronic Commerce. 109--118.
[20]
Ruoxi Wang, Rakesh Shivanna, Derek Cheng, Sagar Jain, Dong Lin, Lichan Hong, and Ed Chi. 2021. DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systems. In Proceedings of the Web Conference. 1785--1797.
[21]
Di Wu, Cheng Chen, Xiujun Chen, Junwei Pan, Xun Yang, Qing Tan, Jian Xu, and Kuang-Chih Lee. 2021. Impression Allocation and Policy Search in Display Advertising. In 2021 IEEE International Conference on Data Mining (ICDM). 749--756.
[22]
Xun Yang, Yasong Li, Hao Wang, Di Wu, Qing Tan, Jian Xu, and Kun Gai. 2019. Bid Optimization by Multi-variable Control in Display Advertising. In Proceedings of the 25th ACM International Conference on Knowledge Discovery & Data Mining. 1966--1974.
[23]
Jia Zhang, Zheng Wang, Qian Li, Jialin Zhang, Yanyan Lan, Qiang Li, and Xiaoming Sun. 2017. Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 31.
[24]
Guorui Zhou, Ying Fan, Runpeng Cui, Weijie Bian, Xiaoqiang Zhu, and Kun Gai. 2018. Rocket Launching: A Universal and Efficient Framework for Training Well-performing Light Net. In Proceedings of the 32nd AAAI Conference on Artificial Intelligence.

Cited By

View all
  • (2024)Follow the LIBRA: Guiding Fair Policy for Unified Impression Allocation via Adversarial RewardingProceedings of the 17th ACM International Conference on Web Search and Data Mining10.1145/3616855.3635756(750-759)Online publication date: 4-Mar-2024
  • (2023)CLOCK: Online Temporal Hierarchical Framework for Multi-scale Multi-granularity Forecasting of User ImpressionProceedings of the 32nd ACM International Conference on Information and Knowledge Management10.1145/3583780.3614810(2544-2553)Online publication date: 21-Oct-2023

Index Terms

  1. CONFLUX: A Request-level Fusion Framework for Impression Allocation via Cascade Distillation

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      KDD '22: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
      August 2022
      5033 pages
      ISBN:9781450393850
      DOI:10.1145/3534678
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 14 August 2022

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. display advertising
      2. impression allocation
      3. knowledge distillation
      4. revenue optimization

      Qualifiers

      • Research-article

      Funding Sources

      • Key Research Program of Frontier Sciences, CAS
      • Tencent Holdings Ltd
      • National Key R&D Program of China
      • University Synergy Innovation Program of Anhui Province
      • China National Natural Science Foundation

      Conference

      KDD '22
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)67
      • Downloads (Last 6 weeks)9
      Reflects downloads up to 20 Nov 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Follow the LIBRA: Guiding Fair Policy for Unified Impression Allocation via Adversarial RewardingProceedings of the 17th ACM International Conference on Web Search and Data Mining10.1145/3616855.3635756(750-759)Online publication date: 4-Mar-2024
      • (2023)CLOCK: Online Temporal Hierarchical Framework for Multi-scale Multi-granularity Forecasting of User ImpressionProceedings of the 32nd ACM International Conference on Information and Knowledge Management10.1145/3583780.3614810(2544-2553)Online publication date: 21-Oct-2023

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media