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. 1910.04308
  4. Cited By
Gromov-Wasserstein Averaging in a Riemannian Framework
v1v2 (latest)

Gromov-Wasserstein Averaging in a Riemannian Framework

10 October 2019
Samir Chowdhury
Tom Needham
ArXiv (abs)PDFHTML

Papers citing "Gromov-Wasserstein Averaging in a Riemannian Framework"

10 / 10 papers shown
Title
The Z-Gromov-Wasserstein Distance
The Z-Gromov-Wasserstein Distance
Martin Bauer
Facundo Mémoli
Tom Needham
Mao Nishino
OT
86
2
0
15 Aug 2024
A Quotient Space Formulation for Generative Statistical Analysis of
  Graphical Data
A Quotient Space Formulation for Generative Statistical Analysis of Graphical Data
X. Guo
A. Srivastava
Sudeep Sarkar
45
14
0
30 Sep 2019
Sliced Gromov-Wasserstein
Sliced Gromov-Wasserstein
Titouan Vayer
Rémi Flamary
Romain Tavenard
Laetitia Chapel
Nicolas Courty
OT
71
100
0
24 May 2019
Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
Hongteng Xu
Dixin Luo
Lawrence Carin
64
197
0
18 May 2019
Learning Generative Models across Incomparable Spaces
Learning Generative Models across Incomparable Spaces
Charlotte Bunne
David Alvarez-Melis
Andreas Krause
Stefanie Jegelka
GAN
66
112
0
14 May 2019
Gromov-Wasserstein Learning for Graph Matching and Node Embedding
Gromov-Wasserstein Learning for Graph Matching and Node Embedding
Hongteng Xu
Dixin Luo
H. Zha
Lawrence Carin
107
260
0
17 Jan 2019
Gromov-Wasserstein Alignment of Word Embedding Spaces
Gromov-Wasserstein Alignment of Word Embedding Spaces
David Alvarez-Melis
Tommi Jaakkola
OT
56
328
0
31 Aug 2018
Optimal Transport for structured data with application on graphs
Optimal Transport for structured data with application on graphs
Titouan Vayer
Laetitia Chapel
Rémi Flamary
R. Tavenard
Nicolas Courty
OT
75
274
0
23 May 2018
Sinkhorn Distances: Lightspeed Computation of Optimal Transportation
  Distances
Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances
Marco Cuturi
OT
220
4,294
0
04 Jun 2013
Learning in Riemannian Orbifolds
Learning in Riemannian Orbifolds
Brijnesh J. Jain
Klaus Obermayer
85
17
0
19 Apr 2012
1