{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/fairness-constraints-mechanisms-for-fair","title":"Fairness Constraints: Mechanisms for Fair Classification","arxiv_id":"1507.05259","date":"2015-07-19","proceeding":null,"authors":["Muhammad Bilal Zafar","Isabel Valera","Manuel Gomez Rodriguez","Krishna P. Gummadi"],"abstract":"Algorithmic decision making systems are ubiquitous across a wide variety of\nonline as well as offline services. These systems rely on complex learning\nmethods and vast amounts of data to optimize the service functionality,\nsatisfaction of the end user and profitability. However, there is a growing\nconcern that these automated decisions can lead, even in the absence of intent,\nto a lack of fairness, i.e., their outcomes can disproportionately hurt (or,\nbenefit) particular groups of people sharing one or more sensitive attributes\n(e.g., race, sex). In this paper, we introduce a flexible mechanism to design\nfair classifiers by leveraging a novel intuitive measure of decision boundary\n(un)fairness. We instantiate this mechanism with two well-known classifiers,\nlogistic regression and support vector machines, and show on real-world data\nthat our mechanism allows for a fine-grained control on the degree of fairness,\noften at a small cost in terms of accuracy.","url_abs":"http://arxiv.org/abs/1507.05259v5","url_pdf":"http://arxiv.org/pdf/1507.05259v5.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":"fairness-constraints-mechanisms-for-fair","repo_url":"https://github.com/mbilalzafar/fair-classification","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"fairness-constraints-mechanisms-for-fair","repo_url":"https://github.com/wnstlr/FACT","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"decision-making","task_name":"Decision Making"},{"task_slug":"fairness","task_name":"Fairness"},{"task_slug":"classification","task_name":"General Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1507.05259","atlas_url":"https://app.syntology.ai/?focus=1507.05259","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1507.05259"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1507.05259\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1507.05259"},"call":"get_concepts_for_paper(arxiv_id=\"1507.05259\")"}],"by_repo":[{"repo":"mbilalzafar/fair-classification","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"wnstlr/FACT","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2004.03424"],"harvested_for_calls":[{"arxiv_id":"2004.03424","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2004.03424"},"call":"get_harvested_code_for_paper(arxiv_id=\"2004.03424\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"9eca83733cdc966fc1ff977da5e63ab8ea27f5ad30d9e0e7bd59aadd34931471","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}