English

Rank-Based Multi-task Learning for Fair Regression

Machine Learning 2020-09-25 v1 Machine Learning

Abstract

In this work, we develop a novel fairness learning approach for multi-task regression models based on a biased training dataset, using a popular rank-based non-parametric independence test, i.e., Mann Whitney U statistic, for measuring the dependency between target variable and protected variables. To solve this learning problem efficiently, we first reformulate the problem as a new non-convex optimization problem, in which a non-convex constraint is defined based on group-wise ranking functions of individual objects. We then develop an efficient model-training algorithm based on the framework of non-convex alternating direction method of multipliers (NC-ADMM), in which one of the main challenges is to implement an efficient projection oracle to the preceding non-convex set defined based on ranking functions. Through the extensive experiments on both synthetic and real-world datasets, we validated the out-performance of our new approach against several state-of-the-art competitive methods on several popular metrics relevant to fairness learning.

Keywords

Cite

@article{arxiv.2009.11405,
  title  = {Rank-Based Multi-task Learning for Fair Regression},
  author = {Chen Zhao and Feng Chen},
  journal= {arXiv preprint arXiv:2009.11405},
  year   = {2020}
}

Comments

2019 IEEE International Conference on Data Mining (ICDM)

R2 v1 2026-06-23T18:45:21.346Z