Conversion-Based Dynamic-Creative-Optimization in Native Advertising

• URL: http://arxiv.org/abs/2211.11524v1
• Date: Sun, 13 Nov 2022 13:13:00 GMT
• Title: Conversion-Based Dynamic-Creative-Optimization in Native Advertising
• Abstract summary: Dynamic creative optimization (DCO) is a recent Gemini native product that was launched two years ago and is increasingly gaining more attention from advertisers. To accommodate this request, we present a post-auction solution, where DCO ads combinations are favored according to their predicted conversion rate (CVR) An online evaluation of this explore-exploit solution, via online bucket A/B testing, showed a 53.5% CVR lift, when compared to a control bucket serving all combinations uniformly at random.
• Score: 2.8461446020965435
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Yahoo Gemini native advertising marketplace serves billions of impressions daily, to hundreds millions of unique users, and reaches a yearly revenue of many hundreds of millions USDs. Powering Gemini native models for predicting advertise (ad) event probabilities, such as conversions and clicks, is OFFSET - a feature enhanced collaborative-filtering (CF) based event prediction algorithm. The predicted probabilities are then used in Gemini native auctions to determine which ads to present for every serving event (impression). Dynamic creative optimization (DCO) is a recent Gemini native product that was launched two years ago and is increasingly gaining more attention from advertisers. The DCO product enables advertisers to issue several assets per each native ad attribute, creating multiple combinations for each DCO ad. Since different combinations may appeal to different crowds, it may be beneficial to present certain combinations more frequently than others to maximize revenue while keeping advertisers and users satisfied. The initial DCO offer was to optimize click-through rates (CTR), however as the marketplace shifts more towards conversion based campaigns, advertisers also ask for a {conversion based solution. To accommodate this request, we present a post-auction solution, where DCO ads combinations are favored according to their predicted conversion rate (CVR). The predictions are provided by an auxiliary OFFSET based combination CVR prediction model, and used to generate the combination distributions for DCO ad rendering during serving time. An online evaluation of this explore-exploit solution, via online bucket A/B testing, serving Gemini native DCO traffic, showed a 53.5% CVR lift, when compared to a control bucket serving all combinations uniformly at random.

Related papers

• Long-History User Transformers for Real-Time Ad Ranking [0.027185251060695432]
  We describe how a production advertising system resolves this conflict by decoupling history encoding from real-time inference.<n>A high-capacity offline transformer asynchronously encodes the user's full cross-surface interaction history into a compact representation cached in a feature store.<n>In production A/B experiments, the system improves the primary ranking metric by +2.77% in search advertising and +2.1% on the Yandex Advertising Network, with revenue gains of +2.26% and +0.43% respectively.
  arXiv  Detail & Related papers  (2026-07-15T19:51:16Z)
• Large Foundation Model for Ads Recommendation [50.71446552453167]
  We propose LFM4Ads, an All-Representation Multi-Granularity transfer framework for ads recommendation.<n>LFM4Ads has been successfully deployed in Tencent's industrial-scale advertising platform.
  arXiv  Detail & Related papers  (2025-08-20T10:18:01Z)
• Bidding-Aware Retrieval for Multi-Stage Consistency in Online Advertising [30.108437268612438]
  Bidding-Aware Retrieval (BAR) is a model-based retrieval framework that addresses multi-stage inconsistency by incorporating ad bid value into the retrieval scoring function.<n>BAR's core innovation is Bidding-Aware Modeling, incorporating bid signals through monotonicity-constrained learning and multi-task distillation to ensure economically coherent representations.<n>Extensive offline experiments and full-scale deployment across Alibaba's display advertising platform validated BAR's efficacy.
  arXiv  Detail & Related papers  (2025-08-07T09:43:34Z)
• External Evaluation of Discrimination Mitigation Efforts in Meta's Ad Delivery [47.418845064441605]
  We show that the Variance Reduction System (VRS) implemented by Meta does not meaningfully improve access to opportunities for individuals.<n>We then conduct experiments to evaluate VRS with real-world ads, and show that while VRS does reduce variance, it also raises advertiser costs.<n>We show our approach outperforms VRS by both increasing ad exposure for users from all groups and reducing cost to advertisers.
  arXiv  Detail & Related papers  (2025-06-19T19:29:26Z)
• Soft Frequency Capping for Improved Ad Click Prediction in Yahoo Gemini Native [1.9315883475944244]
  Yahoo's native advertising (also known as Gemini native) serves billions of ad impressions daily, reaching a yearly run-rate of many hundred of millions USD. Offset is a one-pass algorithm that updates its model for every new batch of logged data using a gradient descent (SGD) based approach. We propose a soft frequency capping (SFC) approach, where the frequency feature is incorporated into the OFFSET model as a user-ad feature and its weight vector is learned via logistic regression.
  arXiv  Detail & Related papers  (2023-12-08T14:12:49Z)
• 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)
• 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)
• Multi-Channel Sequential Behavior Networks for User Modeling in Online Advertising [4.964012641964141]
  This paper presents Multi-Channel Sequential Behavior Network (MC-SBN), a deep learning approach for embedding users and ads in a semantic space. Our proposed user encoder architecture summarizes user activities from multiple input channels--such as previous search queries, visited pages, or clicked ads--into a user vector. The results demonstrate that MC-SBN can improve the ranking of relevant ads and boost the performance of both click prediction and conversion prediction.
  arXiv  Detail & Related papers  (2020-12-27T06:13:29Z)
• CAMTA: Causal Attention Model for Multi-touch Attribution [25.258282793367453]
  We propose CAMTA, a novel deep recurrent neural network architecture which is a casual attribution mechanism for user-personalised MTA. We demonstrate the superior performance of CAMTA with respect to prediction accuracy as compared to several baselines.
  arXiv  Detail & Related papers  (2020-12-21T15:05:00Z)
• 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)
• 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.