Click Without Compromise: Online Advertising Measurement via Per User Differential Privacy

• URL: http://arxiv.org/abs/2406.02463v2
• Date: Tue, 14 Jan 2025 20:36:22 GMT
• Title: Click Without Compromise: Online Advertising Measurement via Per User Differential Privacy
• Authors: Yingtai Xiao, Jian Du, Shikun Zhang, Wanrong Zhang, Qiang Yan, Danfeng Zhang, Daniel Kifer,
• Abstract summary: We introduce AdsBPC, a novel user-level differential privacy protection scheme for online advertising measurement results. AdsBPC achieves a 33% to 95% increase in accuracy over existing streaming DP mechanisms applied to advertising measurement.
• Score: 24.007524271317962
• License:
• Abstract: Online advertising is a cornerstone of the Internet ecosystem, with advertising measurement playing a crucial role in optimizing efficiency. Ad measurement entails attributing desired behaviors, such as purchases, to ad exposures across various platforms, necessitating the collection of user activities across these platforms. As this practice faces increasing restrictions due to rising privacy concerns, safeguarding user privacy in this context is imperative. Our work is the first to formulate the real-world challenge of advertising measurement systems with real-time reporting of streaming data in advertising campaigns. We introduce AdsBPC, a novel user-level differential privacy protection scheme for online advertising measurement results. This approach optimizes global noise power and results in a non-identically distributed noise distribution that preserves differential privacy while enhancing measurement accuracy. Through experiments on both real-world advertising campaigns and synthetic datasets, AdsBPC achieves a 33% to 95% increase in accuracy over existing streaming DP mechanisms applied to advertising measurement. This highlights our method's effectiveness in achieving superior accuracy alongside a formal privacy guarantee, thereby advancing the state-of-the-art in privacy-preserving advertising measurement.

Related papers

• 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)
• On the Use of Proxies in Political Ad Targeting [49.61009579554272]
  We show that major political advertisers circumvented mitigations by targeting proxy attributes. Our findings have crucial implications for the ongoing discussion on the regulation of political advertising.
  arXiv  Detail & Related papers  (2024-10-18T17:15:13Z)
• 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)
• Differentially Private Ad Conversion Measurement [44.91290951502002]
  We develop a formal framework for private ad conversion measurement using differential privacy (DP) In particular, we define the notion of an operationally valid configuration of the attribution rule. We then provide, for the set of configurations that most commonly arises in practice, a complete characterization.
  arXiv  Detail & Related papers  (2024-03-22T14:18:52Z)
• Theoretically Principled Federated Learning for Balancing Privacy and Utility [61.03993520243198]
  We propose a general learning framework for the protection mechanisms that protects privacy via distorting model parameters. It can achieve personalized utility-privacy trade-off for each model parameter, on each client, at each communication round in federated learning.
  arXiv  Detail & Related papers  (2023-05-24T13:44:02Z)
• Protecting User Privacy in Online Settings via Supervised Learning [69.38374877559423]
  We design an intelligent approach to online privacy protection that leverages supervised learning. By detecting and blocking data collection that might infringe on a user's privacy, we can restore a degree of digital privacy to the user.
  arXiv  Detail & Related papers  (2023-04-06T05:20:16Z)
• Towards a User Privacy-Aware Mobile Gaming App Installation Prediction Model [0.8602553195689513]
  We investigate the process of predicting a mobile gaming app installation from the point of view of a demand-side platform. We explore the trade-off between privacy preservation and model performance. We conclude that privacy-aware models might still preserve significant capabilities.
  arXiv  Detail & Related papers  (2023-02-07T09:14:59Z)
• 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)
• Challenges and approaches to privacy preserving post-click conversion prediction [3.4071263815701336]
  We provide an overview of the challenges and constraints when learning conversion models in this setting. We introduce a novel approach for training these models that makes use of post-ranking signals. We show using offline experiments on real world data that it outperforms a model relying on opt-in data alone.
  arXiv  Detail & Related papers  (2022-01-29T21:36:01Z)
• 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.