Randomized algorithms for precise measurement of differentially-private, personalized recommendations
Not on the map. Why?
Abstract (arXiv)
Personalized recommendations form an important part of today's internet ecosystem, helping artists and creators to reach interested users, and helping users to discover new and engaging content. However, many users today are skeptical of platforms that personalize recommendations, in part due to historically careless treatment of personal data and data privacy. Now, businesses that rely on personalized recommendations are entering a new paradigm, where many of their systems must be overhauled to be privacy-first. In this article, we propose an algorithm for personalized recommendations that facilitates both precise and differentially-private measurement. We consider advertising as an example application, and conduct offline experiments to quantify how the proposed privacy-preserving algorithm affects key metrics related to user experience, advertiser value, and platform revenue compared to the extremes of both (private) non-personalized and non-private, personalized implementations.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 14 of its 58 references that are in the map. First posted on arXiv 7 Aug 2023.
Builds on
14 of 58 references.
References · 14
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2016Deep Learning with Differential Privacycited by 2,728
- 2016Wide & Deep Learning for Recommender Systemscited by 747
- 2017Deep Interest Network for Click-Through Rate Predictioncited by 544
- 2014RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Responsecited by 272
- 2018Amplification by Shuffling: From Local to Central Differential Privacy via Anonymitycited by 164
- 2018Differentially Private Contextual Linear Banditscited by 82
- 2017Prio: Private, Robust, and Scalable Computation of Aggregate Statisticscited by 36
- 2020Permute-and-Flip: A new mechanism for differentially private selectioncited by 22
- 2017Learning Piece-wise Linear Models from Large Scale Data for Ad Click Predictioncited by 18
- 2021The Permute-and-Flip Mechanism is Identical to Report-Noisy-Max with Exponential Noisecited by 14
- 2021An Efficient Deep Distribution Network for Bid Shading in First-Price Auctionscited by 14
2 more
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025Private Selection with Heterogeneous Sensitivitiescited by 0
- 2025Private Selection with Heterogeneous Sensitivities9 Jan 2025