A Variational Approach to Privacy and Fairness

被引:1
作者
Rodriguez-Galvez, Borja [1 ]
Thobaben, Ragnar [1 ]
Skoglund, Mikael [1 ]
机构
[1] KTH Royal Inst Technol, Div Informat Sci & Engn ISE, Stockholm, Sweden
来源
2021 IEEE INFORMATION THEORY WORKSHOP (ITW) | 2021年
基金
瑞典研究理事会;
关键词
D O I
10.1109/ITW48936.2021.9611429
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:6
相关论文
共 28 条
  • [1] Achille A, 2018, J MACH LEARN RES, V19
  • [2] Alemi A. A., 2016, PROC INT C LEARN REP
  • [3] [Anonymous], 2015, ARXIV151105897
  • [4] Belghazi MI, 2018, PR MACH LEARN RES, V80
  • [5] Bialek William, 2000, The information bottleneck method
  • [6] Boyd L., 2004, Convex Optimization, DOI DOI 10.1017/CBO9780511804441
  • [7] Building Classifiers with Independency Constraints
    Calders, Toon
    Kamiran, Faisal
    Pechenizkiy, Mykola
    [J]. 2009 IEEE INTERNATIONAL CONFERENCE ON DATA MINING WORKSHOPS (ICDMW 2009), 2009, : 13 - 18
  • [8] Calmon FD, 2012, ANN ALLERTON CONF, P1401, DOI 10.1109/Allerton.2012.6483382
  • [9] Chouldechova A., 2018, ARXIV PREPRINT ARXIV
  • [10] Corbett-Davies Sam, 2018, MEASURE MISMEASURE F