Supervised Gromov-Wasserstein Optimal Transport
Abstract: We introduce the supervised Gromov-Wasserstein (sGW) optimal transport, an extension of Gromov-Wasserstein by incorporating potential infinity patterns in the cost tensor. sGW enables the enforcement of application-induced constraints such as the preservation of pairwise distances by implementing the constraints as an infinity pattern. A numerical solver is proposed for the sGW problem and the effectiveness is demonstrated in various numerical experiments. The high-order constraints in sGW are transferred to constraints on the coupling matrix by solving a minimal vertex cover problem. The transformed problem is solved by the Mirror-C descent iteration coupled with the supervised optimal transport solver. In the numerical experiments, we first validate the proposed framework by applying it to matching synthetic datasets and investigating the impact of the model parameters. Additionally, we successfully apply sGW to real single-cell RNA sequencing data. Through comparisons with other Gromov-Wasserstein variants on real data, we demonstrate that sGW offers the novel utility of controlling distance preservation, leading to the automatic estimation of overlapping portions of datasets, which brings improved stability and flexibility in data-driven applications.
- Facundo Mémoli. Gromov–wasserstein distances and the metric approach to object matching. Foundations of computational mathematics, 11:417–487, 2011.
- Gromov-wasserstein learning for graph matching and node embedding. In International conference on machine learning, pages 6932–6941. PMLR, 2019.
- Got: an optimal transport framework for graph comparison. Advances in Neural Information Processing Systems, 32, 2019.
- Gromov-wasserstein alignment of word embedding spaces. arXiv preprint arXiv:1809.00013, 2018.
- Scot: single-cell multi-omics alignment with optimal transport. Journal of Computational Biology, 29(1):3–18, 2022.
- A brief survey on computational gromov-wasserstein distance. Procedia Computer Science, 199:697–702, 2022.
- Marco Cuturi. Sinkhorn distances: Lightspeed computation of optimal transport. Advances in neural information processing systems, 26, 2013.
- Gromov-wasserstein averaging of kernel and distance matrices. In International conference on machine learning, pages 2664–2672. PMLR, 2016.
- An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions. EURO Journal on Computational Optimization, 4:3–25, 2016.
- Entropic metric alignment for correspondence problems. ACM Transactions on Graphics (ToG), 35(4):1–13, 2016.
- Scaling algorithms for unbalanced optimal transport problems. Mathematics of Computation, 87(314):2563–2609, 2018.
- Alessio Figalli. The optimal partial transport problem. Archive for rational mechanics and analysis, 195(2):533–560, 2010.
- Partial gromov-wasserstein with applications on positive-unlabeled learning. Advances in Neural Information Processing Systems, 2020.
- Kevin Guittet. Extended Kantorovich norms: a tool for optimization. PhD thesis, INRIA, 2002.
- Unbalanced optimal transport, from theory to numerics. Handbook of Numerical Analysis, 24:407–471, 2023.
- Supervised optimal transport. SIAM Journal on Applied Mathematics, 82(5):1851–1877, 2022.
- Screening cell–cell communication in spatial transcriptomics via collective optimal transport. Nature Methods, 20(2):218–228, 2023.
- Iterative bregman projections for regularized transportation problems. SIAM J. Sci. Comput., 37:A1111–A1138, 2015.
- Facundo Mémoli. On the use of gromov-hausdorff distances for shape comparison. 2007.
- The unbalanced gromov wasserstein distance: Conic formulation and relaxation. Advances in Neural Information Processing Systems, 34:8766–8779, 2021.
- Jeff Erickson. Algorithms. 2019.
- Introduction to algorithms. MIT press, 2022.
- Amir Beck. First-order methods in optimization. SIAM, 2017.
- Gabriel Peyré. Entropic approximation of wasserstein gradient flows. SIAM Journal on Imaging Sciences, 8(4):2323–2351, 2015.
- Topological methods for the analysis of high dimensional data sets and 3d object recognition. PBG@ Eurographics, 2:091–100, 2007.
- Geometric sketching compactly summarizes the single-cell transcriptomic landscape. Cell systems, 8(6):483–493, 2019.
- Exponential scaling of single-cell rna-seq in the past decade. Nature protocols, 13(4):599–604, 2018.
- A comparison of single-cell trajectory inference methods. Nature biotechnology, 37(5):547–554, 2019.
- Mapping the mouse cell atlas by microwell-seq. Cell, 172(5):1091–1107, 2018.
- Transcriptional heterogeneity and lineage commitment in myeloid progenitors. Cell, 163(7):1663–1677, 2015.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.