{"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/a-reductions-approach-to-fair-classification","title":"A Reductions Approach to Fair Classification","arxiv_id":"1803.02453","date":"2018-03-06","proceeding":"ICML 2018 7","authors":["Alekh Agarwal","Alina Beygelzimer","Miroslav Dudík","John Langford","Hanna Wallach"],"abstract":"We present a systematic approach for achieving fairness in a binary\nclassification setting. While we focus on two well-known quantitative\ndefinitions of fairness, our approach encompasses many other previously studied\ndefinitions as special cases. The key idea is to reduce fair classification to\na sequence of cost-sensitive classification problems, whose solutions yield a\nrandomized classifier with the lowest (empirical) error subject to the desired\nconstraints. We introduce two reductions that work for any representation of\nthe cost-sensitive classifier and compare favorably to prior baselines on a\nvariety of data sets, while overcoming several of their disadvantages.","url_abs":"http://arxiv.org/abs/1803.02453v3","url_pdf":"http://arxiv.org/pdf/1803.02453v3.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":"a-reductions-approach-to-fair-classification","repo_url":"https://github.com/fairlearn/fairlearn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-reductions-approach-to-fair-classification","repo_url":"https://github.com/jjgrimm/FairnessReferenceSheet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"a-reductions-approach-to-fair-classification","repo_url":"https://github.com/xmpuspus/parity-fairness","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"binary-classification","task_name":"Binary Classification"},{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"fairness","task_name":"Fairness"},{"task_slug":"classification","task_name":"General Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1803.02453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.02453"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+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/fairlearn/fairlearn","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/xmpuspus/parity-fairness","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/jjgrimm/FairnessReferenceSheet","reach":{"status":"ok"}}],"summary":{"unverified":8},"by_repo_kind":{"listed":{"samples":8,"ran":0,"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":"ed97275e6d1daf54","entry":"add_to_df_algo_metrics","repo":"xmpuspus/parity-fairness","repo_kind":"listed","path":"parity/fairness_metrics.py","file_url":"https://github.com/xmpuspus/parity-fairness/blob/HEAD/parity/fairness_metrics.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ed97275e6d1daf54"}},{"code_sha256_prefix":"de97511497ab797c","entry":"create_feature_columns","repo":"xmpuspus/parity-fairness","repo_kind":"listed","path":"parity/pair.py","file_url":"https://github.com/xmpuspus/parity-fairness/blob/HEAD/parity/pair.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"de97511497ab797c"}},{"code_sha256_prefix":"156e8c036d1606cd","entry":"create_feature_spec","repo":"xmpuspus/parity-fairness","repo_kind":"listed","path":"parity/pair.py","file_url":"https://github.com/xmpuspus/parity-fairness/blob/HEAD/parity/pair.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"156e8c036d1606cd"}},{"code_sha256_prefix":"19bf08db6200e0b9","entry":"decode_dataset","repo":"xmpuspus/parity-fairness","repo_kind":"listed","path":"parity/fair.py","file_url":"https://github.com/xmpuspus/parity-fairness/blob/HEAD/parity/fair.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"19bf08db6200e0b9"}},{"code_sha256_prefix":"d533a63c85cc17ee","entry":"feature_importances","repo":"xmpuspus/parity-fairness","repo_kind":"listed","path":"parity/explainer.py","file_url":"https://github.com/xmpuspus/parity-fairness/blob/HEAD/parity/explainer.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d533a63c85cc17ee"}},{"code_sha256_prefix":"905d54adb21c4343","entry":"generate_counterfactual","repo":"xmpuspus/parity-fairness","repo_kind":"listed","path":"parity/counterfactual_explainer.py","file_url":"https://github.com/xmpuspus/parity-fairness/blob/HEAD/parity/counterfactual_explainer.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"905d54adb21c4343"}},{"code_sha256_prefix":"5be8d3cc8a44d071","entry":"get_attributes","repo":"xmpuspus/parity-fairness","repo_kind":"listed","path":"parity/fair.py","file_url":"https://github.com/xmpuspus/parity-fairness/blob/HEAD/parity/fair.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5be8d3cc8a44d071"}},{"code_sha256_prefix":"b7e042a66ba85f91","entry":"get_model_performance","repo":"xmpuspus/parity-fairness","repo_kind":"listed","path":"parity/fairness_metrics.py","file_url":"https://github.com/xmpuspus/parity-fairness/blob/HEAD/parity/fairness_metrics.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b7e042a66ba85f91"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}