End-to-End Inventory Prediction and Contract Allocation for Guaranteed Delivery Advertising
Wuyang Mao, Chuanren Liu, Yundu Huang, Zhonglin Zu, M. Harshvardhan, Liang Wang, Bo Zheng
Abstract
Guaranteed Delivery (GD) advertising plays an essential part in e-commerce marketing, where the ad publisher signs contracts with advertisers in advance by promising delivery of advertising impressions to fulfill targeting requirements for advertisers. Previous research on GD advertising mainly focused on online serving yet overlooked the importance of contract allocation at the GD selling stage. Traditional GD selling approaches consider impression inventory prediction and contract allocation as two separate stages. However, such a two-stage optimization often leads to inferior contract allocation performance. In this paper, our goal is to reduce this performance gap with a novel end-to-end approach. Specifically, we propose the Neural Lagrangian Selling (NLS) model to jointly predict the impression inventory and optimize the contract allocation of advertising impressions with a unified learning objective. To this end, we first develop a differentiable Lagrangian layer to backpropagate the allocation problem through the neural network and allow direct optimization of the allocation regret. Then, for effective optimization with various allocation targets and constraints, we design a graph convolutional neural network to extract predictive features from the bipartite allocation graph. Extensive experiments show that our approach can improve GD selling performance compared with existing two-stage approaches. Particularly, our optimization layer can outperform the baseline solvers in both computational efficiency and solution quality. To the best of our knowledge, this is the first study to apply the end-to-end prediction and optimization approach for industrial GD selling problems. Our work has implications for general prediction and allocation problems as well.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on3
- Interior Point Solving for LP-based prediction+optimisationJayanta Mandi, Tias GunsNeurIPS 2020 · 138 citations
- Structured Graph Convolutional Networks with Stochastic Masks for Recommender SystemsHuiyuan Chen, Lan Wang, Yusan Lin, Chin-Chia Michael Yeh et al.SIGIR 2021 · 60 citations
- A Divide and Conquer Algorithm for Predict+Optimize with Non-convex ProblemsAli Ugur Guler, Emir Demirovic, Jeffrey Chan, James Bailey et al.AAAI 2022 · 14 citations
Related papers
- Bi-Objective Contract Allocation for Guaranteed Delivery AdvertisingYan Li, Yundu Huang, Wuyang Mao, Furong Ye et al.KDD 2024
- An Efficient Local Search Algorithm for Large GD Advertising Inventory Allocation with Multilinear ConstraintsXiang He, Wuyang Mao, Zhenghang Xu, Yuanzhe Gu et al.KDD 2024
- Fairness-aware Guaranteed Display Advertising Allocation under Traffic Cost ConstraintLiang Dai, Zhonglin Zu, Hao Wu, Liang Wang et al.WWW 2023 · 4 citations
- Hybrid Advertising in the Sponsored SearchZhen Zhang, Weian Li, Yuhan Wang, Qi Qi et al.SIGIR 2025
- Percentile Risk-Constrained Budget Pacing for Guaranteed Display Advertising in Online OptimizationLiang Dai, Kejie Lyu, Chengcheng Zhang, Guangming Zhao et al.AAAI 2024 · 3 citations
