ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2205.08115
  4. Cited By
Fast and Provably Convergent Algorithms for Gromov-Wasserstein in Graph
  Data

Fast and Provably Convergent Algorithms for Gromov-Wasserstein in Graph Data

17 May 2022
Jiajin Li
Jianheng Tang
Lemin Kong
Huikang Liu
Jia Li
Anthony Man-Cho So
Jose H. Blanchet
ArXivPDFHTML

Papers citing "Fast and Provably Convergent Algorithms for Gromov-Wasserstein in Graph Data"

4 / 4 papers shown
Title
Semi-relaxed Gromov-Wasserstein divergence with applications on graphs
Semi-relaxed Gromov-Wasserstein divergence with applications on graphs
Cédric Vincent-Cuaz
Rémi Flamary
Marco Corneli
Titouan Vayer
Nicolas Courty
OT
33
23
0
06 Oct 2021
Online Graph Dictionary Learning
Online Graph Dictionary Learning
Cédric Vincent-Cuaz
Titouan Vayer
Rémi Flamary
Marco Corneli
Nicolas Courty
26
44
0
12 Feb 2021
Learning Graphons via Structured Gromov-Wasserstein Barycenters
Learning Graphons via Structured Gromov-Wasserstein Barycenters
Hongteng Xu
Dixin Luo
Lawrence Carin
H. Zha
41
28
0
10 Dec 2020
Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its
  applications to linear convergence of first-order methods
Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
Guoyin Li
Ting Kei Pong
95
288
0
09 Feb 2016
1