RelaxLoss: Defending Membership Inference Attacks without Losing Utility

Dingfan Chen, Ning Yu, Mario Fritz
7/12/2022
cs.LGcs.CR

Official code: DingfanChen/RelaxLoss (48 stars, MIT, last commit 2022-08-18).

Abstract

As a long-term threat to the privacy of training data, membership inference attacks (MIAs) emerge ubiquitously in machine learning models. Existing works evidence strong connection between the distinguishability of the training and testing loss distributions and the model's vulnerability to MIAs. Motivated by existing results, we propose a novel training framework based on a relaxed loss with a more achievable learning target, which leads to narrowed generalization gap and reduced privacy leakage. RelaxLoss is applicable to any classification model with added benefits of easy implementation and negligible overhead. Through extensive evaluations on five datasets with diverse modalities (images, medical data, transaction records), our approach consistently outperforms state-of-the-art defense mechanisms in terms of resilience against MIAs as well as model utility. Our defense is the first that can withstand a wide range of attacks while preserving (or even improving) the target model's utility. Source code is available at https://github.com/DingfanChen/RelaxLoss

View on arXivView PDF

Code Implementations(1)

MIT

Official implementation of "RelaxLoss: Defending Membership Inference Attacks without Losing Utility" (ICLR 2022)

489PythonFeb 7, 20224 years agoMIT

Similar Papers

Cite this paper

@article{chen2022relaxloss,
  title  = {RelaxLoss: Defending Membership Inference Attacks without Losing Utility},
  author = {Dingfan Chen and Ning Yu and Mario Fritz},
  year   = {2022},
  eprint = {2207.05801},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.05801v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.05801.svg)](https://codeofpaper.com/paper/2207.05801)

Discussion