TL;DR
This paper introduces Graph Meta Embedding models that leverage graph neural networks and meta learning to generate effective initial embeddings for new ads, significantly improving CTR prediction in cold-start scenarios.
Contribution
The paper proposes novel GME models that incorporate information from both new ads and existing old ads, enhancing cold-start ad embedding initialization.
Findings
GME models outperform existing CTR prediction models in cold-start scenarios.
GME models improve performance in warm-up scenarios with limited training data.
The approach is applicable to both CTR and CVR prediction tasks.
Abstract
Click-through rate (CTR) prediction is one of the most central tasks in online advertising systems. Recent deep learning-based models that exploit feature embedding and high-order data nonlinearity have shown dramatic successes in CTR prediction. However, these models work poorly on cold-start ads with new IDs, whose embeddings are not well learned yet. In this paper, we propose Graph Meta Embedding (GME) models that can rapidly learn how to generate desirable initial embeddings for new ad IDs based on graph neural networks and meta learning. Previous works address this problem from the new ad itself, but ignore possibly useful information contained in existing old ads. In contrast, GMEs simultaneously consider two information sources: the new ad and existing old ads. For the new ad, GMEs exploit its associated attributes. For existing old ads, GMEs first build a graph to connect them…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
