A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data

12 March 2023

Papers citing "A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data"

10 / 10 papers shown

Title
A Fused Gromov-Wasserstein Approach to Subgraph Contrastive Learning Amadou S. Sangare Nicolas Dunou Jhony H. Giraldo Fragkiskos D. Malliaros SSL 64 0 0 28 Feb 2025
Spurious Stationarity and Hardness Results for Mirror Descent He Chen Jiajin Li Anthony Man-Cho So 42 0 0 11 Apr 2024
Covariance alignment: from maximum likelihood estimation to Gromov-Wasserstein Yanjun Han Philippe Rigollet George Stepaniants OT 28 1 0 22 Nov 2023
Fused Gromov-Wasserstein Graph Mixup for Graph-level Classifications Xinyu Ma Xu Chu Yasha Wang Yang Lin Junfeng Zhao Liantao Ma Wenwu Zhu 27 6 0 28 Jun 2023
Unbalanced Low-rank Optimal Transport Solvers M. Scetbon Michal Klein Giovanni Palla Marco Cuturi OT 42 4 0 31 May 2023
Outlier-Robust Gromov-Wasserstein for Graph Data Lemin Kong Jiajin Li Jianheng Tang Anthony Man-Cho So 21 4 0 09 Feb 2023
Regularized Optimal Transport Layers for Generalized Global Pooling Operations Hongteng Xu Minjie Cheng 36 4 0 13 Dec 2022
Semi-relaxed Gromov-Wasserstein divergence with applications on graphs Cédric Vincent-Cuaz Rémi Flamary Marco Corneli Titouan Vayer Nicolas Courty OT 35 23 0 06 Oct 2021
Online Graph Dictionary Learning Cédric Vincent-Cuaz Titouan Vayer Rémi Flamary Marco Corneli Nicolas Courty 28 44 0 12 Feb 2021
Learning Graphons via Structured Gromov-Wasserstein Barycenters Hongteng Xu Dixin Luo Lawrence Carin H. Zha 46 28 0 10 Dec 2020