Fetching the paper…
Reading the bibliography…
We introduce in this paper a novel strategy for efficiently approximating the Sinkhorn distance between two discrete measures.
On efficient optimal transport: An analysis of greedy and accelerated mirror descent algorithms
Lin, T., N. Ho, and M. I. Jordan (2019) · 1901
Earlier work this paper cites.
On the transfer of masses (in russian)
Kantorovich, L. (1942) · 1942
Earlier work this paper cites.
Wasserstein discriminant analysis
Flamary, R., M. Cuturi, N. Courty, and A. Rakotomamonjy (2018) · 1945
Earlier work this paper cites.
Diagonal equivalence to matrices with prescribed row and column sums
Sinkhorn, R. (1967) · 1967
Earlier work this paper cites.
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
Altschuler, J., J. Weed, and P. Rigollet (2017) · 1971
Earlier work this paper cites.
Updating quasi-newton matrices with limited storage
Nocedal, J. (1980) · 1980
Earlier work this paper cites.
A distance metric for multidimensional histograms
Werman, M., S. Peleg, and A. Rosenfeld (1985) · 1985
Earlier work this paper cites.
A limited memory algorithm for bound constrained optimization
Byrd, R., P. Lu, J. Nocedal, and C. Zhu (1995) · 1995
Earlier work this paper cites.
On the complexity of nonnegative-matrix scaling
Kalantari, B. and L.Khachiyan (1996) · 1996
Earlier work this paper cites.
The earth mover’s distance as a metric for image retrieval
Rubner, Y., C. Tomasi, and L. J. Guibas (2000) · 2000
Earlier work this paper cites.
On the complexity of general matrix scaling and entropy minimization via the ras algorithm
Kalantari, B., I. Lari, F. Ricca, and B. Simeone (2008) · 2008
Earlier work this paper cites.
The Sinkhorn–Knopp algorithm: Convergence and applications
Knight, P. (2008) · 2008
Earlier work this paper cites.
Optimal Transport: Old and New
Villani, C. (2009) · 2009
Earlier work this paper cites.
Safe feature elimination in sparse supervised learning
Ghaoui, L. E., V. Viallon, and T. Rabbani (2010) · 2010
Earlier work this paper cites.
Displacement interpolation using Lagrangian mass transport
Bonneel, N., M. van de Panne, S. Paris, and W. Heidrich (2011) · 2011
Cited alongside, same era.
Sinkhorn distances: Lightspeed computation of optimal transport
Cuturi, M. (2013) · 2013
Cited alongside, same era.
Parallel L-BFGS-B algorithm on GPU
Fei, Y., G. Rong, B. Wang, and W. Wang (2014) · 2014
Cited alongside, same era.
Path finding methods for linear programming: Solving linear programs in Õ(vrank) iterations and faster algorithms for maximum flow
Lee, Y. T. and A. Sidford (2014) · 2014
Cited alongside, same era.
Wasserstein propagation for semi-supervised learning
Solomon, J., R. Rustamov, L. Guibas, and A. Butscher (2014) · 2014
Cited alongside, same era.
Iterative bregman projections for regularized transportation problems
Benamou, J. D., G. Carlier, M. Cuturi, L. Nenna, and G. Peyré (2015) · 2015
Optimal transport for domain adaptation
Courty, N., R. Flamary, D. Tuia, and A. Rakotomamonjy (2017) · 2017
Later among the works it cites.
Construction of non-asymptotic confidence sets in 2-Wasserstein space
Ebert, J., V. Spokoiny, and A. Suvorikova (2017) · 2017
Later among the works it cites.
POT: Python optimal transport library
Flamary, R. and N. Courty (2017) · 2017
Later among the works it cites.
Multilevel clustering via Wasserstein means
Ho, N., X. L. Nguyen, M. Yurochkin, H. H. Bui, V. Huynh, and D. Phung (2017) · 2017
Later among the works it cites.
Optimal mass transport: Signal processing and machine-learning applications
Kolouri, S., S. R. Park, M. Thorpe, D. Slepcev, and G. K. Rohde (2017) · 2017
Later among the works it cites.
Stochastic algorithms for entropy-regularized optimal transport problems
Abid, B. K. and R. Gower (2018) · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
From word embeddings to document distances
Kusner, M., Y. Sun, N. Kolkin, and K. Weinberger (2015) · 2015
Cited alongside, same era.
Convolutional Wasserstein distances: Efficient optimal transportation on geometric domains
Solomon, J., F. de Goes, G. Peyré, M. Cuturi, A. Butscher, A. Nguyen, T. Du, and L. Guibas (2015) · 2015
Cited alongside, same era.
A smoothed dual approach for variational Wasserstein problems
Cuturi, M. and G. Peyré (2016) · 2016
Cited alongside, same era.
Stochastic optimization for large-scale optimal transport
Genevay, A., M. Cuturi, G. Peyré, and F. Bach (2016) · 2016
Cited alongside, same era.
Amplitude and phase variation of point processes
Panaretos, V. M. and Y. Zemel (2016) · 2016
Cited alongside, same era.
Wasserstein generative adversarial networks
Arjovsky, M., S. Chintala, and L. Bottou (2017) · 2017
Cited alongside, same era.
Massively scalable Sinkhorn distances via the Nyström method
Altschuler, J., F. Bach, A. Rudi, and J. Weed (2018) · 2018
Later among the works it cites.
Smooth and sparse optimal transport
Blondel, M., V. Seguy, and A. Rolet (2018) · 2018
Later among the works it cites.
Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn’s algorithm
Dvurechensky, P., A. Gasnikov, and A. Kroshnin (2018) · 2018
Later among the works it cites.
A fast proximal point method for computing Wasserstein distance
Xie, Y., X.Wang, R. Wang, and H. Zha (2018) · 2018
Later among the works it cites.
Computational optimal transport
Peyré, G. and M. Cuturi (2019) · 2019
Closest in time.
Domain-adversarial training of neural networks
Ganin, Y., E. Ustinova, H. Ajakan, P. Germain, H. Larochelle, F. Laviolette, M. Marchand, and V. Lempitsky (2016) · 2030
Closest in time.
Learning with a Wasserstein loss
Frogner, C., C. Zhang, H. Mobahi, M. Araya, and T. A. Poggio (2015) · 2061
Closest in time.