mlsanityData to 14 Oct 2026

Masked LARk: Masked Learning, Aggregation and Reporting worKflow

arXiv 2110.14794 ↗First posted 27 Oct 2021cs.CR cs.LG stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

Today, many web advertising data flows involve passive cross-site tracking of users. Enabling such a mechanism through the usage of third party tracking cookies (3PC) exposes sensitive user data to a large number of parties, with little oversight on how that data can be used. Thus, most browsers are moving towards removal of 3PC in subsequent browser iterations. In order to substantially improve end-user privacy while allowing sites to continue to sustain their business through ad funding, new privacy-preserving primitives need to be introduced. In this paper, we discuss a new proposal, called Masked LARk, for aggregation of user engagement measurement and model training that prevents cross-site tracking, while remaining (a) flexible, for engineering development and maintenance, (b) secure, in the sense that cross-site tracking and tracing are blocked and (c) open for continued model development and training, allowing advertisers to serve relevant ads to interested users. We introduce a secure multi-party compute (MPC) protocol that utilizes "helper" parties to train models, so that once data leaves the browser, no downstream system can individually construct a complete picture of the user activity. For training, our key innovation is through the usage of masking, or the obfuscation of the true labels, while still allowing a gradient to be accurately computed in aggregate over a batch of data. Our protocol only utilizes light cryptography, at such a level that an interested yet inexperienced reader can understand the core algorithm. We develop helper endpoints that implement this system, and give example usage of training in PyTorch.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 11 of its 35 references that are in the map. First posted on arXiv 27 Oct 2021.

Builds on

11 of 35 references.

References · 11

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2019Advances and Open Problems in Federated Learningcited by 3,046
  3. 2016Deep Learning with Differential Privacycited by 2,728
  4. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  5. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
  6. 2014Compressing Deep Convolutional Networks using Vector Quantizationcited by 195
  7. 2019Adaptive Gradient Methods with Dynamic Bound of Learning Ratecited by 183
  8. 2020CrypTFlow2: Practical 2-Party Secure Inferencecited by 82
  9. 2020Scaling up Differentially Private Deep Learning with Fast Per-Example Gradient Clippingcited by 47
  10. 2017Prio: Private, Robust, and Scalable Computation of Aggregate Statisticscited by 36
  11. 2020Lightweight Techniques for Private Heavy Hitterscited by 13

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 0; 2024: 1.

2 papers.