TL;DR
This paper introduces DL-MIA, a novel framework that improves membership inference attacks on recommender systems by reducing biases and estimation errors, achieving state-of-the-art results.
Contribution
The paper proposes a debiasing learning framework with a variational auto-encoder and weight estimator to enhance attack accuracy against recommender systems.
Findings
DL-MIA outperforms existing methods in attack success rate.
It effectively reduces bias and estimation errors.
Achieves state-of-the-art performance on real-world datasets.
Abstract
Learned recommender systems may inadvertently leak information about their training data, leading to privacy violations. We investigate privacy threats faced by recommender systems through the lens of membership inference. In such attacks, an adversary aims to infer whether a user's data is used to train the target recommender. To achieve this, previous work has used a shadow recommender to derive training data for the attack model, and then predicts the membership by calculating difference vectors between users' historical interactions and recommended items. State-of-the-art methods face two challenging problems: (1) training data for the attack model is biased due to the gap between shadow and target recommenders, and (2) hidden states in recommenders are not observational, resulting in inaccurate estimations of difference vectors. To address the above limitations, we propose a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
