Targeted display advertising: the case of preferential attachment

• URL: http://arxiv.org/abs/2002.02879v1
• Date: Fri, 7 Feb 2020 16:23:17 GMT
• Title: Targeted display advertising: the case of preferential attachment
• Abstract summary: We develop "domain-adaptation" approaches to address the challenge of predicting interested users for the partners with insufficient data. Our approaches readily adapt to the new campaign data by incremental fine-tuning, and hence work at varying points of a campaign.
• Score: 5.144809478361603
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: An average adult is exposed to hundreds of digital advertisements daily (https://www.mediadynamicsinc.com/uploads/files/PR092214-Note-only-150-Ads-2mk.pdf), making the digital advertisement industry a classic example of a big-data-driven platform. As such, the ad-tech industry relies on historical engagement logs (clicks or purchases) to identify potentially interested users for the advertisement campaign of a partner (a seller who wants to target users for its products). The number of advertisements that are shown for a partner, and hence the historical campaign data available for a partner depends upon the budget constraints of the partner. Thus, enough data can be collected for the high-budget partners to make accurate predictions, while this is not the case with the low-budget partners. This skewed distribution of the data leads to "preferential attachment" of the targeted display advertising platforms towards the high-budget partners. In this paper, we develop "domain-adaptation" approaches to address the challenge of predicting interested users for the partners with insufficient data, i.e., the tail partners. Specifically, we develop simple yet effective approaches that leverage the similarity among the partners to transfer information from the partners with sufficient data to cold-start partners, i.e., partners without any campaign data. Our approaches readily adapt to the new campaign data by incremental fine-tuning, and hence work at varying points of a campaign, and not just the cold-start. We present an experimental analysis on the historical logs of a major display advertising platform (https://www.criteo.com/). Specifically, we evaluate our approaches across 149 partners, at varying points of their campaigns. Experimental results show that the proposed approaches outperform the other "domain-adaptation" approaches at different time points of the campaigns.

Related papers

• Constrained user-item allocation for e-commerce marketing campaigns [0.5219568203653523]
  We formalize this problem as auto-targeting: jointly selecting users and items to construct multiple disjoint campaigns.<n>We propose three complementary strategies: (i) constrained spectral biclustering to find dense regions in the user-item affinity matrix, (ii) greedy local search with pairwise swaps for greedy refinement, and (iii) a multi-armed bandit framework to escape local optima.<n>Results show that biclustering consistently achieves the highest campaign quality, lift, and fairness scores.
  arXiv  Detail & Related papers  (2026-06-08T15:26:14Z)
• Into the Unknown: Accounting for Missing Demographic Data when Mitigating Ad Delivery Skew [2.904614754159118]
  Online advertising platforms use algorithmic systems to power the process of matching ads to users, termed ad delivery.<n>Prior audits have demonstrated that ad delivery can be skewed by demographic attributes.<n>This under-delivery raises a serious concern in the context of ads promoting public services.
  arXiv  Detail & Related papers  (2026-05-12T15:36:21Z)
• Where to Explore: A Reach and Cost-Aware Approach for Unbiased Data Collection in Recommender Systems [4.013613514540094]
  This paper introduces an approach for delivering content-level exploration safely and efficiently by optimizing its placement based on reach and opportunity cost.<n> Deployed on a large-scale streaming platform with over 100 million monthly active users, our approach identifies scroll-depth regions with lower engagement.<n>Our method complements existing intra-row diversification and bandit-based exploration techniques by introducing a deployable, behaviorally informed mechanism for surfacing exploratory content at scale.
  arXiv  Detail & Related papers  (2025-12-11T04:03:44Z)
• Reach Measurement, Optimization and Frequency Capping In Targeted Online Advertising Under k-Anonymity [6.330502423961969]
  Frequency capping is a technology that enables marketers to control the number of times an ad is shown to a specific user. This paper delves into the issue of reach measurement and optimization within the context of $k$-anonymity. Experiments are performed to assess the trade-off between user privacy and the efficacy of online brand advertising.
  arXiv  Detail & Related papers  (2025-01-08T23:38:19Z)
• Labeled Datasets for Research on Information Operations [71.34999856621306]
  We present new labeled datasets about 26 campaigns, which contain both IO posts verified by a social media platform and over 13M posts by 303k accounts that discussed similar topics in the same time frames (control data) The datasets will facilitate the study of narratives, network interactions, and engagement strategies employed by coordinated accounts across various campaigns and countries.
  arXiv  Detail & Related papers  (2024-11-15T22:15:01Z)
• Insights from an experiment crowdsourcing data from thousands of US Amazon users: The importance of transparency, money, and data use [6.794366017852433]
  This paper shares an innovative approach to crowdsourcing user data to collect otherwise inaccessible Amazon purchase histories, spanning 5 years, from more than 5000 US users. We developed a data collection tool that prioritizes participant consent and includes an experimental study design. Experiment results (N=6325) reveal both monetary incentives and transparency can significantly increase data sharing.
  arXiv  Detail & Related papers  (2024-04-19T20:45:19Z)
• Organized Event Participant Prediction Enhanced by Social Media Retweeting Data [8.675064911866201]
  We propose to utilize social media retweeting activity data to enhance the learning of event participant prediction models. We conduct comprehensive experiments in two scenarios with real-world data.
  arXiv  Detail & Related papers  (2023-10-02T04:26:07Z)
• Ad-load Balancing via Off-policy Learning in a Content Marketplace [9.783697404304025]
  Ad-load balancing is a critical challenge in online advertising systems, particularly in the context of social media platforms. Traditional approaches to ad-load balancing rely on static allocation policies, which fail to adapt to changing user preferences and contextual factors. We present an approach that leverages off-policy learning and evaluation from logged bandit feedback.
  arXiv  Detail & Related papers  (2023-09-19T09:17:07Z)
• A Multimodal Analysis of Influencer Content on Twitter [40.41635575764701]
  Line between personal opinions and commercial content promotion is frequently blurred. This makes automatic detection of regulatory compliance breaches related to influencer advertising difficult. We introduce a new Twitter (now X) dataset consisting of 15,998 influencer posts mapped into commercial and non-commercial categories.
  arXiv  Detail & Related papers  (2023-09-06T15:07:23Z)
• 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)
• Personalizing Intervened Network for Long-tailed Sequential User Behavior Modeling [66.02953670238647]
  Tail users suffer from significantly lower-quality recommendation than the head users after joint training. A model trained on tail users separately still achieve inferior results due to limited data. We propose a novel approach that significantly improves the recommendation performance of the tail users.
  arXiv  Detail & Related papers  (2022-08-19T02:50:19Z)
• 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)
• Lessons from the AdKDD'21 Privacy-Preserving ML Challenge [57.365745458033075]
  A prominent proposal at W3C only allows sharing advertising signals through aggregated, differentially private reports of past displays. To study this proposal extensively, an open Privacy-Preserving Machine Learning Challenge took place at AdKDD'21. A key finding is that learning models on large, aggregated data in the presence of a small set of unaggregated data points can be surprisingly efficient and cheap.
  arXiv  Detail & Related papers  (2022-01-31T11:09:59Z)
• 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)
• Using Interaction Data to Predict Engagement with Interactive Media [8.35844047176969]
  This paper reports a study using data captured from audience interactions with an interactive TV show to model and predict engagement. We find that temporal metrics, including overall time spent on the experience and the interval between events, are predictive of engagement.
  arXiv  Detail & Related papers  (2021-08-04T10:28:36Z)

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.