{"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/a-confidence-based-approach-for-balancing","title":"A Confidence-Based Approach for Balancing Fairness and Accuracy","arxiv_id":"1601.05764","date":"2016-01-21","proceeding":null,"authors":["Benjamin Fish","Jeremy Kun","Ádám D. Lelkes"],"abstract":"We study three classical machine learning algorithms in the context of\nalgorithmic fairness: adaptive boosting, support vector machines, and logistic\nregression. Our goal is to maintain the high accuracy of these learning\nalgorithms while reducing the degree to which they discriminate against\nindividuals because of their membership in a protected group.\n  Our first contribution is a method for achieving fairness by shifting the\ndecision boundary for the protected group. The method is based on the theory of\nmargins for boosting. Our method performs comparably to or outperforms previous\nalgorithms in the fairness literature in terms of accuracy and low\ndiscrimination, while simultaneously allowing for a fast and transparent\nquantification of the trade-off between bias and error.\n  Our second contribution addresses the shortcomings of the bias-error\ntrade-off studied in most of the algorithmic fairness literature. We\ndemonstrate that even hopelessly naive modifications of a biased algorithm,\nwhich cannot be reasonably said to be fair, can still achieve low bias and high\naccuracy. To help to distinguish between these naive algorithms and more\nsensible algorithms we propose a new measure of fairness, called resilience to\nrandom bias (RRB). We demonstrate that RRB distinguishes well between our naive\nand sensible fairness algorithms. RRB together with bias and accuracy provides\na more complete picture of the fairness of an algorithm.","url_abs":"http://arxiv.org/abs/1601.05764v1","url_pdf":"http://arxiv.org/pdf/1601.05764v1.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":"a-confidence-based-approach-for-balancing","repo_url":"https://github.com/j2kun/fkl-SDM16","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"fairness","task_name":"Fairness"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1601.05764","atlas_url":"https://app.syntology.ai/?focus=1601.05764","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":"1601.05764"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1601.05764\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1601.05764"},"call":"get_concepts_for_paper(arxiv_id=\"1601.05764\")"}],"by_repo":[{"repo":"j2kun/fkl-SDM16","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"97d405bafd4d498bd9f15b4aa876e50aa5451ae78fec0bcbbe20639e633a3c81","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}