Invariant Representations with Stochastically Quantized Neural Networks
Mattia Cerrato, Marius Köppel, Roberto Esposito, Stefan Kramer
Abstract
Representation learning algorithms offer the opportunity to learn invariant representations of the input data with regard to nuisance factors. Many authors have leveraged such strategies to learn fair representations, i.e., vectors where information about sensitive attributes is removed. These methods are attractive as they may be interpreted as minimizing the mutual information between a neural layer's activations and a sensitive attribute. However, the theoretical grounding of such methods relies either on the computation of infinitely accurate adversaries or on minimizing a variational upper bound of a mutual information estimate. In this paper, we propose a methodology for direct computation of the mutual information between neurons in a layer and a sensitive attribute. We employ stochastically-activated binary neural networks, which lets us treat neurons as random variables. Our method is therefore able to minimize an upper bound on the mutual information between the neural representations and a sensitive attribute. We show that this method compares favorably with the state of the art in fair representation learning and that the learned representations display a higher level of invariance compared to full-precision neural networks.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 33ccbf76-a7c1-4737-aaae-5edef5c9f527Cited by top-tier papers2
- Conditional Mutual Information for Disentangled Representations in Reinforcement LearningMhairi Dunion, Trevor McInroe, Kevin Sebastian Luck, Josiah Hanna et al.NeurIPS 2023 · 41 citations
- Information Bottleneck Analysis of Deep Neural Networks via Lossy CompressionIvan Butakov, Aleksander Tolmachev, Sofia Malanchuk, Anna Neopryatnaya et al.ICLR 2024 · 20 citations
Builds on2
Related papers
- Fair Representation Learning: An Alternative to Mutual InformationJi Liu, Zenan Li, Yuan Yao, Feng Xu et al.KDD 2022 · 14 citations
- Scalable Infomin LearningYanzhi Chen, Weihao Sun, Yingzhen Li, Adrian WellerNeurIPS 2022 · 10 citations
- Controllable Universal Fair Representation LearningYue Cui, Chen Ma, Kai Zheng, Lei Chen et al.WWW 2023 · 5 citations
- Fair Normalizing FlowsMislav Balunovic, Anian Ruoss, Martin T. VechevICLR 2022 · 46 citations
- Controllable Guarantees for Fair Outcomes via Contrastive Information EstimationUmang Gupta, Aaron M. Ferber, Bistra Dilkina, Greg Ver SteegAAAI 2021 · 78 citations
