Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Variational Approach to Privacy and Fairness (2006.06332v3)

Published 11 Jun 2020 in stat.ML, cs.IT, cs.LG, and math.IT

Abstract: In this article, we propose a new variational approach to learn private and/or fair representations. This approach is based on the Lagrangians of a new formulation of the privacy and fairness optimization problems that we propose. In this formulation, we aim to generate representations of the data that keep a prescribed level of the relevant information that is not shared by the private or sensitive data, while minimizing the remaining information they keep. The proposed approach (i) exhibits the similarities of the privacy and fairness problems, (ii) allows us to control the trade-off between utility and privacy or fairness through the Lagrange multiplier parameter, and (iii) can be comfortably incorporated to common representation learning algorithms such as the VAE, the $\beta$-VAE, the VIB, or the nonlinear IB.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Borja Rodríguez-Gálvez (18 papers)
  2. Ragnar Thobaben (20 papers)
  3. Mikael Skoglund (211 papers)
Citations (23)

Summary

We haven't generated a summary for this paper yet.