One-Bit Matrix Completion with Differential Privacy
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
NLGCL: Naturally Existing Neighbor Layers Graph Contrastive Learning for Recommendation
RAG-VisualRec: An Open Resource for Vision- and Text-Enhanced Retrieval-Augmented Generation in Recommendation
Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation
Discrete Scale-invariant Metric Learning for Efficient Collaborative Filtering
N$^2$: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix Completion
SGCL: Unifying Self-Supervised and Supervised Learning for Graph Recommendation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.