mlsanityData to 7 Oct 2026

Learning across Data Owners with Joint Differential Privacy

arXiv 2305.15723 ↗First posted 25 May 2023cs.LG cs.CR math.OCcited by 0

Not on the map. Why?

Abstract (arXiv)

In this paper, we study the setting in which data owners train machine learning models collaboratively under a privacy notion called joint differential privacy [Kearns et al., 2018]. In this setting, the model trained for each data owner j uses j's data without privacy consideration and other owners' data with differential privacy guarantees. This setting was initiated in [Jain et al., 2021] with a focus on linear regressions. In this paper, we study this setting for stochastic convex optimization (SCO). We present an algorithm that is a variant of DP-SGD [Song et al., 2013; Abadi et al., 2016] and provides theoretical bounds on its population loss. We compare our algorithm to several baselines and discuss for what parameter setups our algorithm is more preferred. We also empirically study joint differential privacy in the multi-class classification problem over two public datasets. Our empirical findings are well-connected to the insights from our theoretical results.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 26 of its 35 references that are in the map. First posted on arXiv 25 May 2023.

Builds on

26 of 35 references.

References · 26

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  3. 2016Deep Learning with Differential Privacycited by 2,682
  4. 2014Convex Optimization: Algorithms and Complexitycited by 569
  5. 2018Privacy Amplification by Subsampling: Tight Analyses via Couplings and Divergencescited by 237
  6. 2018Subsampled R'enyi Differential Privacy and Analytical Moments Accountantcited by 234
  7. 2019Private Stochastic Convex Optimization with Optimal Ratescited by 183
  8. 2020Stability of Stochastic Gradient Descent on Nonsmooth Convex Lossescited by 172
  9. 2020Private Stochastic Convex Optimization: Optimal Rates in Linear Timecited by 152
  10. 2014Differentially Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Boundscited by 104
  11. 2021Private Stochastic Convex Optimization: Optimal Rates in ℓ1 Geometrycited by 83
  12. 2021Learning with User-Level Privacycited by 72
14 more
  1. 2020On Differentially Private Stochastic Convex Optimization with Heavy-tailed Datacited by 51
  2. 2021Non-Euclidean Differentially Private Stochastic Convex Optimization: Optimal Rates in Linear Timecited by 51
  3. 2022When Does Differentially Private Learning Not Suffer in High Dimensions?cited by 48
  4. 2021Improved Rates for Differentially Private Stochastic Convex Optimization with Heavy-Tailed Datacited by 47
  5. 2021Differentially Private Stochastic Optimization: New Results in Convex and Non-Convex Settingscited by 45
  6. 2021Tight and Robust Private Mean Estimation with Few Userscited by 26
  7. 2013Private Matchings and Allocationscited by 23
  8. 2021Private Non-smooth Empirical Risk Minimization and Stochastic Convex Optimization in Subquadratic Stepscited by 21
  9. 2023ReSQueing Parallel and Private Stochastic Convex Optimizationcited by 17
  10. 2022Private Convex Optimization in General Normscited by 13
  11. 2023On User-Level Private Convex Optimizationcited by 8
  12. 2013Asymptotically Truthful Equilibrium Selection in Large Congestion Gamescited by 5
  13. 2014Privacy and Truthful Equilibrium Selection for Aggregative Gamescited by 5
  14. 2014Private Pareto Optimal Exchangecited by 2

Built on by

Not cited yet.