From Utilitarian to Rawlsian Designs for Algorithmic Fairness
- URL: http://arxiv.org/abs/2302.03567v1
- Date: Tue, 7 Feb 2023 16:28:10 GMT
- Title: From Utilitarian to Rawlsian Designs for Algorithmic Fairness
- Authors: Daniel E. Rigobon
- Abstract summary: We present a class of objective functions that interpolates between two (possibly) conflicting notions of the good'
We compute optimal solutions and construct the tradeoff between utilitarian and Rawlsian notions of the good'
This work suggests that the proper degree of fairness' can be informed by a designer's preferences over the space of induced utilitarian and Rawlsian good'
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: There is a lack of consensus within the literature as to how `fairness' of
algorithmic systems can be measured, and different metrics can often be at
odds. In this paper, we approach this task by drawing on the ethical frameworks
of utilitarianism and John Rawls. Informally, these two theories of
distributive justice measure the `good' as either a population's sum of
utility, or worst-off outcomes, respectively. We present a parameterized class
of objective functions that interpolates between these two (possibly)
conflicting notions of the `good'. This class is shown to represent a
relaxation of the Rawlsian `veil of ignorance', and its sequence of optimal
solutions converges to both a utilitarian and Rawlsian optimum. Several other
properties of this class are studied, including: 1) a relationship to
regularized optimization, 2) feasibility of consistent estimation, and 3)
algorithmic cost. In several real-world datasets, we compute optimal solutions
and construct the tradeoff between utilitarian and Rawlsian notions of the
`good'. Empirically, we demonstrate that increasing model complexity can
manifest strict improvements to both measures of the `good'. This work suggests
that the proper degree of `fairness' can be informed by a designer's
preferences over the space of induced utilitarian and Rawlsian `good'.
Related papers
- Efficient Fairness-Performance Pareto Front Computation [51.558848491038916]
We show that optimal fair representations possess several useful structural properties.
We then show that these approxing problems can be solved efficiently via concave programming methods.
arXiv Detail & Related papers (2024-09-26T08:46:48Z) - Towards Efficient Pareto-optimal Utility-Fairness between Groups in
Repeated Rankings [7.6275971668447005]
We tackle the problem of computing a sequence of rankings with the guarantee of the Pareto-optimal balance between consumers and producers of items.
We introduce a novel approach to the above problem by using the Expohedron - a permutahedron whose points represent all exposures of items.
We further propose an efficient method by relaxing our optimization problem on the Expohedron's circumscribed $n$-sphere, which significantly improve the running time.
arXiv Detail & Related papers (2024-02-22T05:48:54Z) - Best Arm Identification in Stochastic Bandits: Beyond $\beta-$optimality [31.359578768463752]
This paper investigates a hitherto unaddressed aspect of best arm identification (BAI) in multi-armed bandits in the fixed-confidence setting.
Two key metrics for assessing bandit algorithms are computational efficiency and performance optimality.
This paper introduces a framework and an algorithm for BAI that achieves optimal performance with a computationally efficient set of decision rules.
arXiv Detail & Related papers (2023-01-10T05:02:49Z) - Rawlsian Fair Adaptation of Deep Learning Classifiers [18.150327860396786]
Group-fairness in classification aims for equality of a predictive utility across different sensitive sub-populations, e.g., race or gender.
This paper shows that a Rawls classifier minimizes the error rate on the worst-off sensitive sub-population.
Our empirical results show significant improvement over state-of-the-art group-fair algorithms, even without retraining for fairness.
arXiv Detail & Related papers (2021-05-31T11:31:30Z) - Scalable Personalised Item Ranking through Parametric Density Estimation [53.44830012414444]
Learning from implicit feedback is challenging because of the difficult nature of the one-class problem.
Most conventional methods use a pairwise ranking approach and negative samplers to cope with the one-class problem.
We propose a learning-to-rank approach, which achieves convergence speed comparable to the pointwise counterpart.
arXiv Detail & Related papers (2021-05-11T03:38:16Z) - Preference learning along multiple criteria: A game-theoretic
perspective [97.94912276610002]
We generalize the notion of a von Neumann winner to the multi-criteria setting by taking inspiration from Blackwell's approachability.
Our framework allows for non-linear aggregation of preferences across criteria, and generalizes the linearization-based approach from multi-objective optimization.
We show that the Blackwell winner of a multi-criteria problem instance can be computed as the solution to a convex optimization problem.
arXiv Detail & Related papers (2021-05-05T03:23:11Z) - Stochastic Optimization Forests [60.523606291705214]
We show how to train forest decision policies by growing trees that choose splits to directly optimize the downstream decision quality, rather than splitting to improve prediction accuracy as in the standard random forest algorithm.
We show that our approximate splitting criteria can reduce running time hundredfold, while achieving performance close to forest algorithms that exactly re-optimize for every candidate split.
arXiv Detail & Related papers (2020-08-17T16:56:06Z) - Towards Model-Agnostic Post-Hoc Adjustment for Balancing Ranking
Fairness and Algorithm Utility [54.179859639868646]
Bipartite ranking aims to learn a scoring function that ranks positive individuals higher than negative ones from labeled data.
There have been rising concerns on whether the learned scoring function can cause systematic disparity across different protected groups.
We propose a model post-processing framework for balancing them in the bipartite ranking scenario.
arXiv Detail & Related papers (2020-06-15T10:08:39Z) - Fair Classification via Unconstrained Optimization [0.0]
We show that the Bayes optimal fair learning rule remains a group-wise thresholding rule over the Bayes regressor.
The proposed algorithm can be applied to any black-box machine learning model.
arXiv Detail & Related papers (2020-05-21T11:29:05Z) - Ranking a set of objects: a graph based least-square approach [70.7866286425868]
We consider the problem of ranking $N$ objects starting from a set of noisy pairwise comparisons provided by a crowd of equal workers.
We propose a class of non-adaptive ranking algorithms that rely on a least-squares intrinsic optimization criterion for the estimation of qualities.
arXiv Detail & Related papers (2020-02-26T16:19:09Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.