Parallel Ranking of Ads and Creatives in Real-Time Advertising Systems
- URL: http://arxiv.org/abs/2312.12750v1
- Date: Wed, 20 Dec 2023 04:05:21 GMT
- Title: Parallel Ranking of Ads and Creatives in Real-Time Advertising Systems
- Authors: Zhiguang Yang, Lu Wang, Chun Gan, Liufang Sang, Haoran Wang, Wenlong
Chen, Jie He, Changping Peng, Zhangang Lin, Jingping Shao
- Abstract summary: We propose for the first time a novel architecture for online parallel estimation of ads and creatives ranking.
The online architecture enables sophisticated personalized creative modeling while reducing overall latency.
The offline joint model for CTR estimation allows mutual awareness and collaborative optimization between ads and creatives.
- Score: 20.78133992969317
- License: http://creativecommons.org/licenses/by-sa/4.0/
- Abstract: "Creativity is the heart and soul of advertising services". Effective
creatives can create a win-win scenario: advertisers can reach target users and
achieve marketing objectives more effectively, users can more quickly find
products of interest, and platforms can generate more advertising revenue. With
the advent of AI-Generated Content, advertisers now can produce vast amounts of
creative content at a minimal cost. The current challenge lies in how
advertising systems can select the most pertinent creative in real-time for
each user personally. Existing methods typically perform serial ranking of ads
or creatives, limiting the creative module in terms of both effectiveness and
efficiency. In this paper, we propose for the first time a novel architecture
for online parallel estimation of ads and creatives ranking, as well as the
corresponding offline joint optimization model. The online architecture enables
sophisticated personalized creative modeling while reducing overall latency.
The offline joint model for CTR estimation allows mutual awareness and
collaborative optimization between ads and creatives. Additionally, we optimize
the offline evaluation metrics for the implicit feedback sorting task involved
in ad creative ranking. We conduct extensive experiments to compare ours with
two state-of-the-art approaches. The results demonstrate the effectiveness of
our approach in both offline evaluations and real-world advertising platforms
online in terms of response time, CTR, and CPM.
Related papers
- A New Creative Generation Pipeline for Click-Through Rate with Stable
Diffusion Model [8.945197427679924]
Traditional AI-based approaches face the same problem of not considering user information while having limited aesthetic knowledge from designers.
To optimize the results, the generated creatives in traditional methods are then ranked by another module named creative ranking model.
This paper proposes a new automated Creative Generation pipeline for Click-Through Rate (CG4CTR) with the goal of improving CTR during the creative generation stage.
arXiv Detail & Related papers (2024-01-17T03:27:39Z) - AdBooster: Personalized Ad Creative Generation using Stable Diffusion
Outpainting [7.515971669919419]
In digital advertising, the selection of the optimal item (recommendation) and its best creative presentation (creative optimization) have traditionally been considered separate disciplines.
We introduce the task of generative models for creative generation that incorporate user interests, and itshape AdBooster, a model for personalized ad creatives.
arXiv Detail & Related papers (2023-09-08T12:57:05Z) - Personality-Driven Social Multimedia Content Recommendation [68.46899477180837]
We investigate the impact of human personality traits on the content recommendation model by applying a novel personality-driven multi-view content recommender system.
Our experimental results and real-world case study demonstrate not just PersiC's ability to perform efficient human personality-driven multi-view content recommendation, but also allow for actionable digital ad strategy recommendations.
arXiv Detail & Related papers (2022-07-25T14:37:18Z) - A Cooperative-Competitive Multi-Agent Framework for Auto-bidding in
Online Advertising [53.636153252400945]
We propose a general Multi-Agent reinforcement learning framework for Auto-Bidding, namely MAAB, to learn the auto-bidding strategies.
Our approach outperforms several baseline methods in terms of social welfare and guarantees the ad platform's revenue.
arXiv Detail & Related papers (2021-06-11T08:07:14Z) - Efficient Optimal Selection for Composited Advertising Creatives with
Tree Structure [24.13017090236483]
Ad creatives with enjoyable visual appearance may increase the click-through rate (CTR) of products.
We propose an Adaptive and Efficient ad creative Selection framework based on a tree structure.
Based on the tree structure, Thompson sampling is adapted with dynamic programming, leading to efficient exploration for potential ad creatives with the largest CTR.
arXiv Detail & Related papers (2021-03-02T03:39:41Z) - 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) - Learning to Create Better Ads: Generation and Ranking Approaches for Ad
Creative Refinement [26.70647666598025]
We study approaches to refine the given ad text and image by: (i) generating new ad text, (ii) recommending keyphrases for new ad text, and (iii) recommending image tags (objects in image)
Based on A/B tests conducted by multiple advertisers, we form pairwise examples of inferior and superior ad creatives.
We also share broadly applicable insights from our experiments using data from the Yahoo Gemini ad platform.
arXiv Detail & Related papers (2020-08-17T16:46:28Z) - Dynamic Knapsack Optimization Towards Efficient Multi-Channel Sequential
Advertising [52.3825928886714]
We formulate the sequential advertising strategy optimization as a dynamic knapsack problem.
We propose a theoretically guaranteed bilevel optimization framework, which significantly reduces the solution space of the original optimization space.
To improve the exploration efficiency of reinforcement learning, we also devise an effective action space reduction approach.
arXiv Detail & Related papers (2020-06-29T18:50:35Z) - Online Joint Bid/Daily Budget Optimization of Internet Advertising
Campaigns [115.96295568115251]
We study the problem of automating the online joint bid/daily budget optimization of pay-per-click advertising campaigns over multiple channels.
For every campaign, we capture the dependency of the number of clicks on the bid and daily budget by Gaussian Processes.
We design four algorithms and show that they suffer from a regret that is upper bounded with high probability as O(sqrtT)
We present the results of the adoption of our algorithms in a real-world application with a daily average spent of 1,000 Euros for more than one year.
arXiv Detail & Related papers (2020-03-03T11:07:38Z) - MoTiAC: Multi-Objective Actor-Critics for Real-Time Bidding [47.555870679348416]
We propose a Multi-ecTive Actor-Critics algorithm named MoTiAC for the problem of bidding optimization with various goals.
Unlike previous RL models, the proposed MoTiAC can simultaneously fulfill multi-objective tasks in complicated bidding environments.
arXiv Detail & Related papers (2020-02-18T07:16:39Z)
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.