{"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/two-player-games-for-efficient-non-convex","title":"Two-Player Games for Efficient Non-Convex Constrained Optimization","arxiv_id":"1804.06500","date":"2018-04-17","proceeding":null,"authors":["Andrew Cotter","Heinrich Jiang","Karthik Sridharan"],"abstract":"In recent years, constrained optimization has become increasingly relevant to\nthe machine learning community, with applications including Neyman-Pearson\nclassification, robust optimization, and fair machine learning. A natural\napproach to constrained optimization is to optimize the Lagrangian, but this is\nnot guaranteed to work in the non-convex setting, and, if using a first-order\nmethod, cannot cope with non-differentiable constraints (e.g. constraints on\nrates or proportions).\n  The Lagrangian can be interpreted as a two-player game played between a\nplayer who seeks to optimize over the model parameters, and a player who wishes\nto maximize over the Lagrange multipliers. We propose a non-zero-sum variant of\nthe Lagrangian formulation that can cope with non-differentiable--even\ndiscontinuous--constraints, which we call the \"proxy-Lagrangian\". The first\nplayer minimizes external regret in terms of easy-to-optimize \"proxy\nconstraints\", while the second player enforces the original constraints by\nminimizing swap regret.\n  For this new formulation, as for the Lagrangian in the non-convex setting,\nthe result is a stochastic classifier. For both the proxy-Lagrangian and\nLagrangian formulations, however, we prove that this classifier, instead of\nhaving unbounded size, can be taken to be a distribution over no more than m+1\nmodels (where m is the number of constraints). This is a significant\nimprovement in practical terms.","url_abs":"http://arxiv.org/abs/1804.06500v2","url_pdf":"http://arxiv.org/pdf/1804.06500v2.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":"two-player-games-for-efficient-non-convex","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":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"two","task_name":"Vocal Bursts Valence Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1804.06500","atlas_url":"https://app.syntology.ai/?focus=1804.06500","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":"1804.06500"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1804.06500\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1804.06500"},"call":"get_concepts_for_paper(arxiv_id=\"1804.06500\")"}],"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":"d499ad069f297ddca139d305da6e33fb380dc086dfd52d6978aeb280b2b592ac","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}