Ad Creative Discontinuation Prediction with Multi-Modal Multi-Task Neural Survival Networks

• URL: http://arxiv.org/abs/2204.11588v1
• Date: Sat, 2 Apr 2022 04:57:23 GMT
• Title: Ad Creative Discontinuation Prediction with Multi-Modal Multi-Task Neural Survival Networks
• Authors: Shunsuke Kitada, Hitoshi Iyatomi, Yoshifumi Seki
• Abstract summary: Discontinuing ad creatives at an appropriate time is one of the most important ad operations that can have a significant impact on sales. We propose a practical prediction framework for the discontinuation of ad creatives with a hazard function-based loss function. We evaluate our framework using the large-scale ad creative dataset, including 10 billion scale impressions.
• Score: 7.94957965474334
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Discontinuing ad creatives at an appropriate time is one of the most important ad operations that can have a significant impact on sales. Such operational support for ineffective ads has been less explored than that for effective ads. After pre-analyzing 1,000,000 real-world ad creatives, we found that there are two types of discontinuation: short-term (i.e., cut-out) and long-term (i.e., wear-out). In this paper, we propose a practical prediction framework for the discontinuation of ad creatives with a hazard function-based loss function inspired by survival analysis. Our framework predicts the discontinuations with a multi-modal deep neural network that takes as input the ad creative (e.g., text, categorical, image, numerical features). To improve the prediction performance for the two different types of discontinuations and for the ad creatives that contribute to sales, we introduce two new techniques: (1) a two-term estimation technique with multi-task learning and (2) a click-through rate-weighting technique for the loss function. We evaluated our framework using the large-scale ad creative dataset, including 10 billion scale impressions. In terms of the concordance index (short: 0.896, long: 0.939, and overall: 0.792), our framework achieved significantly better performance than the conventional method (0.531). Additionally, we confirmed that our framework (i) demonstrated the same degree of discontinuation effect as manual operations for short-term cases, and (ii) accurately predicted the ad discontinuation order, which is important for long-running ad creatives for long-term cases.

Related papers

• Causal Inference on Stopped Random Walks in Online Advertising [2.758187691493102]
  We consider a causal inference problem in online advertising systems.<n>Each treatment corresponds to a parameter value of the advertising mechanism.<n>We estimate through experiments the corresponding long-term treatment effect.
  arXiv  Detail & Related papers  (2026-02-05T18:43:29Z)
• Ads that Stick: Near-Optimal Ad Optimization through Psychological Behavior Models [11.13292106104811]
  Existing scheduling policies rely on simples, such as uniform spacing and frequency caps, that overlook long-term user interest.<n>We model change in user interest upon showing ads based on mere exposure, hedonic adaptation, and operant conditioning.<n>We show that, if the number of displayed ads is fixed, then the optimal ad-schedule only depends on the operant conditioning function.
  arXiv  Detail & Related papers  (2025-09-24T16:35:18Z)
• Practice on Long Behavior Sequence Modeling in Tencent Advertising [75.65309022911994]
  Long-sequence modeling has become an indispensable frontier in recommendation systems for capturing users' long-term preferences.<n>We propose several practical approaches within the two-stage framework for long-sequence modeling.<n> Deployed in production on Tencent's large-scale advertising platforms, our innovations delivered significant performance gains.
  arXiv  Detail & Related papers  (2025-09-10T06:55:57Z)
• 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)
• DistinctAD: Distinctive Audio Description Generation in Contexts [62.58375366359421]
  We propose DistinctAD, a framework for generating Audio Descriptions that emphasize distinctiveness to produce better narratives. To address the domain gap, we introduce a CLIP-AD adaptation strategy that does not require additional AD corpora. In Stage-II, DistinctAD incorporates two key innovations: (i) a Contextual Expectation-Maximization Attention (EMA) module that reduces redundancy by extracting common bases from consecutive video clips, and (ii) an explicit distinctive word prediction loss that filters out repeated words in the context.
  arXiv  Detail & Related papers  (2024-11-27T09:54:59Z)
