{"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/minimax-auc-fairness-efficient-algorithm-with","title":"Minimax AUC Fairness: Efficient Algorithm with Provable Convergence","arxiv_id":"2208.10451","date":"2022-08-22","proceeding":null,"authors":["Zhenhuan Yang","Yan Lok Ko","Kush R. Varshney","Yiming Ying"],"abstract":"The use of machine learning models in consequential decision making often exacerbates societal inequity, in particular yielding disparate impact on members of marginalized groups defined by race and gender. The area under the ROC curve (AUC) is widely used to evaluate the performance of a scoring function in machine learning, but is studied in algorithmic fairness less than other performance metrics. Due to the pairwise nature of the AUC, defining an AUC-based group fairness metric is pairwise-dependent and may involve both \\emph{intra-group} and \\emph{inter-group} AUCs. Importantly, considering only one category of AUCs is not sufficient to mitigate unfairness in AUC optimization. In this paper, we propose a minimax learning and bias mitigation framework that incorporates both intra-group and inter-group AUCs while maintaining utility. Based on this Rawlsian framework, we design an efficient stochastic optimization algorithm and prove its convergence to the minimum group-level AUC. We conduct numerical experiments on both synthetic and real-world datasets to validate the effectiveness of the minimax framework and the proposed optimization algorithm.","url_abs":"https://arxiv.org/abs/2208.10451v2","url_pdf":"https://arxiv.org/pdf/2208.10451v2.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":"minimax-auc-fairness-efficient-algorithm-with","repo_url":"https://github.com/zhenhuan-yang/minimaxfairauc","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"minimax-auc-fairness-efficient-algorithm-with","repo_url":"https://github.com/purdue-m2/auc_fairness_with_noisy_groups","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"decision-making","task_name":"Decision Making"},{"task_slug":"fairness","task_name":"Fairness"},{"task_slug":"stochastic-optimization","task_name":"Stochastic Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2208.10451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.10451"}},"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/zhenhuan-yang/minimaxfairauc","reach":{"status":"ok","spdx":"GPL-3.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/purdue-m2/auc_fairness_with_noisy_groups","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":1,"unverified":3},"by_repo_kind":{"listed":{"samples":4,"ran":1,"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":"396256bd807f90dc","entry":"sigmoid","repo":"purdue-m2/auc_fairness_with_noisy_groups","repo_kind":"listed","path":"training/fairness_metrics.py","file_url":"https://github.com/purdue-m2/auc_fairness_with_noisy_groups/blob/HEAD/training/fairness_metrics.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"396256bd807f90dc"}},{"code_sha256_prefix":"c282b24a376e69ea","entry":"acc_fairness_dro","repo":"purdue-m2/auc_fairness_with_noisy_groups","repo_kind":"listed","path":"training/fairness_metrics.py","file_url":"https://github.com/purdue-m2/auc_fairness_with_noisy_groups/blob/HEAD/training/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":"c282b24a376e69ea"}},{"code_sha256_prefix":"09ce3125196e8c16","entry":"classification_metrics","repo":"purdue-m2/auc_fairness_with_noisy_groups","repo_kind":"listed","path":"training/fairness_metrics.py","file_url":"https://github.com/purdue-m2/auc_fairness_with_noisy_groups/blob/HEAD/training/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":"09ce3125196e8c16"}},{"code_sha256_prefix":"42d9df0e45ef68c3","entry":"compute_phats","repo":"purdue-m2/auc_fairness_with_noisy_groups","repo_kind":"listed","path":"training/data.py","file_url":"https://github.com/purdue-m2/auc_fairness_with_noisy_groups/blob/HEAD/training/data.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":"42d9df0e45ef68c3"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}