{"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/fare-provably-fair-representation-learning","title":"FARE: Provably Fair Representation Learning with Practical Certificates","arxiv_id":"2210.07213","date":"2022-10-13","proceeding":null,"authors":["Nikola Jovanović","Mislav Balunović","Dimitar I. Dimitrov","Martin Vechev"],"abstract":"Fair representation learning (FRL) is a popular class of methods aiming to produce fair classifiers via data preprocessing. Recent regulatory directives stress the need for FRL methods that provide practical certificates, i.e., provable upper bounds on the unfairness of any downstream classifier trained on preprocessed data, which directly provides assurance in a practical scenario. Creating such FRL methods is an important challenge that remains unsolved. In this work, we address that challenge and introduce FARE (Fairness with Restricted Encoders), the first FRL method with practical fairness certificates. FARE is based on our key insight that restricting the representation space of the encoder enables the derivation of practical guarantees, while still permitting favorable accuracy-fairness tradeoffs for suitable instantiations, such as one we propose based on fair trees. To produce a practical certificate, we develop and apply a statistical procedure that computes a finite sample high-confidence upper bound on the unfairness of any downstream classifier trained on FARE embeddings. In our comprehensive experimental evaluation, we demonstrate that FARE produces practical certificates that are tight and often even comparable with purely empirical results obtained by prior methods, which establishes the practical value of our approach.","url_abs":"https://arxiv.org/abs/2210.07213v2","url_pdf":"https://arxiv.org/pdf/2210.07213v2.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":"fare-provably-fair-representation-learning","repo_url":"https://github.com/eth-sri/fare","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"fairness","task_name":"Fairness"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2210.07213","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07213"}},"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":"deterministic:regex_extraction","url":"https://github.com/eth-sri/fare","reach":null}],"summary":{"ran_honours":1,"ran_fixture":1,"unverified":2},"by_repo_kind":{"official":{"samples":4,"ran":2,"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":4,"samples":[{"code_sha256_prefix":"ab6a955c7b0d0edf","entry":"get_dataframe_from_results","repo":"eth-sri/fare","repo_kind":"official","path":"code/src/scripts/plot.py","file_url":"https://github.com/eth-sri/fare/blob/HEAD/code/src/scripts/plot.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"ab6a955c7b0d0edf"}},{"code_sha256_prefix":"5e2774c0bcd2e2bb","entry":"get_pareto","repo":"eth-sri/fare","repo_kind":"official","path":"code/src/scripts/plot.py","file_url":"https://github.com/eth-sri/fare/blob/HEAD/code/src/scripts/plot.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"5e2774c0bcd2e2bb"}},{"code_sha256_prefix":"869be55516b24bed","entry":"figure_ablation","repo":"eth-sri/fare","repo_kind":"official","path":"code/src/scripts/plot.py","file_url":"https://github.com/eth-sri/fare/blob/HEAD/code/src/scripts/plot.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"869be55516b24bed"}},{"code_sha256_prefix":"9bcda1d9e790d6fb","entry":"run_sklearn_model","repo":"eth-sri/fare","repo_kind":"official","path":"code/src/scripts/eval_embeddings.py","file_url":"https://github.com/eth-sri/fare/blob/HEAD/code/src/scripts/eval_embeddings.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"9bcda1d9e790d6fb"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}