mlsanityData to 14 Oct 2026

One-Bit Matrix Completion with Differential Privacy

arXiv 2110.00719 ↗First posted 2 Oct 2021cs.CR cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

As a prevailing collaborative filtering method for recommendation systems, one-bit matrix completion requires data collected by users to provide personalized service. Due to insidious attacks and unexpected inference, the release of users' data often raises serious privacy concerns. To address this issue, differential privacy(DP) has been widely used in standard matrix completion models. To date, however, little has been known about how to apply DP to achieve privacy protection in one-bit matrix completion. In this paper, we propose a unified framework for ensuring a strong privacy guarantee of one-bit matrix completion with DP. In our framework, we develop four different private perturbation mechanisms corresponding to different stages of one-bit matrix completion. For each mechanism, we design a privacy-preserving algorithm and provide a theoretical recovery error bound under the proper conditions. Numerical experiments on synthetic and real-world datasets demonstrate the effectiveness of our proposal. Compared to the one-bit matrix completion without privacy protection, our proposed mechanisms can maintain high-level privacy protection with marginal loss of completion accuracy.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 61 references that are in the map. First posted on arXiv 2 Oct 2021.

Builds on

12 of 61 references.

References · 12

  1. 2016Deep Learning with Differential Privacycited by 2,728
  2. 2017Neural Collaborative Filteringcited by 1,111
  3. 2018Differentially Private Empirical Risk Minimization Revisited: Faster and More Generalcited by 128
  4. 2014Differentially Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Boundscited by 107
  5. 2017Efficient Private ERM for Smooth Objectivescited by 61
  6. 2014PU Learning for Matrix Completioncited by 30
  7. 2013A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completioncited by 25
  8. 2015Fast Differentially Private Matrix Factorizationcited by 20
  9. 2018Deep Item-based Collaborative Filtering for Top-N Recommendationcited by 20
  10. 20161-bit Matrix Completion: PAC-Bayesian Analysis of a Variational Approximationcited by 11
  11. 20151-Bit Matrix Completion under Exact Low-Rank Constraintcited by 7
  12. 2019A divide-and-conquer algorithm for binary matrix completioncited by 2

Built on by

Not cited yet.