Fetching the paper…
Reading the bibliography…
In this paper, we focus on computational aspects of the Wasserstein barycenter problem.
On the complexity of approximating Wasserstein barycenters
Kroshnin, A., Tupitsa, N., Dvinskikh, D., Dvurechensky, P., Gasnikov, A., and Uribe, C. (2019) · 1901
Earlier work this paper cites.
Accelerated alternating minimization
Guminov, S., Dvurechensky, P., and Gasnikov, A. (2019) · 1906
Earlier work this paper cites.
Dynamic trees as search trees via euler tours, applied to the network simplex algorithm
Tarjan, R. E. (1997) · 1997
Earlier work this paper cites.
Prox-method with rate of convergence o (1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems
Nemirovski, A. (2004) · 2004
Earlier work this paper cites.
Dual extrapolation and its applications to solving variational inequalities and related problems
Nesterov, Y. (2007) · 2007
Earlier work this paper cites.
A probability metrics approach to financial risk measures
Rachev, S. T., Stoyanov, S. V., and Fabozzi, F. J. (2011) · 2011
Earlier work this paper cites.
Consistent estimation of a population barycenter in the wasserstein space
Bigot, J., Klein, T., et al. (2012) · 2012
Earlier work this paper cites.
Sinkhorn distances: Lightspeed computation of optimal transport
Cuturi, M. (2013) · 2013
Earlier work this paper cites.
Theory of convex optimization for machine learning
Bubeck, S. (2014) · 2014
Cited alongside, same era.
Iterative bregman projections for regularized transportation problems
Benamou, J.-D., Carlier, G., Cuturi, M., Nenna, L., and Peyré, G. (2015) · 2015
Cited alongside, same era.
Convolutional wasserstein distances: Efficient optimal transportation on geometric domains
Solomon, J., De Goes, F., Peyré, G., Cuturi, M., Butscher, A., Nguyen, A., Du, T., and Guibas, L. (2015) · 2015
Cited alongside, same era.
Much faster algorithms for matrix scaling
Allen-Zhu, Z., Li, Y., Oliveira, R., and Wigderson, A. (2017) · 2017
Cited alongside, same era.
Arjovsky, M., Chintala, S., and Bottou, L. (2017) · 2017
Cited alongside, same era.
Area-convexity, l ∞ l_{\infty} regularization, and undirected multicommodity flow
Sherman, J. (2017) · 2017
Later among the works it cites.
Towards optimal running times for optimal transport
Blanchet, J., Jambulapati, A., Kent, C., and Sidford, A. (2018) · 2018
Later among the works it cites.
Dvurechensky, P., Gasnikov, A., and Kroshnin, A. (2018) · 2018
Later among the works it cites.
Computational optimal transport
Peyré, G. and Cuturi, M. (2018) · 2018
Later among the works it cites.
A direct O ~ ( 1 / ε ) \tilde{O}(1/\varepsilon) iteration parallel algorithm for optimal transport
Jambulapati, A., Sidford, A., and Tian, K. (2019) · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Matrix scaling and balancing via box constrained newton’s method and interior point methods
Cohen, M. B., Madry, A., Tsipras, D., and Vladu, A. (2017) · 2017
Cited alongside, same era.
Construction of non-asymptotic confidence sets in 2-Wasserstein space
Ebert, J., Spokoiny, V., and Suvorikova, A. (2017) · 2017
Cited alongside, same era.
Later among the works it cites.
A wasserstein-type distance in the space of gaussian mixture models
Delon, J. and Desolneux, A. (2020) · 2020
Closest in time.
Fixed-support wasserstein barycenters: Computational hardness and fast algorithm
Lin, T., Ho, N., Chen, X., Cuturi, M., and Jordan, M. I. (2020) · 2020
Closest in time.