mlsanityData to 7 Oct 2026

Transfer Learning In Differential Privacy's Hybrid-Model

arXiv 2201.12018 ↗First posted 28 Jan 2022cs.LG cs.CR cs.DScited by 3

Not on the map. Why?

Abstract (arXiv)

The hybrid-model (Avent et al 2017) in Differential Privacy is a an augmentation of the local-model where in addition to N local-agents we are assisted by one special agent who is in fact a curator holding the sensitive details of n additional individuals. Here we study the problem of machine learning in the hybrid-model where the n individuals in the curators dataset are drawn from a different distribution than the one of the general population (the local-agents). We give a general scheme -- Subsample-Test-Reweigh -- for this transfer learning problem, which reduces any curator-model DP-learner to a hybrid-model learner in this setting using iterative subsampling and reweighing of the n examples held by the curator based on a smooth variation of the Multiplicative-Weights algorithm (introduced by Bun et al, 2020). Our scheme has a sample complexity which relies on the chi-squared divergence between the two distributions. We give worst-case analysis bounds on the sample complexity required for our private reduction. Aiming to reduce said sample complexity, we give two specific instances our sample complexity can be drastically reduced (one instance is analyzed mathematically, while the other - empirically) and pose several directions for follow-up work.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 17 of its 56 references that are in the map. First posted on arXiv 28 Jan 2022.

Builds on

17 of 56 references.

References · 17

  1. 2019Introduction to Online Convex Optimizationcited by 793
  2. 2017Renyi Differential Privacycited by 643
  3. 2016Concentrated Differential Privacy: Simplifications, Extensions, and Lower Boundscited by 339
  4. 2018Scalable Private Learning with PATEcited by 266
  5. 2018Distributed Differential Privacy via Shufflingcited by 115
  6. 2017Finite Sample Differentially Private Confidence Intervalscited by 103
  7. 2019The Privacy Blanket of the Shuffle Modelcited by 73
  8. 2019Differentially Private Meta-Learningcited by 40
  9. 2015Local, Private, Efficient Protocols for Succinct Histogramscited by 35
  10. 2020Private Summation in the Multi-Message Shuffle Modelcited by 34
  11. 2021Differentially Private Aggregation in the Shuffle Model: Almost Central Accuracy in Almost a Single Messagecited by 18
  12. 2019The Role of Interactivity in Local Differential Privacycited by 15
5 more
  1. 2020Efficient, Noise-Tolerant, and Private Learning via Boostingcited by 15
  2. 2017BLENDER: Enabling Local Search with a Hybrid Differential Privacy Modelcited by 14
  3. 2020Effective Sample Size, Dimensionality, and Generalization in Covariate Shift Adaptationcited by 12
  4. 2019The power of synergy in differential privacy: Combining a small curator with local randomizerscited by 6
  5. 2021Differentially Private Transferrable Deep Learning with Membership-Mappingscited by 5

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 1.

3 papers.