Achieving Structurally Robust Gromov Wasserstein Distance via Adaptive Dual-Mask
Kangke Cheng, Jiawei Huang, Jingni Song, Wanlin Zhang, Bangxian Han, Hu Ding
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper8
- Unbalanced minibatch Optimal Transport; applications to Domain AdaptationKilian Fatras, Thibault Séjourné, Rémi Flamary, Nicolas CourtyICML 2021 · 被引用 183 次
- The Unbalanced Gromov Wasserstein Distance: Conic Formulation and RelaxationThibault Séjourné, François-Xavier Vialard, Gabriel PeyréNeurIPS 2021 · 被引用 106 次
- Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and CostsMeyer Scetbon, Gabriel Peyré, Marco CuturiICML 2022 · 被引用 73 次
- Learning Graphons via Structured Gromov-Wasserstein BarycentersHongteng Xu, Dixin Luo, Lawrence Carin, Hongyuan ZhaAAAI 2021 · 被引用 42 次
- Outlier-Robust Gromov-Wasserstein for Graph DataLemin Kong, Jiajin Li, Jianheng Tang, Anthony Man-Cho SoNeurIPS 2023 · 被引用 12 次
相关 Paper
- A Novel Sliced Fused Gromov-Wasserstein DistanceMoritz Piening, Robert BeinertAAAI 2026 · 被引用 3 次
- 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 次
- 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 等ICML 2026
- A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph DataJiajin Li, Jianheng Tang, Lemin Kong, Huikang Liu 等ICLR 2023
