Reversible Gromov-Monge Sampler for Simulation-Based Inference
Not on the map. Why?
Abstract (arXiv)
This paper introduces a new simulation-based inference procedure to model and sample from multi-dimensional probability distributions given access to i.i.d. samples, circumventing the usual approaches of explicitly modeling the density function or designing Markov chain Monte Carlo. Motivated by the seminal work on distance and isomorphism between metric measure spaces, we propose a new notion called the Reversible Gromov-Monge (RGM) distance and study how RGM can be used to design new transform samplers to perform simulation-based inference. Our RGM sampler can also estimate optimal alignments between two heterogeneous metric measure spaces (cX, μ, ccX) and (cY, nu, ccY) from empirical data sets, with estimated maps that approximately push forward one measure μ to the other nu, and vice versa. We study the analytic properties of the RGM distance and derive that under mild conditions, RGM equals the classic Gromov-Wasserstein distance. Curiously, drawing a connection to Brenier's polar factorization, we show that the RGM sampler induces bias towards strong isomorphism with proper choices of ccX and ccY. Statistical rate of convergence, representation, and optimization questions regarding the induced sampler are studied. Synthetic and real-world examples showcasing the effectiveness of the RGM sampler are also demonstrated.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 24 of its 65 references that are in the map. First posted on arXiv 28 Sep 2021.
Builds on
24 of 65 references.
References · 24
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 633
- 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 504
- 2016Kernel Mean Embedding of Distributions: A Review and Beyondcited by 360
- 2017Learning Generative Models with Sinkhorn Divergencescited by 310
- 2015Generative Moment Matching Networkscited by 252
- 2018Estimating the intrinsic dimension of datasets by a minimal neighborhood informationcited by 246
- 2017Training GANs with Optimismcited by 217
- 2019Optimal transport mapping via input convex neural networkscited by 202
- 2017Generalization and Equilibrium in Generative Adversarial Nets (GANs)cited by 165
- 2015Training generative neural networks via Maximum Mean Discrepancy optimizationcited by 149
- 2019Gromov-Wasserstein Learning for Graph Matching and Node Embeddingcited by 125
12 more
- 2019Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matchingcited by 102
- 2018How Well Generative Adversarial Networks Learn Distributionscited by 78
- 2018Interaction Matters: A Note on Non-asymptotic Local Convergence of Generative Adversarial Networkscited by 68
- 2019Sliced Gromov-Wassersteincited by 66
- 2021Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costscited by 61
- 2018On exponential convergence of SGD in non-convex over-parametrized learningcited by 33
- 20192-Wasserstein Approximation via Restricted Convex Potentials with Application to Improved Training for GANscited by 32
- 2018Approximability of Discriminators Implies Diversity in GANscited by 28
- 2021Quantized Gromov-Wassersteincited by 18
- 2019SGD Learns One-Layer Networks in WGANscited by 16
- 2019Estimating Certain Integral Probability Metric (IPM) is as Hard as Estimating under the IPMcited by 11
- 2020MREC: a fast and versatile framework for aligning and matching point clouds with applications to single cell molecular datacited by 10
Built on by
Citing papers per year: 2022: 3; 2023: 2; 2024: 2; 2025: 2; 2026: 1.
10 papers.
- 2022Neural Unbalanced Optimal Transport via Cycle-Consistent Semi-Couplingscited by 16
- 2022Online Learning to Transport via the Minimal Selection Principlecited by 6
- 2023Uncovering Challenges of Solving the Continuous Gromov-Wasserstein Problemcited by 6
- 2024Denoising Diffusions with Optimal Transport: Localization, Curvature, and Multi-Scale Complexitycited by 5
- 2022Optimal 1-Wasserstein Distance for WGANscited by 3
- 2023Robust Point Matching with Distance Profilescited by 1
- 2024Linear Partial Gromov-Wasserstein Embeddingcited by 1
- 2025Relation-Aware Slicing in Cross-Domain Alignmentcited by 0
- 2025Distributional Shrinkage I: Universal Denoiser Beyond Tweedie's Formulacited by 0
- 2026Cluster-Aware Matching via Laplacian Optimal Transportcited by 0
- 2026Cluster-Aware Matching via Laplacian Optimal Transport17 Jul 2026
- 2025Distributional Shrinkage I: Universal Denoiser Beyond Tweedie's Formula12 Nov 2025
- 2025Relation-Aware Slicing in Cross-Domain Alignment17 Jul 2025
- 2024Denoising Diffusions with Optimal Transport: Localization, Curvature, and Multi-Scale Complexity3 Nov 2024
- 2024Linear Partial Gromov-Wasserstein Embedding22 Oct 2024
- 2023Robust Point Matching with Distance Profiles19 Dec 2023
- 2023Uncovering Challenges of Solving the Continuous Gromov-Wasserstein Problem10 Mar 2023
- 2022Neural Unbalanced Optimal Transport via Cycle-Consistent Semi-Couplings30 Sep 2022
- 2022Online Learning to Transport via the Minimal Selection Principle9 Feb 2022
- 2022Optimal 1-Wasserstein Distance for WGANs8 Jan 2022