Fetching the paper…
Reading the bibliography…
The Gromov-Wasserstein (GW) distance is an extension of the optimal transport problem that allows one to match objects between incomparable spaces.
On translocation of masses
Kantorovich (1942) · 1942
Earlier work this paper cites.
Maxima for graphs and a new proof of a theorem of tur´an
Motzkin, T. and Straus, E. G. (1965) · 1965
Earlier work this paper cites.
Stochastic blockmodels: First steps
Holland, P. W., Laskey, K. B., and Leinhardt, S. (1983) · 1983
Earlier work this paper cites.
Quadratic programming with one negative eigenvalue is np-hard
Pardalos, P. M. and Vavasis, S. A. (1991) · 1991
Earlier work this paper cites.
Semidefinite Programming Relaxations for the Quadratic Assignment Problem
Zhao, Q., Karisch, S. E., Rendl, F., and Wolkowicz, H. (1998) · 1998
Earlier work this paper cites.
Solving standard quadratic optimization problems via linear, semidefinite and copositive programming
Bomze, I. M. and de Klerk, E. (2002) · 2002
Earlier work this paper cites.
Deformation transfer for triangle meshes
Sumner, R. W. and Popović, J. (2004) · 2004
Earlier work this paper cites.
Numerical Optimization
Nocedal, J. and Wright, S. J. (2006) · 2006
Earlier work this paper cites.
Optimal transport: old and new
Villani, C. et al. (2009) · 2009
Earlier work this paper cites.
Barycenters in the wasserstein space
Agueh, M. and Carlier, G. (2011) · 2011
Earlier work this paper cites.
Gromov–Wasserstein Distances and the Metric Approach to Object Matching
Mémoli, F. (2011) · 2011
Earlier work this paper cites.
Wasserstein barycenter and its application to texture mixing
Rabin, J., Peyré, G., Delon, J., and Bernot, M. (2012) · 2011
Earlier work this paper cites.
Sinkhorn distances: Lightspeed computation of optimal transport
Cuturi, M. (2013) · 2013
Earlier work this paper cites.
Iterative bregman projections for regularized transportation problems
Benamou, J.-D., Carlier, G., Cuturi, M., Nenna, L., and Peyré, G. (2015) · 2015
Earlier work this paper cites.
Tight relaxation of quadratic matching
Kezurer, I., Kovalsky, S. Z., Basri, R., and Lipman, Y. (2015) · 2015
Earlier work this paper cites.
From word embeddings to document distances
Kusner, M., Sun, Y., Kolkin, N., and Weinberger, K. (2015) · 2015
Cited alongside, same era.
Optimal transport for applied mathematicians
Santambrogio, F. (2015) · 2015
Cited alongside, same era.
CVXPY: A Python-embedded modeling language for convex optimization
Diamond, S. and Boyd, S. (2016) · 2016
Cited alongside, same era.
Conic optimization via operator splitting and homogeneous self-dual embedding
O’Donoghue, B., Chu, E., Parikh, N., and Boyd, S. (2016) · 2016
Cited alongside, same era.
Gromov-wasserstein averaging of kernel and distance matrices
Peyré, G., Cuturi, M., and Solomon, J. (2016) · 2016
Cited alongside, same era.
A polynomial-time relaxation of the gromov-hausdorff distance
Villar, S., Bandeira, A. S., Blumberg, A. J., and Ward, R. (2016) · 2016
Sampled gromov wasserstein
Kerdoncuff, T., Emonet, R., and Sebban, M. (2021) · 2021
Later among the works it cites.
The unbalanced gromov wasserstein distance: Conic formulation and relaxation
Sejourne, T., Vialard, F.-X., and Peyré, G. (2021) · 2021
Later among the works it cites.
Online graph dictionary learning
Vincent-Cuaz, C., Vayer, T., Flamary, R., Corneli, M., and Courty, N. (2021) · 2021
Later among the works it cites.
The MOSEK optimization toolbox for Python manual. Version 10.0
ApS, M. (2022) · 2022
Later among the works it cites.
Flow matching for generative modeling
Lipman, Y., Chen, R. T., Ben-Hamu, H., Nickel, M., and Le, M. (2022) · 2022
Later among the works it cites.
Flow straight and fast: Learning to generate and transfer data with rectified flow
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Community detection and stochastic block models: recent developments
Abbe, E. (2017) · 2017
Cited alongside, same era.
Wasserstein generative adversarial networks
Arjovsky, M., Chintala, S., and Bottou, L. (2017) · 2017
Cited alongside, same era.
Joint distribution optimal transportation for domain adaptation
Courty, N., Flamary, R., Habrard, A., and Rakotomamonjy, A. (2017) · 2017
Cited alongside, same era.
Ds++: A Flexible, Scalable and Provably Tight Relaxation for Matching Problems
Dym, N., Maron, H., and Lipman, Y. (2017) · 2017
Cited alongside, same era.
Computational optimal transport: With applications to data science
Peyré, G., Cuturi, M., et al. (2019) · 2019
Cited alongside, same era.
Optimal-transport analysis of single-cell gene expression identifies developmental trajectories in reprogramming
Schiebinger, G., Shu, J., Tabaka, M., Cleary, B., Subramanian, V., Solomon, A., Gould, J., Liu, S., Lin, S., Berube, P., et al. (2019) · 2019
Cited alongside, same era.
Liu, X., Gong, C., and Liu, Q. (2022) · 2022
Later among the works it cites.
Moment-sos methods for optimal transport problems
Mula, O. and Nouy, A. (2022) · 2022
Later among the works it cites.
Linear-time gromov wasserstein distances using low rank couplings and costs
Scetbon, M., Peyré, G., and Cuturi, M. (2022) · 2022
Later among the works it cites.
Template based graph neural network with optimal transport distances
Vincent-Cuaz, C., Flamary, R., Corneli, M., Vayer, T., and Courty, N. (2022) · 2022
Later among the works it cites.
Learning single-cell perturbation responses using neural optimal transport
Bunne, C., Stark, S. G., Gut, G., Del Castillo, J. S., Levesque, M., Lehmann, K.-V., Pelkmans, L., Krause, A., and Rätsch, G. (2023) · 2023
Closest in time.
Globally solving the Gromov-Wasserstein problem for point clouds in low dimensional Euclidean spaces
Ryner, M., Kronqvist, J., and Karlsson, J. (2023) · 2023
Closest in time.
Optimal transport for single-cell and spatial omics
Bunne, C., Schiebinger, G., Krause, A., Regev, A., and Cuturi, M. (2024) · 2024
Closest in time.
Outlier-robust gromov-wasserstein for graph data
Kong, L., Li, J., Tang, J., and So, A. M.-C. (2024) · 2024
Closest in time.
The NP-hardness of the Gromov-Wasserstein Distance
Kravtsova, N. (2024) · 2024
Closest in time.