Fetching the paper…
Reading the bibliography…
We present several new complexity results for the entropic regularized algorithms that approximately solve the optimal transport (OT) problem between two discrete probability measures with at most $n$ atoms.
J. Weed and F. Bach · 1906
Earlier work this paper cites.
On the translocation of masses
L. V. Kantorovich · 1942
Earlier work this paper cites.
The Hungarian method for the assignment problem
H. W. Kuhn · 1955
Earlier work this paper cites.
Variants of the Hungarian method for assignment problems
H. W. Kuhn · 1956
Earlier work this paper cites.
Algorithms for the assignment and transportation problems
J. Munkres · 1957
Earlier work this paper cites.
The speed of mean Glivenko-Cantelli convergence
R. M. Dudley · 1969
Earlier work this paper cites.
Diagonal equivalence to matrices with prescribed row and column sums
R. Sinkhorn · 1974
Earlier work this paper cites.
A comparative study of algorithms for matrix balancing
M. H. Schneider and S. A. Zenios · 1990
Earlier work this paper cites.
Faster scaling algorithms for general graph matching problems
H. N. Gabow and R. E. Tarjan · 1991
Earlier work this paper cites.
New scaling algorithms for the assignment and minimum mean cycle problems
J. B. Orlin and R. K. Ahuja · 1992
Earlier work this paper cites.
Polynomial dual network simplex algorithms
J. B. Orlin, S. A. Plotkin, and E. Tardos · 1993
Earlier work this paper cites.
On the complexity of nonnegative matrix scaling
B. Kalantari and L. Khachiyan · 1996
Earlier work this paper cites.
Introduction to Linear Optimization
D. Bertsimas and J. Tsitsiklis · 1997
Earlier work this paper cites.
A polynomial time primal network simplex algorithm for minimum cost flows
J. B. Orlin · 1997
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Y. Nesterov · 2005
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.
Fast and robust earth mover’s distance
O. Pele and M. Werman · 2009
Earlier work this paper cites.
Optimal Transport: Old and New , volume 338
C. Villani · 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.
Sliced and radon Wasserstein barycenters of measures
N. Bonneel, J. Rabin, G. Peyré, and H. Pfister · 2015
Earlier work this paper cites.
Accelerated, parallel, and proximal coordinate descent
Olivier Fercoq and Peter Richtárik · 2015
Earlier work this paper cites.
On the rate of convergence in Wasserstein distance of the empirical measure
N. Fournier and A. Guillin · 2015
Earlier work this paper cites.
An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization
Q. Lin, Z. Lu, and L. Xiao · 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.
Massively scalable Sinkhorn distances via the Nyström method
J. Altschuler, F. Bach, A. Rudi, and J. Niles-Weed · 2019
Closest in time.
On parameter estimation with the Wasserstein distance
E. Bernton, P. E. Jacob, M. Gerber, and C. P. Robert · 2019
Closest in time.
Lower bounds on adversarial robustness from optimal transport
A. N. Bhagoji, D. Cullina, and P. Mittal · 2019
Closest in time.
Quantifying distributional model risk via optimal transport
J. Blanchet and K. Murthy · 2019
Closest in time.
Robust Wasserstein profile inference and applications to machine learning
J. Blanchet, Y. Kang, and K. Murthy · 2019
Closest in time.
Differentiable ranks and sorting using optimal transport
M. Cuturi, O. Teboul, and J-P. Vert · 2019
Closest in time.
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.
Interpolating between optimal transport and MMD using Sinkhorn divergences
J. Feydy, T. Séjourné, F-X. Vialard, S-I. Amari, A. Trouvé, and G. Peyré · 2019
Closest in time.
Sample complexity of Sinkhorn divergences
A. Genevay, L. Chizat, F. Bach, M. Cuturi, and G. Peyré · 2019
Closest in time.
Probabilistic multilevel clustering via composite transportation distance
N. Ho, V. Huynh, D. Phung, and M. I. Jordan · 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.
Generalized sliced Wasserstein distances
S. Kolouri, K. Nadjahi, U. Simsekli, R. Badeau, and G. Rohde · 2019
Closest in time.
A graph theoretic additive approximation of optimal transport
N. Lahn, D. Mulchandani, and S. Raghvendra · 2019
Closest in time.
Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem
G. Mena and J. Niles-Weed · 2019
Closest in time.
Subspace robust Wasserstein distances
F-P. Paty and M. Cuturi · 2019
Closest in time.
Computational optimal transport
G. Peyré and M. Cuturi · 2019
Closest in time.
Approximating optimal transport with linear programs
K. Quanrud · 2019
Closest in time.
Optimal transport: Fast probabilistic approximation with exact solvers
M. Sommerfeld, Y. Zemel, and A. Munk · 2019
Closest in time.
Robust optimal transport with applications in generative modeling and domain adaptation
Y. Balaji, R. Chellappa, and S. Feizi · 2020
Closest in time.
Faster Wasserstein distance estimation with the Sinkhorn divergence
L. Chizat, P. Roussillon, F. Léger, F-X. Vialard, and G. Peyré · 2020
Closest in time.
A study of performance of optimal transport
Y. Dong, Y. Gao, R. Peng, I. Razenshteyn, and S. Sawlani · 2020
Closest in time.
Fast algorithms for computational optimal transport and Wasserstein barycenter
W. Guo, N. Ho, and M. Jordan · 2020
Closest in time.
Convergence and concentration of empirical measures under wasserstein distance in unbounded functional spaces
J. Lei · 2020
Closest in time.
Adversarial risk via optimal transport and optimal couplings
M. S. Pydi and V. Jog · 2020
Closest in time.
On a combination of alternating minimization and Nesterov’s momentum
S. Guminov, P. Dvurechensky, N. Tupitsa, and A. Gasnikov · 2021
Closest in time.
Distributional sliced-Wasserstein and applications to generative modeling
K. Nguyen, N. Ho, T. Pham, and H. Bui · 2021
Closest in time.
Minimum cost flows, MDPs, and ℓ 1 \ell_{1} -regression in nearly linear time for dense instances
J. van den Brand, Y. T. Lee, Y. P. Liu, T. Saranurak, A. Sidford, Z. Song, and D. Wang · 2021
Closest in time.