Skip to yearly menu bar Skip to main content


Poster

Distributed Learning without Distress: Privacy-Preserving Empirical Risk Minimization

Bargav Jayaraman · Lingxiao Wang · David Evans · Quanquan Gu

Room 517 AB #155

Keywords: [ Convex Optimization ] [ Privacy, Anonymity, and Security ]


Abstract:

Distributed learning allows a group of independent data owners to collaboratively learn a model over their data sets without exposing their private data. We present a distributed learning approach that combines differential privacy with secure multi-party computation. We explore two popular methods of differential privacy, output perturbation and gradient perturbation, and advance the state-of-the-art for both methods in the distributed learning setting. In our output perturbation method, the parties combine local models within a secure computation and then add the required differential privacy noise before revealing the model. In our gradient perturbation method, the data owners collaboratively train a global model via an iterative learning algorithm. At each iteration, the parties aggregate their local gradients within a secure computation, adding sufficient noise to ensure privacy before the gradient updates are revealed. For both methods, we show that the noise can be reduced in the multi-party setting by adding the noise inside the secure computation after aggregation, asymptotically improving upon the best previous results. Experiments on real world data sets demonstrate that our methods provide substantial utility gains for typical privacy requirements.

Live content is unavailable. Log in and register to view live content