GACE: Learning Graph-Based Cross-Page Ads Embedding For Click-Through Rate Prediction

• URL: http://arxiv.org/abs/2401.07445v1
• Date: Mon, 15 Jan 2024 03:12:21 GMT
• Title: GACE: Learning Graph-Based Cross-Page Ads Embedding For Click-Through Rate Prediction
• Authors: Haowen Wang, Yuliang Du, Congyun Jin, Yujiao Li, Yingbo Wang, Tao Sun, Piqi Qin, Cong Fan
• Abstract summary: This paper proposes a graph-based cross-page ads embedding generation method. It generates representations embedding of cold-start and existing ads across various pages. The results show that our method is significantly superior to the SOTA method.
• Score: 3.3840833400287593
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Predicting click-through rate (CTR) is the core task of many ads online recommendation systems, which helps improve user experience and increase platform revenue. In this type of recommendation system, we often encounter two main problems: the joint usage of multi-page historical advertising data and the cold start of new ads. In this paper, we proposed GACE, a graph-based cross-page ads embedding generation method. It can warm up and generate the representation embedding of cold-start and existing ads across various pages. Specifically, we carefully build linkages and a weighted undirected graph model considering semantic and page-type attributes to guide the direction of feature fusion and generation. We designed a variational auto-encoding task as pre-training module and generated embedding representations for new and old ads based on this task. The results evaluated in the public dataset AliEC from RecBole and the real-world industry dataset from Alipay show that our GACE method is significantly superior to the SOTA method. In the online A/B test, the click-through rate on three real-world pages from Alipay has increased by 3.6%, 2.13%, and 3.02%, respectively. Especially in the cold-start task, the CTR increased by 9.96%, 7.51%, and 8.97%, respectively.

Related papers

• AdSEE: Investigating the Impact of Image Style Editing on Advertisement Attractiveness [25.531489722164178]
  We propose Advertisement Style Editing and Attractiveness Enhancement (AdSEE), which explores whether semantic editing to ads images can affect or alter the popularity of online advertisements. We introduce StyleGAN-based facial semantic editing and inversion to ads images and train a click rate predictor attributing GAN-based face latent representations to click rates. Online A/B tests performed over a period of 5 days have verified the increased click-through rates of AdSEE-edited samples as compared to a control group of original ads.
  arXiv  Detail & Related papers  (2023-09-15T04:52:49Z)
• Rec4Ad: A Free Lunch to Mitigate Sample Selection Bias for Ads CTR Prediction in Taobao [24.43583745735832]
  We propose to leverage recommendations samples as a free lunch to mitigate sample selection bias for ads CTR model (Rec4Ad) Rec4Ad achieves substantial gains in key business metrics, with a lift of up to +6.6% CTR and +2.9% RPM.
  arXiv  Detail & Related papers  (2023-06-06T09:22:52Z)
• Boost CTR Prediction for New Advertisements via Modeling Visual Content [55.11267821243347]
  We exploit the visual content in ads to boost the performance of CTR prediction models. We learn the embedding for each visual ID based on the historical user-ad interactions accumulated in the past. After incorporating the visual ID embedding in the CTR prediction model of Baidu online advertising, the average CTR of ads improves by 1.46%, and the total charge increases by 1.10%.
  arXiv  Detail & Related papers  (2022-09-23T17:08:54Z)
• A Graph-Enhanced Click Model for Web Search [67.27218481132185]
  We propose a novel graph-enhanced click model (GraphCM) for web search. We exploit both intra-session and inter-session information for the sparsity and cold-start problems.
  arXiv  Detail & Related papers  (2022-06-17T08:32:43Z)
• VFed-SSD: Towards Practical Vertical Federated Advertising [53.08038962443853]
  We propose a semi-supervised split distillation framework VFed-SSD to alleviate the two limitations. Specifically, we develop a self-supervised task MatchedPair Detection (MPD) to exploit the vertically partitioned unlabeled data. Our framework provides an efficient federation-enhanced solution for real-time display advertising with minimal deploying cost and significant performance lift.
  arXiv  Detail & Related papers  (2022-05-31T17:45:30Z)
• GIFT: Graph-guIded Feature Transfer for Cold-Start Video Click-Through Rate Prediction [47.06479882277151]
  Short video has witnessed rapid growth in China and shows a promising market for promoting the sales of products in e-commerce platforms like Taobao. To ensure the freshness of the content, the platform needs to release a large number of new videos every day. We propose GIFT, an efficient Graph-guIded Feature Transfer system, to take advantages of the rich information of warmed-up videos that related to the cold-start video.
  arXiv  Detail & Related papers  (2022-02-21T09:31:35Z)
• Learning Graph Meta Embeddings for Cold-Start Ads in Click-Through Rate Prediction [14.709092114902159]
  We propose Graph Meta Embedding (GME) models that can rapidly learn how to generate desirable initial embeddings for new ad IDs. Experimental results on three real-world datasets show that GMEs can significantly improve the prediction performance in both cold-start and warm-up.
  arXiv  Detail & Related papers  (2021-05-19T03:46:56Z)
• A novel auction system for selecting advertisements in Real-Time bidding [68.8204255655161]
  Real-Time Bidding is a new Internet advertising system that has become very popular in recent years. We propose an alternative betting system with a new approach that not only considers the economic aspect but also other relevant factors for the functioning of the advertising system.
  arXiv  Detail & Related papers  (2020-10-22T18:36:41Z)
• Predicting conversions in display advertising based on URL embeddings [16.63178490961762]
  We introduce and examine different models for estimating the probability of a user converting, given their history of visited URLs. Inspired by natural language processing, we introduce three URL embedding models to compute semantically meaningful URL representations.
  arXiv  Detail & Related papers  (2020-08-27T09:14:28Z)
• Graph Enhanced Representation Learning for News Recommendation [85.3295446374509]
  We propose a news recommendation method which can enhance the representation learning of users and news. In our method, users and news are both viewed as nodes in a bipartite graph constructed from historical user click behaviors.
  arXiv  Detail & Related papers  (2020-03-31T15:27:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.