• Ads Supply Personalization via Doubly Robust Learning [13.392289135329833]
  Ads supply personalization aims to balance the revenue and user engagement, two long-term objectives in social media ads, by tailoring the ad quantity and density. In this paper, we present a streamlined framework for personalized ad supply. It optimally utilizes information from data collection policies through the doubly robust learning. Consequently, it significantly improves the accuracy of long-term treatment effect estimates.
  arXiv  Detail & Related papers  (2024-09-29T06:09:52Z)
• Long-Term Ad Memorability: Understanding & Generating Memorable Ads [54.23854539909078]
  There has been no large-scale study on the memorability of ads. We release the first memorability dataset, LAMBDA, consisting of 1749 participants and 2205 ads covering 276 brands.
  arXiv  Detail & Related papers  (2023-09-01T10:27:04Z)
• Discrimination through Image Selection by Job Advertisers on Facebook [79.21648699199648]
  We propose and investigate the prevalence of a new means for discrimination in job advertising. It combines both targeting and delivery -- through the disproportionate representation or exclusion of people of certain demographics in job ad images. We use the Facebook Ad Library to demonstrate the prevalence of this practice.
  arXiv  Detail & Related papers  (2023-06-13T03:43:58Z)
• Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions [42.002983450368134]
  We study the question of how to bid in first-price auctions. Unlike in second-price auctions, bidding one's private value truthfully is no longer optimal. We consider two types of hints: one where a single point-prediction is available, and the other where a hint interval is available.
  arXiv  Detail & Related papers  (2022-11-05T19:20:53Z)
• Persuasion Strategies in Advertisements [68.70313043201882]
  We introduce an extensive vocabulary of persuasion strategies and build the first ad image corpus annotated with persuasion strategies. We then formulate the task of persuasion strategy prediction with multi-modal learning. We conduct a real-world case study on 1600 advertising campaigns of 30 Fortune-500 companies.
  arXiv  Detail & Related papers  (2022-08-20T07:33:13Z)
• Contextual Bandits for Advertising Campaigns: A Diffusion-Model Independent Approach (Extended Version) [73.59962178534361]
  We study an influence problem in which little is assumed to be known about the diffusion network or about the model that determines how information may propagate. In this setting, an explore-exploit approach could be used to learn the key underlying diffusion parameters, while running the campaign. We describe and compare two methods of contextual multi-armed bandits, with upper-confidence bounds on the remaining potential of influencers.
  arXiv  Detail & Related papers  (2022-01-13T22:06:10Z)
• Mitigating Divergence of Latent Factors via Dual Ascent for Low Latency Event Prediction Models [0.739706777911384]
  Real-world content recommendation marketplaces exhibit certain behaviors and are imposed by constraints that are not always apparent in common static offline data sets. We present a systematic method to prevent model parameters from diverging by imposing a carefully chosen set of constraints on the model's latent vectors. We conduct an online experiment which shows a substantial reduction in the number of diverging instances, and a significant improvement to both user experience and revenue.
  arXiv  Detail & Related papers  (2021-11-15T16:09:48Z)
• Predicting Online Video Advertising Effects with Multimodal Deep Learning [33.20913249848369]
  We propose a method for predicting the click through rate (CTR) of video advertisements and analyzing the factors that determine the CTR. In this paper, we demonstrate an optimized framework for accurately predicting the effects by taking advantage of the multimodal nature of online video advertisements.
  arXiv  Detail & Related papers  (2020-12-22T06:24:01Z)
• Learning to Infer User Hidden States for Online Sequential Advertising [52.169666997331724]
  We propose our Deep Intents Sequential Advertising (DISA) method to address these issues. The key part of interpretability is to understand a consumer's purchase intent which is, however, unobservable (called hidden states)
  arXiv  Detail & Related papers  (2020-09-03T05:12:26Z)
• 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 Causal Inference for Advertising in Real-Time Bidding Auctions [1.9336815376402723]
  This paper proposes a new approach to perform causal inference on advertising bought through real-time bidding systems. We first show that the effects of advertising are identified by the optimal bids. We introduce an adapted Thompson sampling (TS) algorithm to solve a multi-armed bandit problem.
  arXiv  Detail & Related papers  (2019-08-22T21:13:03Z)

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.