Subgroup Fairness, Instantaneous Fairness, and Distributional Repair #550
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Subgroup Fairness, Instantaneous Fairness, and Distributional Repair
The Subgroup Fairness and Instantaneous Fairness algorithms focus on minimizing disparities between different groups over time and across subgroups. These algorithms expand on a conventional fairness model to address scenarios where fairness might vary over different time periods or among subgroups with multiple sensitive attributes.
The Distributional Repair algorithm focuses on conditional independence. The idea is to reduce the correlation between sensitive and non-sensitive features in a dataset through use of an OT plan, increasing fairness in the dataset ahead of training.
Related Paper
For additional information, and results of model evaluation, please refer to the paper linked below, written by myself as part of my Masters Dissertation at Imperial College London
Practical_Aspects_of_Fairness_in_AI (1).pdf
References:
Abigail Langbridge, Anthony Quinn, and Robert Shorten
Quan Zhou, Jakub Marecek, and Robert N. Shorten
Closes #549