Jo-DPMF: Differentially private matrix factorization learning through joint optimization
Jo-DPMF: Differentially private matrix factorization learning through joint optimization
复制标题
Jo-DPMF:通过联合优化进行差分私有矩阵分解学习
DOI:
10.1016/j.ins.2018.07.070
复制
发表时间:
2018-10-01
影响因子:
8.1
通讯作者:
Choo, Kim-Kwang Raymond
中科院分区:
文献类型:
--
作者:
Zhang, Feng;Lee, Victor E.;Choo, Kim-Kwang Raymond
Stochastic gradient descent (SGD) is a widely-used technique to implement matrix factorization. SGD-based matrix factorization involves many iterative computations. Therefore, according to the sequential composition theory of differential privacy, conventional implementation strategies of differentially private matrix factorization may lead to significant error accumulation, no matter whether the Laplace noise is added to the original matrix or to the factorized matrices. In fact, the implementation of differentially private matrix factorization is so challenging that results proposed to date have the problem of inefficient privacy and data utility. In this paper, we employ the objective perturbation method to address the challenge; this method dramatically alleviates error accumulation by perturbing the objective function instead of perturbing the results. Our method outperforms the state-of-the-art methods since it only requires a scalar noise rather than a vector noise to achieve the same magnitude of privacy. Furthermore, our method may learn the resulted matrices by joint optimization, which follows the conventional learning procedure of SGD and optimizes its convergence speed and accuracy as much as possible. In addition to the differential privacy guarantee, we also empirically show the way that the novel model works together with k-coRating, a k-anonymity-like privacy preserving model, to enhance data utility. (C) 2018 Elsevier Inc. All rights reserved.