{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/fair-enough-searching-for-sufficient-measures","title":"Fair Enough: Searching for Sufficient Measures of Fairness","arxiv_id":"2110.13029","date":"2021-10-25","proceeding":null,"authors":["Suvodeep Majumder","Joymallya Chakraborty","Gina R. Bai","Kathryn T. Stolee","Tim Menzies"],"abstract":"Testing machine learning software for ethical bias has become a pressing current concern. In response, recent research has proposed a plethora of new fairness metrics, for example, the dozens of fairness metrics in the IBM AIF360 toolkit. This raises the question: How can any fairness tool satisfy such a diverse range of goals? While we cannot completely simplify the task of fairness testing, we can certainly reduce the problem. This paper shows that many of those fairness metrics effectively measure the same thing. Based on experiments using seven real-world datasets, we find that (a) 26 classification metrics can be clustered into seven groups, and (b) four dataset metrics can be clustered into three groups. Further, each reduced set may actually predict different things. Hence, it is no longer necessary (or even possible) to satisfy all fairness metrics. In summary, to simplify the fairness testing problem, we recommend the following steps: (1)~determine what type of fairness is desirable (and we offer a handful of such types); then (2) lookup those types in our clusters; then (3) just test for one item per cluster.","url_abs":"https://arxiv.org/abs/2110.13029v2","url_pdf":"https://arxiv.org/pdf/2110.13029v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"fair-enough-searching-for-sufficient-measures","repo_url":"https://github.com/repoanonymous/fairness_metrics","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"fairness","task_name":"Fairness"}],"methods":[{"method_slug":"test","method_name":"Test"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2110.13029","atlas_url":"https://app.syntology.ai/?focus=2110.13029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13029"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/repoanonymous/fairness_metrics","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":4},"by_repo_kind":{"official":{"samples":4,"ran":4,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"2a43f64d93bc3450","entry":"get_sensitivity","repo":"repoanonymous/fairness_metrics","repo_kind":"official","path":"src/get_sensitivity.py","file_url":"https://github.com/repoanonymous/fairness_metrics/blob/HEAD/src/get_sensitivity.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"2a43f64d93bc3450"}},{"code_sha256_prefix":"837fc5ce6d819a74","entry":"load_data","repo":"repoanonymous/fairness_metrics","repo_kind":"official","path":"src/get_fairness.py","file_url":"https://github.com/repoanonymous/fairness_metrics/blob/HEAD/src/get_fairness.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"837fc5ce6d819a74"}},{"code_sha256_prefix":"9474be3e4b3fe7e5","entry":"load_data","repo":"repoanonymous/fairness_metrics","repo_kind":"official","path":"src/measure_fairness_change.py","file_url":"https://github.com/repoanonymous/fairness_metrics/blob/HEAD/src/measure_fairness_change.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9474be3e4b3fe7e5"}},{"code_sha256_prefix":"e0a6b2101acf20c8","entry":"load_data","repo":"repoanonymous/fairness_metrics","repo_kind":"official","path":"src/create_clusters.py","file_url":"https://github.com/repoanonymous/fairness_metrics/blob/HEAD/src/create_clusters.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e0a6b2101acf20c8"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}