Efficient Optimal Selection for Composited Advertising Creatives with
Tree Structure
- URL: http://arxiv.org/abs/2103.01453v1
- Date: Tue, 2 Mar 2021 03:39:41 GMT
- Title: Efficient Optimal Selection for Composited Advertising Creatives with
Tree Structure
- Authors: Jin Chen, Tiezheng Ge, Gangwei Jiang, Zhiqiang Zhang, Defu Lian, Kai
Zheng
- Abstract summary: 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.
- Score: 24.13017090236483
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Ad creatives are one of the prominent mediums for online e-commerce
advertisements. Ad creatives with enjoyable visual appearance may increase the
click-through rate (CTR) of products. Ad creatives are typically handcrafted by
advertisers and then delivered to the advertising platforms for advertisement.
In recent years, advertising platforms are capable of instantly compositing ad
creatives with arbitrarily designated elements of each ingredient, so
advertisers are only required to provide basic materials. While facilitating
the advertisers, a great number of potential ad creatives can be composited,
making it difficult to accurately estimate CTR for them given limited real-time
feedback. To this end, we propose an Adaptive and Efficient ad creative
Selection (AES) framework based on a tree structure. The tree structure on
compositing ingredients enables dynamic programming for efficient ad creative
selection on the basis of CTR. Due to limited feedback, the CTR estimator is
usually of high variance. Exploration techniques based on Thompson sampling are
widely used for reducing variances of the CTR estimator, alleviating feedback
sparsity. Based on the tree structure, Thompson sampling is adapted with
dynamic programming, leading to efficient exploration for potential ad
creatives with the largest CTR. We finally evaluate the proposed algorithm on
the synthetic dataset and the real-world dataset. The results show that our
approach can outperform competing baselines in terms of convergence rate and
overall CTR.
Related papers
- CTR-Driven Advertising Image Generation with Multimodal Large Language Models [53.40005544344148]
We explore the use of Multimodal Large Language Models (MLLMs) for generating advertising images by optimizing for Click-Through Rate (CTR) as the primary objective.
To further improve the CTR of generated images, we propose a novel reward model to fine-tune pre-trained MLLMs through Reinforcement Learning (RL)
Our method achieves state-of-the-art performance in both online and offline metrics.
arXiv Detail & Related papers (2025-02-05T09:06:02Z) - ACQ: A Unified Framework for Automated Programmatic Creativity in Online Advertising [30.584160762498655]
This paper proposes a two-stage framework named Automated Creatives Quota (ACQ) to achieve the automatic creation and deactivation of ad creatives.
ACQ dynamically allocates the creative quota across multiple advertisers to maximize the revenue of the ad platform.
arXiv Detail & Related papers (2024-12-09T03:00:57Z) - Efficient Transfer Learning Framework for Cross-Domain Click-Through Rate Prediction [47.7066461216227]
Efficient Transfer Learning Framework for Cross-Domain Click-Through Rate Prediction (E-CDCTR)
Three key components: Tiny Pre-training Model (TPM), Complete Pre-training Model (CPM) and Advertisement CTR model (A-CTR)
TPM provides richer representations of user and item for both the CPM and A-CTR, effectively alleviating the problem inherent in the daily updates.
arXiv Detail & Related papers (2024-08-29T03:34:39Z) - 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) - Parallel Ranking of Ads and Creatives in Real-Time Advertising Systems [20.78133992969317]
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.
arXiv Detail & Related papers (2023-12-20T04:05:21Z) - Cross-Element Combinatorial Selection for Multi-Element Creative in
Display Advertising [16.527943807941856]
This paper proposes a Cross-Element Combinatorial Selection framework for multiple creative elements.
In the encoder process, a cross-element interaction is adopted to dynamically adjust the expression of a single creative element.
Experiments on real-world datasets show that CECS achieved the SOTA score on offline metrics.
arXiv Detail & Related papers (2023-07-04T09:32:39Z) - 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) - 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) - Masked Transformer for Neighhourhood-aware Click-Through Rate Prediction [74.52904110197004]
We propose Neighbor-Interaction based CTR prediction, which put this task into a Heterogeneous Information Network (HIN) setting.
In order to enhance the representation of the local neighbourhood, we consider four types of topological interaction among the nodes.
We conduct comprehensive experiments on two real world datasets and the experimental results show that our proposed method outperforms state-of-the-art CTR models significantly.
arXiv Detail & Related papers (2022-01-25T12:44:23Z) - 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)
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.