Fetching the paper…
Reading the bibliography…
We provide theoretical analyses for two algorithms that solve the regularized optimal transport (OT) problem between two discrete probability measures with at most $n$ atoms.
On the translocation of masses
L. V. Kantorovich · 1942
Earlier work this paper cites.
Diagonal equivalence to matrices with prescribed row and column sums
R. Sinkhorn · 1974
Earlier work this paper cites.
Topics in Optimal Transportation
C. Villani · 2003
Earlier work this paper cites.
Cubic regularization of newton method and its global performance
Y. Nesterov and B. T. Polyak · 2006
Earlier work this paper cites.
On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
B. Kalantari, I. Lari, F. Ricca, and B. Simeone · 2008
Earlier work this paper cites.
The Sinkhorn–Knopp algorithm: Convergence and applications
P. A. Knight · 2008
Earlier work this paper cites.
On accelerated proximal gradient methods for convex-concave optimization
P. Tseng · 2008
Earlier work this paper cites.
Fast and robust earth mover’s distance
O. Pele and M. Werman · 2009
Earlier work this paper cites.
Sinkhorn distances: Lightspeed computation of optimal transport
M. Cuturi · 2013
Earlier work this paper cites.
Convergence of latent mixing measures in finite and infinite mixture models
X. Nguyen · 2013
Earlier work this paper cites.
Fast computation of Wasserstein barycenters
M. Cuturi and A. Doucet · 2014
Earlier work this paper cites.
Path finding methods for linear programming: Solving linear programs in O ~ \widetilde{O} (sqrt(rank)) iterations and faster algorithms for maximum flow
Y. T. Lee and A. Sidford · 2014
Earlier work this paper cites.
Iterative Bregman projections for regularized transportation problems
J-D. Benamou, G. Carlier, M. Cuturi, L. Nenna, and G. Peyré · 2015
Earlier work this paper cites.
WASP: Scalable Bayes via barycenters of subset posteriors
S. Srivastava, V. Cevher, Q. Dinh, and D. Dunson · 2015
Cited alongside, same era.
A smoothed dual approach for variational Wasserstein problems
M. Cuturi and G. Peyré · 2016
Cited alongside, same era.
Stochastic optimization for large-scale optimal transport
A. Genevay, M. Cuturi, G. Peyré, and F. Bach · 2016
Cited alongside, same era.
Borrowing strength in hierarchical Bayes: posterior concentration of the Dirichlet base measure
X. Nguyen · 2016
Cited alongside, same era.
Gromov-Wasserstein averaging of kernel and distance matrices
G. Peyré, M. Cuturi, and J. Solomon · 2016
Cited alongside, same era.
Fast dictionary learning with a smoothed Wasserstein loss
A. Rolet, M. Cuturi, and G. Peyré · 2016
Cited alongside, same era.
Greedy stochastic algorithms for entropy-regularized optimal transport problems
B. K. Abid and R. M. Gower · 2018
Later among the works it cites.
Towards optimal running times for optimal transport
J. Blanchet, A. Jambulapati, C. Kent, and A. Sidford · 2018
Later among the works it cites.
Smooth and sparse optimal transport
M. Blondel, V. Seguy, and A. Rolet · 2018
Later among the works it cites.
Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
D. Chakrabarty and S. Khanna · 2018
Later among the works it cites.
Decentralize and randomize: Faster algorithm for Wasserstein barycenters
P. Dvurechenskii, D. Dvinskikh, A. Gasnikov, C. Uribe, and A. Nedich · 2018
Later among the works it cites.
Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn’s algorithm
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Much faster algorithms for matrix scaling
Z. Allen-Zhu, Y. Li, R. Oliveira, and A. Wigderson · 2017
Cited alongside, same era.
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
J. Altschuler, J. Weed, and P. Rigollet · 2017
Cited alongside, same era.
Wasserstein generative adversarial networks
M. Arjovsky, S. Chintala, and L. Bottou · 2017
Cited alongside, same era.
Sliced Wasserstein kernel for persistence diagrams
M. Carrière, M. Cuturi, and S. Oudot · 2017
Cited alongside, same era.
Matrix scaling and balancing via box constrained Newton’s method and interior point methods
M. B. Cohen, A. Madry, D. Tsipras, and A. Vladu · 2017
Cited alongside, same era.
Optimal transport for domain adaptation
N. Courty, R. Flamary, D. Tuia, and A. Rakotomamonjy · 2017
Cited alongside, same era.
P. Dvurechensky, A. Gasnikov, and A. Kroshnin · 2018
Later among the works it cites.
Probabilistic multilevel clustering via composite transportation distance
N. Ho, V. Huynh, D. Phung, and M. I. Jordan · 2018
Later among the works it cites.
Sparsemax and relaxed Wasserstein for topic sparsity
T. Lin, Z. Hu, and X. Guo · 2018
Later among the works it cites.
Approximating optimal transport with linear programs
K. Quanrud · 2018
Later among the works it cites.
Scalable Bayes via barycenter in Wasserstein space
S. Srivastava, C. Li, and D. Dunson · 2018
Later among the works it cites.
Wasserstein auto-encoders
I. Tolstikhin, O. Bousquet, S. Gelly, and B. Schoelkopf · 2018
Later among the works it cites.
Accelerated alternating minimization, accelerated Sinkhorn’s algorithm and accelerated iterative Bregman projections
S. Guminov, P. Dvurechensky, N. Tupitsa, and A. Gasnikov · 2019
Closest in time.
A direct tilde { \{ O } \} (1/epsilon) iteration parallel algorithm for optimal transport
A. Jambulapati, A. Sidford, and K. Tian · 2019
Closest in time.