Open AccessPosted Content
Algorithmic Fairness
Dana Pessach,Erez Shmueli +1 more
TL;DR: An overview of the main concepts of identifying, measuring and improving algorithmic fairness when using AI algorithms is presented and the most commonly used fairness-related datasets in this field are described.
read more
Abstract: An increasing number of decisions regarding the daily lives of human beings are being controlled by artificial intelligence (AI) algorithms in spheres ranging from healthcare, transportation, and education to college admissions, recruitment, provision of loans and many more realms. Since they now touch on many aspects of our lives, it is crucial to develop AI algorithms that are not only accurate but also objective and fair. Recent studies have shown that algorithmic decision-making may be inherently prone to unfairness, even when there is no intention for it. This paper presents an overview of the main concepts of identifying, measuring and improving algorithmic fairness when using AI algorithms. The paper begins by discussing the causes of algorithmic bias and unfairness and the common definitions and measures for fairness. Fairness-enhancing mechanisms are then reviewed and divided into pre-process, in-process and post-process mechanisms. A comprehensive comparison of the mechanisms is then conducted, towards a better understanding of which mechanisms should be used in different scenarios. The paper then describes the most commonly used fairness-related datasets in this field. Finally, the paper ends by reviewing several emerging research sub-fields of algorithmic fairness.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
Table 1. Measures and Definitions for Algorithmic Fairness 
Table 4. Additional Measures and Definitions for Algorithmic Fairness 
Fig. 1. If the SAT scores were used for hiring, then unprivileged candidates with high potential would be excluded, whereas lower potential candidates from the privileged group would be hired instead 
Table 3. Common Benchmark Datasets for Algorithmic Fairness 
Table 2. Pre-Process, In-Process and Post-Process Mechanisms for Algorithmic Fairness
Citations
Journal Article
The Fairness Field Guide: Perspectives from Social and Formal Sciences
Alycia N. Carey,Xintao Wu +1 more
TL;DR: It is hoped that this field guide will help fair machine learning practitioners better understand how their algorithms align with important humanistic values and how they can, as a field, design methods and metrics to better serve oppressed and marginalized populaces.
4
Impossibility of Collective Intelligence
TL;DR: The impossibility result reveals informational incomparability between environments as one of the foremost obstacles for researchers who design novel algorithms that learn from multiple environments, which sheds light on prerequisites for success in critical areas of machine learning.
•Posted Content
Hypergraph Clustering for Finding Diverse and Experienced Groups
TL;DR: Although the objective function is NP-hard to optimize, the model is based on a regularized version of an edge-based hypergraph clustering objective, and it is shown how naive objectives actually have no diversity-experience tradeoff.
4
•Posted Content
Compounding Injustice: History and Prediction in Carceral Decision-Making
TL;DR: This thesis explores how algorithmic decision-making in criminal policy can exhibit feedback effects, where disadvantage accumulates among those deemed 'high risk' by the state, and explores the theoretical implications of compounding effects in repeated carceral decisions.
3
The Complexity of Finding Fair Many-to-One Matchings
Niclas Boehmer,Tomohiro Koana +1 more
- 14 Jun 2022
TL;DR: It is shown that a fair many-to-one matching is NP-hard even for three colors and maximum degree of each side, and a new separation result on (super)modular functions is proved, inspired by Frank's separation theorem.
References
ImageNet: A large-scale hierarchical image database
Jia Deng,Wei Dong,Richard Socher,Li-Jia Li,Kai Li,Li Fei-Fei +5 more
- 20 Jun 2009
TL;DR: A new database called “ImageNet” is introduced, a large-scale ontology of images built upon the backbone of the WordNet structure, much larger in scale and diversity and much more accurate than the current image datasets.
Generative Adversarial Nets
Ian Goodfellow,Jean Pouget-Abadie,Mehdi Mirza,Bing Xu,David Warde-Farley,Sherjil Ozair,Aaron Courville,Yoshua Bengio +7 more
- 08 Dec 2014
TL;DR: A new framework for estimating generative models via an adversarial process, in which two models are simultaneously train: a generative model G that captures the data distribution and a discriminative model D that estimates the probability that a sample came from the training data rather than G.
Glove: Global Vectors for Word Representation
Jeffrey Pennington,Richard Socher,Christopher D. Manning +2 more
- 01 Oct 2014
TL;DR: A new global logbilinear regression model that combines the advantages of the two major model families in the literature: global matrix factorization and local context window methods and produces a vector space with meaningful substructure.
A Survey on Transfer Learning
Sinno Jialin Pan,Qiang Yang +1 more
TL;DR: The relationship between transfer learning and other related machine learning techniques such as domain adaptation, multitask learning and sample selection bias, as well as covariate shift are discussed.
A kernel two-sample test
TL;DR: This work proposes a framework for analyzing and comparing distributions, which is used to construct statistical tests to determine if two samples are drawn from different distributions, and presents two distribution free tests based on large deviation bounds for the maximum mean discrepancy (MMD).