{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/the-multimarginal-optimal-transport","title":"The Multimarginal Optimal Transport Formulation of Adversarial Multiclass Classification","arxiv_id":"2204.12676","date":"2022-04-27","proceeding":null,"authors":["Nicolas Garcia Trillos","Matt Jacobs","Jakwang Kim"],"abstract":"We study a family of adversarial multiclass classification problems and provide equivalent reformulations in terms of: 1) a family of generalized barycenter problems introduced in the paper and 2) a family of multimarginal optimal transport problems where the number of marginals is equal to the number of classes in the original classification problem. These new theoretical results reveal a rich geometric structure of adversarial learning problems in multiclass classification and extend recent results restricted to the binary classification setting. A direct computational implication of our results is that by solving either the barycenter problem and its dual, or the MOT problem and its dual, we can recover the optimal robust classification rule and the optimal adversarial strategy for the original adversarial problem. Examples with synthetic and real data illustrate our results.","url_abs":"https://arxiv.org/abs/2204.12676v3","url_pdf":"https://arxiv.org/pdf/2204.12676v3.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":"the-multimarginal-optimal-transport","repo_url":"https://github.com/mattwerenski/adversarial-ot","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"binary-classification","task_name":"Binary Classification"},{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"robust-classification","task_name":"Robust classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2204.12676","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.12676"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mattwerenski/adversarial-ot","reach":null}],"summary":{"ran_honours":2,"ran_draft_wrong":1,"ran_violates":1},"by_repo_kind":{"listed":{"samples":4,"ran":4,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":4,"samples":[{"code_sha256_prefix":"c6f88cbb20105019","entry":"KL_divergence","repo":"mattwerenski/adversarial-ot","repo_kind":"listed","path":"entropic.py","file_url":"https://github.com/mattwerenski/adversarial-ot/blob/HEAD/entropic.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"c6f88cbb20105019"}},{"code_sha256_prefix":"2a4b4383a6d43127","entry":"extract_groupings","repo":"mattwerenski/adversarial-ot","repo_kind":"listed","path":"indicator_solver.py","file_url":"https://github.com/mattwerenski/adversarial-ot/blob/HEAD/indicator_solver.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"2a4b4383a6d43127"}},{"code_sha256_prefix":"885665693dbdec1b","entry":"greedy_coordinate","repo":"mattwerenski/adversarial-ot","repo_kind":"listed","path":"entropic.py","file_url":"https://github.com/mattwerenski/adversarial-ot/blob/HEAD/entropic.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"885665693dbdec1b"}},{"code_sha256_prefix":"99c542b42097f07f","entry":"margin_distance","repo":"mattwerenski/adversarial-ot","repo_kind":"listed","path":"entropic.py","file_url":"https://github.com/mattwerenski/adversarial-ot/blob/HEAD/entropic.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"99c542b42097f07f"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}