Fetching the paper…
Reading the bibliography…
Comparing probability distributions is a fundamental problem in data sciences.
On the transfer of masses (in Russian)
Kantorovich, L. (1942) · 1942
Earlier work this paper cites.
The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
Bregman, L. M. (1967) · 1967
Earlier work this paper cites.
On the scaling of multidimensional matrices
Franklin, J. and Lorenz, J. (1989) · 1989
Earlier work this paper cites.
The earth mover’s distance as a metric for image retrieval
Rubner, Y., Tomasi, C., and Guibas, L. J. (2000) · 2000
Earlier work this paper cites.
Diffeomorphic matching of distributions: A new approach for unlabelled point-sets and sub-manifolds matching
Glaunes, J., Trouvé, A., and Younes, L. (2004) · 2004
Earlier work this paper cites.
Hierarchical clustering via joint between-within distances: Extending ward’s minimum variance method
Székely, G. J. and Rizzo, M. L. (2004) · 2004
Earlier work this paper cites.
Surface matching via currents
Vaillant, M. and Glaunès, J. (2005) · 2005
Earlier work this paper cites.
On minimum Kantorovich distance estimators
Bassetti, F., Bodini, A., and Regazzini, E. (2006) · 2006
Earlier work this paper cites.
Universal kernels
Micchelli, C. A., Xu, Y., and Zhang, H. (2006) · 2006
Earlier work this paper cites.
A kernel method for the two-sample-problem
Gretton, A., Borgwardt, K. M., Rasch, M., Schölkopf, B., and Smola, A. J. (2007) · 2007
Earlier work this paper cites.
Matching with trade-offs: Revealed preferences over competing characteristics
Galichon, A. and Salanié, B. (2010) · 2010
Cited alongside, same era.
Sinkhorn distances: Lightspeed computation of optimal transport
Cuturi, M. (2013) · 2013
Cited alongside, same era.
A survey of the Schrödinger problem and some of its connections with optimal transport
Léonard, C. (2013) · 2013
Cited alongside, same era.
Generative adversarial nets
Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., and Bengio, Y. (2014) · 2014
Cited alongside, same era.
Training generative neural networks via maximum mean discrepancy optimization
Dziugaite, G. K., Roy, D. M., and Ghahramani, Z. (2015) · 2015
Cited alongside, same era.
Generative moment matching networks
A general framework for curve and surface comparison and registration with oriented varifolds
Kaltenmark, I., Charlier, B., and Charon, N. (2017) · 2017
Later among the works it cites.
Automatic differentiation in pytorch
Paszke, A., Gross, S., Chintala, S., Chanan, G., Yang, E., DeVito, Z., Lin, Z., Desmaison, A., Antiga, L., and Lerer, A. (2017) · 2017
Later among the works it cites.
Computational optimal transport
Peyré, G. and Cuturi, M. (2017) · 2017
Later among the works it cites.
On wasserstein two-sample testing and related families of nonparametric tests
Ramdas, A., Trillos, N. G., and Cuturi, M. (2017) · 2017
Later among the works it cites.
Overrelaxed sinkhorn-knopp algorithm for regularized optimal transport
Thibault, A., Chizat, L., Dossal, C., and Papadakis, N. (2017) · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Li, Y., Swersky, K., and Zemel, R. (2015) · 2015
Cited alongside, same era.
Optimal Transport for applied mathematicians
Santambrogio, F. (2015) · 2015
Cited alongside, same era.
Wasserstein barycentric coordinates: Histogram regression using optimal transport
Bonneel, N., Peyré, G., and Cuturi, M. (2016) · 2016
Cited alongside, same era.
Wasserstein training of restricted boltzmann machines
Montavon, G., Müller, K.-R., and Cuturi, M. (2016) · 2016
Cited alongside, same era.
Arjovsky, M., Chintala, S., and Bottou, L. (2017) · 2017
Cited alongside, same era.
Kernel operations on the gpu, with autodiff, without memory overflows
Charlier, B., Feydy, J., and Glaunès, J. (2018) · 2018
Closest in time.
Learning generative models with sinkhorn divergences
Genevay, A., Peyré, G., and Cuturi, M. (2018) · 2018
Closest in time.
Improving GANs using optimal transport
Salimans, T., Zhang, H., Radford, A., and Metaxas, D. (2018) · 2018
Closest in time.
On the convergence and robustness of training GANs with regularized optimal transport
Sanjabi, M., Ba, J., Razaviyayn, M., and Lee, J. D. (2018) · 2018
Closest in time.
Learning with a Wasserstein loss
Frogner, C., Zhang, C., Mobahi, H., Araya, M., and Poggio, T. A. (2015) · 2061
Closest in time.