{"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/wasserstein-fair-classification","title":"Wasserstein Fair Classification","arxiv_id":"1907.12059","date":"2019-07-28","proceeding":null,"authors":["Ray Jiang","Aldo Pacchiano","Tom Stepleton","Heinrich Jiang","Silvia Chiappa"],"abstract":"We propose an approach to fair classification that enforces independence between the classifier outputs and sensitive information by minimizing Wasserstein-1 distances. The approach has desirable theoretical properties and is robust to specific choices of the threshold used to obtain class predictions from model outputs. We introduce different methods that enable hiding sensitive information at test time or have a simple and fast implementation. We show empirical performance against different fairness baselines on several benchmark fairness datasets.","url_abs":"https://arxiv.org/abs/1907.12059v1","url_pdf":"https://arxiv.org/pdf/1907.12059v1.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":"wasserstein-fair-classification","repo_url":"https://github.com/deepmind/wasserstein_fairness","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"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=1907.12059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.12059"}},"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/deepmind/wasserstein_fairness","reach":{"status":"ok","spdx":"Apache-2.0"}}],"summary":{"unverified":5},"by_repo_kind":{"official":{"samples":5,"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":"993e7548a1badb59","entry":"regression_loss","repo":"deepmind/wasserstein_fairness","repo_kind":"official","path":"wasserstein_fairness/basic_costs.py","file_url":"https://github.com/deepmind/wasserstein_fairness/blob/HEAD/wasserstein_fairness/basic_costs.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"993e7548a1badb59"}},{"code_sha256_prefix":"cf9a91119901cf28","entry":"regression_loss_gradient","repo":"deepmind/wasserstein_fairness","repo_kind":"official","path":"wasserstein_fairness/basic_costs.py","file_url":"https://github.com/deepmind/wasserstein_fairness/blob/HEAD/wasserstein_fairness/basic_costs.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"cf9a91119901cf28"}},{"code_sha256_prefix":"b2dcbd9e94bf9ac8","entry":"sinkhorn","repo":"deepmind/wasserstein_fairness","repo_kind":"official","path":"wasserstein_fairness/optimal_transport.py","file_url":"https://github.com/deepmind/wasserstein_fairness/blob/HEAD/wasserstein_fairness/optimal_transport.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"b2dcbd9e94bf9ac8"}},{"code_sha256_prefix":"b50d587c566d6ce9","entry":"wasserstein_coupling_on_the_real_line","repo":"deepmind/wasserstein_fairness","repo_kind":"official","path":"wasserstein_fairness/optimal_transport.py","file_url":"https://github.com/deepmind/wasserstein_fairness/blob/HEAD/wasserstein_fairness/optimal_transport.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"b50d587c566d6ce9"}},{"code_sha256_prefix":"1d316e869807fdff","entry":"wasserstein_two_loss_gradient","repo":"deepmind/wasserstein_fairness","repo_kind":"official","path":"wasserstein_fairness/basic_costs.py","file_url":"https://github.com/deepmind/wasserstein_fairness/blob/HEAD/wasserstein_fairness/basic_costs.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"1d316e869807fdff"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}