Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem

In this paper, we study the problem of fair sparse regression on a biased dataset where bias depends upon a hidden binary attribute. The presence of a hidden attribute adds an extra layer of complexity to the problem by combining sparse regression and clustering with unknown binary labels. The corresponding optimization problem is combinatorial, but we propose a novel relaxation of it as an invex optimization problem. To the best of our knowledge, this is the first invex relaxation for a combinatorial problem. We show that the inclusion of the debi-asing/fairness constraint in our model has no adverse effect on the performance. Rather, it enables the recovery of the hidden attribute.