{"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/equal-improvability-a-new-fairness-notion","title":"Equal Improvability: A New Fairness Notion Considering the Long-term Impact","arxiv_id":"2210.06732","date":"2022-10-13","proceeding":null,"authors":["Ozgur Guldogan","Yuchen Zeng","Jy-yong Sohn","Ramtin Pedarsani","Kangwook Lee"],"abstract":"Devising a fair classifier that does not discriminate against different groups is an important problem in machine learning. Although researchers have proposed various ways of defining group fairness, most of them only focused on the immediate fairness, ignoring the long-term impact of a fair classifier under the dynamic scenario where each individual can improve its feature over time. Such dynamic scenarios happen in real world, e.g., college admission and credit loaning, where each rejected sample makes effort to change its features to get accepted afterwards. In this dynamic setting, the long-term fairness should equalize the samples' feature distribution across different groups after the rejected samples make some effort to improve. In order to promote long-term fairness, we propose a new fairness notion called Equal Improvability (EI), which equalizes the potential acceptance rate of the rejected samples across different groups assuming a bounded level of effort will be spent by each rejected sample. We analyze the properties of EI and its connections with existing fairness notions. To find a classifier that satisfies the EI requirement, we propose and study three different approaches that solve EI-regularized optimization problems. Through experiments on both synthetic and real datasets, we demonstrate that the proposed EI-regularized algorithms encourage us to find a fair classifier in terms of EI. Finally, we provide experimental results on dynamic scenarios which highlight the advantages of our EI metric in achieving the long-term fairness. Codes are available in a GitHub repository, see https://github.com/guldoganozgur/ei_fairness.","url_abs":"https://arxiv.org/abs/2210.06732v2","url_pdf":"https://arxiv.org/pdf/2210.06732v2.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":"equal-improvability-a-new-fairness-notion","repo_url":"https://github.com/guldoganozgur/ei_fairness","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"fairness","task_name":"Fairness"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2210.06732","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06732"}},"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/guldoganozgur/ei_fairness","reach":null}],"summary":{"ran_draft_wrong":3,"ran_honours":2},"by_repo_kind":{"official":{"samples":5,"ran":5,"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":"29b9e9d154d2879d","entry":"arrays_to_tensor","repo":"guldoganozgur/ei_fairness","repo_kind":"official","path":"utils/dataloaders.py","file_url":"https://github.com/guldoganozgur/ei_fairness/blob/HEAD/utils/dataloaders.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"29b9e9d154d2879d"}},{"code_sha256_prefix":"c5b7a76d24013b2e","entry":"CDF_tau","repo":"guldoganozgur/ei_fairness","repo_kind":"official","path":"algorithms/algorithms.py","file_url":"https://github.com/guldoganozgur/ei_fairness/blob/HEAD/algorithms/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c5b7a76d24013b2e"}},{"code_sha256_prefix":"f62d80f77196bcfe","entry":"Huber","repo":"guldoganozgur/ei_fairness","repo_kind":"official","path":"algorithms/algorithms.py","file_url":"https://github.com/guldoganozgur/ei_fairness/blob/HEAD/algorithms/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f62d80f77196bcfe"}},{"code_sha256_prefix":"6f9d077398f10e19","entry":"Optimal_effort","repo":"guldoganozgur/ei_fairness","repo_kind":"official","path":"utils/effort.py","file_url":"https://github.com/guldoganozgur/ei_fairness/blob/HEAD/utils/effort.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6f9d077398f10e19"}},{"code_sha256_prefix":"7b9f28a406b14979","entry":"grad_Huber","repo":"guldoganozgur/ei_fairness","repo_kind":"official","path":"algorithms/algorithms.py","file_url":"https://github.com/guldoganozgur/ei_fairness/blob/HEAD/algorithms/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"7b9f28a406b14979"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}