{"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/outlier-robust-gromov-wasserstein-for-graph-1","title":"Outlier-Robust Gromov-Wasserstein for Graph Data","arxiv_id":"2302.04610","date":"2023-02-09","proceeding":"NeurIPS 2023 11","authors":["Lemin Kong","Jiajin Li","Jianheng Tang","Anthony Man-Cho So"],"abstract":"Gromov-Wasserstein (GW) distance is a powerful tool for comparing and aligning probability distributions supported on different metric spaces. Recently, GW has become the main modeling technique for aligning heterogeneous data for a wide range of graph learning tasks. However, the GW distance is known to be highly sensitive to outliers, which can result in large inaccuracies if the outliers are given the same weight as other samples in the objective function. To mitigate this issue, we introduce a new and robust version of the GW distance called RGW. RGW features optimistically perturbed marginal constraints within a Kullback-Leibler divergence-based ambiguity set. To make the benefits of RGW more accessible in practice, we develop a computationally efficient and theoretically provable procedure using Bregman proximal alternating linearized minimization algorithm. Through extensive experimentation, we validate our theoretical results and demonstrate the effectiveness of RGW on real-world graph learning tasks, such as subgraph matching and partial shape correspondence.","url_abs":"https://arxiv.org/abs/2302.04610v2","url_pdf":"https://arxiv.org/pdf/2302.04610v2.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":"outlier-robust-gromov-wasserstein-for-graph-1","repo_url":"https://github.com/lmkong020/outlier-robust-gw","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-learning","task_name":"Graph Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2302.04610","atlas_url":"https://app.syntology.ai/?focus=2302.04610","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.04610"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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/lmkong020/outlier-robust-gw","reach":null}],"summary":{"ran_draft_wrong":1,"unverified":2},"by_repo_kind":{"official":{"samples":3,"ran":1,"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":3,"samples":[{"code_sha256_prefix":"c06d6f4c503982d4","entry":"robust_gw","repo":"lmkong020/outlier-robust-gw","repo_kind":"official","path":"subgraph/robust_gw.py","file_url":"https://github.com/lmkong020/outlier-robust-gw/blob/HEAD/subgraph/robust_gw.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"c06d6f4c503982d4"}},{"code_sha256_prefix":"7f3df5cd8bb33f80","entry":"sinkhorn_uot","repo":"lmkong020/outlier-robust-gw","repo_kind":"official","path":"subgraph/robust_gw.py","file_url":"https://github.com/lmkong020/outlier-robust-gw/blob/HEAD/subgraph/robust_gw.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"7f3df5cd8bb33f80"}},{"code_sha256_prefix":"ca17938e398689df","entry":"tensor_product","repo":"lmkong020/outlier-robust-gw","repo_kind":"official","path":"subgraph/robust_gw.py","file_url":"https://github.com/lmkong020/outlier-robust-gw/blob/HEAD/subgraph/robust_gw.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"ca17938e398689df"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}