ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2002.01615
  4. Cited By
Fast and Robust Comparison of Probability Measures in Heterogeneous
  Spaces
v1v2v3 (latest)

Fast and Robust Comparison of Probability Measures in Heterogeneous Spaces

5 February 2020
Ryoma Sato
Marco Cuturi
M. Yamada
H. Kashima
ArXiv (abs)PDFHTMLGithub (2★)

Papers citing "Fast and Robust Comparison of Probability Measures in Heterogeneous Spaces"

16 / 16 papers shown
Slicing Wasserstein Over Wasserstein Via Functional Optimal Transport
Slicing Wasserstein Over Wasserstein Via Functional Optimal Transport
Moritz Piening
Robert Beinert
182
2
0
26 Sep 2025
Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric
Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric
Iman Seyedi
Antonio Candelieri
Enza Messina
Francesco Archetti
OT
251
1
0
04 Sep 2025
A Novel Sliced Fused Gromov-Wasserstein Distance
A Novel Sliced Fused Gromov-Wasserstein Distance
Moritz Piening
Robert Beinert
338
2
0
04 Aug 2025
Fast Gradient Computation for Gromov-Wasserstein Distance
Fast Gradient Computation for Gromov-Wasserstein Distance
Wei Zhang
Zihao Wang
Jie Fan
Hao Wu
Yong Zhang
OT
346
3
0
13 Apr 2024
Partial Transport for Point-Cloud Registration
Partial Transport for Point-Cloud RegistrationSampling Theory, Signal Processing, and Data Analysis (TSPDA), 2023
Yikun Bai
Huy Tran
S. Damelin
Soheil Kolouri
3DPCOT
307
4
0
27 Sep 2023
Unbalanced Low-rank Optimal Transport Solvers
Unbalanced Low-rank Optimal Transport SolversNeural Information Processing Systems (NeurIPS), 2023
M. Scetbon
Stephen Zhang
Giovanni Palla
Marco Cuturi
OT
258
6
0
31 May 2023
Keypoint-Guided Optimal Transport
Keypoint-Guided Optimal Transport
Xiang Gu
Yucheng Yang
Weizhen Zeng
Jian Sun
Zongben Xu
296
1
0
23 Mar 2023
Sliced Optimal Partial Transport
Sliced Optimal Partial TransportComputer Vision and Pattern Recognition (CVPR), 2022
Yikun Bai
Bernhard Schmitzer
Matthew Thorpe
Soheil Kolouri
OT
700
28
0
15 Dec 2022
Budget-Constrained Bounds for Mini-Batch Estimation of Optimal Transport
Budget-Constrained Bounds for Mini-Batch Estimation of Optimal Transport
David Alvarez-Melis
Nicolò Fusi
Lester W. Mackey
Tal Wagner
OT
259
1
0
24 Oct 2022
Efficient Approximation of Gromov-Wasserstein Distance Using Importance
  Sparsification
Efficient Approximation of Gromov-Wasserstein Distance Using Importance SparsificationJournal of Computational And Graphical Statistics (JCGS), 2022
Mengyu Li
Jun Yu
Hongteng Xu
Cheng Meng
283
24
0
26 May 2022
Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and
  Costs
Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and CostsInternational Conference on Machine Learning (ICML), 2021
M. Scetbon
Gabriel Peyré
Marco Cuturi
OT
351
72
0
02 Jun 2021
Re-evaluating Word Mover's Distance
Re-evaluating Word Mover's DistanceInternational Conference on Machine Learning (ICML), 2021
Ryoma Sato
M. Yamada
H. Kashima
457
25
0
30 May 2021
Quantized Gromov-Wasserstein
Quantized Gromov-Wasserstein
Samir Chowdhury
David W. Miller
Tom Needham
224
27
0
05 Apr 2021
Making transport more robust and interpretable by moving data through a
  small number of anchor points
Making transport more robust and interpretable by moving data through a small number of anchor pointsInternational Conference on Machine Learning (ICML), 2020
Chi-Heng Lin
Mehdi Azabou
Eva L. Dyer
OTOOD
453
25
0
21 Dec 2020
A contribution to Optimal Transport on incomparable spaces
A contribution to Optimal Transport on incomparable spaces
Titouan Vayer
OT
393
25
0
09 Nov 2020
Fast Unbalanced Optimal Transport on a Tree
Fast Unbalanced Optimal Transport on a Tree
Ryoma Sato
M. Yamada
H. Kashima
OT
321
29
0
04 Jun 2020
1
Page 1 of 1