{"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/training-well-generalizing-classifiers-for","title":"Training Well-Generalizing Classifiers for Fairness Metrics and Other Data-Dependent Constraints","arxiv_id":"1807.00028","date":"2018-06-29","proceeding":null,"authors":["Andrew Cotter","Maya Gupta","Heinrich Jiang","Nathan Srebro","Karthik Sridharan","Serena Wang","Blake Woodworth","Seungil You"],"abstract":"Classifiers can be trained with data-dependent constraints to satisfy\nfairness goals, reduce churn, achieve a targeted false positive rate, or other\npolicy goals. We study the generalization performance for such constrained\noptimization problems, in terms of how well the constraints are satisfied at\nevaluation time, given that they are satisfied at training time. To improve\ngeneralization performance, we frame the problem as a two-player game where one\nplayer optimizes the model parameters on a training dataset, and the other\nplayer enforces the constraints on an independent validation dataset. We build\non recent work in two-player constrained optimization to show that if one uses\nthis two-dataset approach, then constraint generalization can be significantly\nimproved. As we illustrate experimentally, this approach works not only in\ntheory, but also in practice.","url_abs":"http://arxiv.org/abs/1807.00028v2","url_pdf":"http://arxiv.org/pdf/1807.00028v2.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":"training-well-generalizing-classifiers-for","repo_url":"https://github.com/google-research/tensorflow_constrained_optimization","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"fairness","task_name":"Fairness"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1807.00028","atlas_url":"https://app.syntology.ai/?focus=1807.00028","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":"1807.00028"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1807.00028\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1807.00028"},"call":"get_concepts_for_paper(arxiv_id=\"1807.00028\")"}],"by_repo":[{"repo":"google-research/tensorflow_constrained_optimization","kind":"listed","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":"6f596de9343ca7e6a75339a04153c5048982e9cd9250ce5dfb7b4f0ff58b0bd1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}