Private Empirical Risk Minimization, Revisited

In this paper, we initiate a systematic investigation of differentially private algorithms for convex empirical risk minimization. Various instantiations of this problem have been studied before. We provide new algorithms and matching lower bounds for private ERM assuming only that each data point’s contribution to the loss function is Lipschitz bounded and that the domain of optimization is bounded. We provide a separate set of algorithms and matching lower bounds for the setting in which the loss functions are known to also be strongly convex. Our algorithms run in polynomial time, and in some cases even match the optimal nonprivate running time (as measured by oracle complexity). We give separate algorithms (and lower bounds) for ( , 0)and ( , δ)-differential privacy; perhaps surprisingly, the techniques used for designing optimal algorithms in the two cases are completely different. Our lower bounds apply even to very simple, smooth function families, such as linear and quadratic functions. This implies that algorithms from previous work can be used to obtain optimal error rates, under the additional assumption that the contributions of each data point to the loss function is smooth. We show that simple approaches to smoothing arbitrary loss functions (in order to apply previous techniques) do not yield optimal error rates. In particular, optimal algorithms were not previously known for problems such as training support vector machines and the high-dimensional median. ∗Computer Science and Engineering Department, The Pennsylvania State University. {bassily,asmith}@psu.edu. R.B. and A.S. were supported in part by NSF awards #0747294 and #0941553. †A.S. is on sabbatical at, and partly supported by, Boston University’s Hariri Institute for Computing and Harvard University’s “Privacy Tools” project. ‡Stanford University and Microsoft Research. [email protected]. Supported in part by the Sloan Foundation. ar X iv :1 40 5. 70 85 v1 [ cs .L G ] 2 7 M ay 2 01 4