Blind Targeting: Personalization under Third-Party Privacy Constraints
Anya Shchetkina

TL;DR
This paper introduces a novel Bayesian optimization-based method for effective targeted advertising under strict privacy constraints, enabling near non-private targeting performance using aggregate, noisy data.
Contribution
It develops a new probabilistic querying strategy with integral posterior updates and targeting-aware acquisition functions for privacy-preserving data exploration.
Findings
Achieves 97-101% of non-private targeting potential
Outperforms simple benchmark strategies significantly
Matches the performance of state-of-the-art non-private methods
Abstract
Major advertising platforms recently increased privacy protections by limiting advertisers' access to individual-level data. Instead of providing access to granular raw data, the platforms only allow a limited number of aggregate queries to a dataset, which is further protected by adding differentially private noise. This paper studies whether and how advertisers can design effective targeting policies within these restrictive privacy preserving data environments. To achieve this, I develop a probabilistic machine learning method based on Bayesian optimization, which facilitates dynamic data exploration. Since Bayesian optimization was designed to sample points from a function to find its maximum, it is not applicable to aggregate queries and to targeting. Therefore, I introduce two innovations: (i) integral updating of posteriors which allows to select the best regions of the data to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
