Achieving Structurally Robust Gromov Wasserstein Distance via Adaptive Dual-Mask
Kangke Cheng, Jiawei Huang, Jingni Song, Wanlin Zhang, Bangxian Han, Hu Ding
Abstract
The Gromov-Wasserstein (GW) distance enables comparison across different spaces but remains fragile to structural noise due to its global quadratic coupling. Existing robust extensions primarily rely on node-centric mass relaxation. However, we argue that this strategy is far from sufficient: it only addresses node-induced structural noise (outliers) while neglecting edge-induced distortions where spurious connections exist between valid nodes. To overcome this limitation, we propose the Structurally Robust Gromov-Wasserstein (SRGW) distance, a novel formulation that adaptively filters geometric distortions during optimization. By introducing a structure-aware dual-mask mechanism, our method effectively isolates these stubborn structural outliers while preserving strict marginal constraints for balanced transport. We solve this objective using a Mask-Guided GW Algorithm, which jointly optimizes the transport plan and the structural noise filters. We provide a rigorous theoretical analysis proving that our algorithm converges to a critical point under the Kurdyka-Łojasiewicz framework. Extensive experiments on synthetic geometric matching and real-world subgraph alignment benchmarks demonstrate that Mask-Guided GW achieves superior alignment quality, particularly under severe structural noise.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on8
- Unbalanced minibatch Optimal Transport; applications to Domain AdaptationKilian Fatras, Thibault Séjourné, Rémi Flamary, Nicolas CourtyICML 2021 · 183 citations
- The Unbalanced Gromov Wasserstein Distance: Conic Formulation and RelaxationThibault Séjourné, François-Xavier Vialard, Gabriel PeyréNeurIPS 2021 · 106 citations
- Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and CostsMeyer Scetbon, Gabriel Peyré, Marco CuturiICML 2022 · 73 citations
- Learning Graphons via Structured Gromov-Wasserstein BarycentersHongteng Xu, Dixin Luo, Lawrence Carin, Hongyuan ZhaAAAI 2021 · 42 citations
- Outlier-Robust Gromov-Wasserstein for Graph DataLemin Kong, Jiajin Li, Jianheng Tang, Anthony Man-Cho SoNeurIPS 2023 · 12 citations
Related papers
- A Novel Sliced Fused Gromov-Wasserstein DistanceMoritz Piening, Robert BeinertAAAI 2026 · 3 citations
- Convex Distance Operator Transport: A Convex and Geometry-Preserving FormulationJunhyoung Chung, Euijong Song, Won Hwa Kim, Gunwoong ParkICML 2026
- Semidefinite Relaxations of the Gromov-Wasserstein DistanceJunyu Chen, Binh T. Nguyen, Shang Koh, Yong Sheng SohNeurIPS 2024 · 18 citations
- LoBCD-GW: A Fast and Data-Dependent Algorithm for Computing Gromov-Wasserstein Distance via Localized Block Coordinate DescentJingni Song, Jiawei Huang, Kangke Cheng, Bangxian Han et al.ICML 2026
- A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph DataJiajin Li, Jianheng Tang, Lemin Kong, Huikang Liu et al.ICLR 2023
