{"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-without-demographics-in-repeated","title":"Fairness Without Demographics in Repeated Loss Minimization","arxiv_id":"1806.08010","date":"2018-06-20","proceeding":"ICML 2018 7","authors":["Tatsunori B. Hashimoto","Megha Srivastava","Hongseok Namkoong","Percy Liang"],"abstract":"Machine learning models (e.g., speech recognizers) are usually trained to\nminimize average loss, which results in representation disparity---minority\ngroups (e.g., non-native speakers) contribute less to the training objective\nand thus tend to suffer higher loss. Worse, as model accuracy affects user\nretention, a minority group can shrink over time. In this paper, we first show\nthat the status quo of empirical risk minimization (ERM) amplifies\nrepresentation disparity over time, which can even make initially fair models\nunfair. To mitigate this, we develop an approach based on distributionally\nrobust optimization (DRO), which minimizes the worst case risk over all\ndistributions close to the empirical distribution. We prove that this approach\ncontrols the risk of the minority group at each time step, in the spirit of\nRawlsian distributive justice, while remaining oblivious to the identity of the\ngroups. We demonstrate that DRO prevents disparity amplification on examples\nwhere ERM fails, and show improvements in minority group user satisfaction in a\nreal-world text autocomplete task.","url_abs":"http://arxiv.org/abs/1806.08010v2","url_pdf":"http://arxiv.org/pdf/1806.08010v2.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-without-demographics-in-repeated","repo_url":"https://worksheets.codalab.org/worksheets/0x17a501d37bbe49279b0c70ae10813f4c","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"fairness","task_name":"Fairness"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1806.08010","atlas_url":"https://app.syntology.ai/?focus=1806.08010","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":"1806.08010"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1806.08010\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1806.08010"},"call":"get_concepts_for_paper(arxiv_id=\"1806.08010\")"}],"by_repo":[{"repo":"worksheets.codalab.org/worksheets/0x17a501d37bbe49279b0c70ae10813f4c","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":"909ded318c859d04dc1d01b5057b1b1d0991924464cc6ae9ec3c55fed43fc5f7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}