paper-with-me

Papers

Learning Fair Representations via Rate-Distortion Maximization

2022-01-31 · Somnath Basu Roy Chowdhury, Snigdha Chaturvedi

Text representations learned by machine learning models often encode undesirable demographic information of the user. Predictive models based on these representations can rely on such information, resulting in biased decisions. We present a novel debiasing technique, Fairness-aware Rate Maximization (FaRM), that removes protected information by making representations of instances belonging to the same protected attribute class uncorrelated, using the rate-distortion function. FaRM is able to debias representations with or without a target task at hand. FaRM can also be adapted to remove information about multiple protected attributes simultaneously. Empirical evaluations show that FaRM achieves state-of-the-art performance on several datasets, and learned representations leak significantly less protected attribute information against an attack by a non-linear probing network.

📄 PDF Abstract BibTeX arXiv:2202.00035

Code (1)

brcsomnath/farm 공식 구현 pytorch

Tasks

AttributeFairness

Similar Papers 제목 키워드 기반

Sustaining Fairness via Incremental Learning

2022-08-25 · Somnath Basu Roy Chowdhury, Snigdha Chaturvedi

Machine learning systems are often deployed for making critical decisions like credit lending, hiring, etc. While making decisions, such systems often encode the user's demographic information (like gender, age) in their…

FairnessIncremental LearningRepresentation Learning

Understanding and Accelerating EM Algorithm's Convergence by Fair Competition Principle and Rate-Verisimilitude Function

2021-04-21 · Chenguang Lu

Why can the Expectation-Maximization (EM) algorithm for mixture models converge? Why can different initial parameters cause various convergence difficulties? The Q-L synchronization theory explains that the observed data…

Fairness in Monotone $k$-submodular Maximization: Algorithms and Applications

2024-11-08 · Yanhui Zhu, Samik Basu, A. Pavan

Submodular optimization has become increasingly prominent in machine learning and fairness has drawn much attention. In this paper, we propose to study the fair $k$-submodular maximization problem and develop a $\frac{1}…

Fairness

Adversarial Graph Embeddings for Fair Influence Maximization over Social Networks

2020-05-08 · Moein Khajehnejad, Ahmad Asgharian Rezaei, Mahmoudreza Babaei, Jessica Hoffmann 외

Influence maximization is a widely studied topic in network science, where the aim is to reach the maximum possible number of nodes, while only targeting a small initial set of individuals. It has critical applications i…

ClusteringFairnessGraph EmbeddingMarketing

Balancing Utility and Fairness in Submodular Maximization (Technical Report)

2022-11-02 · Yanhao Wang, Yuchen Li, Francesco Bonchi, Ying Wang

Submodular function maximization is a fundamental combinatorial optimization problem with plenty of applications -- including data summarization, influence maximization, and recommendation. In many of these problems, the…

Combinatorial OptimizationData SummarizationFairness