Fetching the paper…
Reading the bibliography…
We consider a multimarginal optimal transport, which includes as a particular case the Wasserstein barycenter problem.
1906
Earlier work this paper cites.
1910
Earlier work this paper cites.
1971
Earlier work this paper cites.
R. G. Parr, “Density functional theory of atoms and molecules,” in Horizons of Quantum Chemistry . Springer, 1980, pp. 5–15
1980
Earlier work this paper cites.
Y. Nesterov and A. Nemirovskii, Interior-point polynomial algorithms in convex programming . SIAM, 1994
1994
Earlier work this paper cites.
C. Villani, Topics in Optimal Transportation , ser. Graduate studies in mathematics. American Mathematical Society, 2003
2003
Earlier work this paper cites.
I. Ekeland, “An optimal matching problem,” ESAIM: Control, Optimisation and Calculus of Variations , vol. 11, no. 1, pp. 57–71, 2005
2005
Earlier work this paper cites.
Y. Nesterov, “Smooth minimization of non-smooth functions,” Mathematical Programming , vol. 103, no. 1, pp. 127–152, 2005
2005
Earlier work this paper cites.
2012
Earlier work this paper cites.
L. Ambrosio and N. Gigli, “A user’s guide to optimal transport,” in Modelling and optimisation of flows on networks . Springer, 2013
2013
Earlier work this paper cites.
M. Cuturi, “Sinkhorn distances: Lightspeed computation of optimal transport,” in Advances in Neural Information Processing Systems 26 , 2013, pp. 2292–2300
2013
Earlier work this paper cites.
Y. T. Lee and A. Sidford, “Path finding methods for linear programming: Solving linear programs in O ~ ( rank ) \tilde{O}(\sqrt{\text{rank}}) iterations and faster algorithms for maximum flow,” FOCS 2014 , pp. 424–433, 2014
2014
Cited alongside, same era.
A. Gramfort, G. Peyré, and M. Cuturi, “Fast optimal transport averaging of neuroimaging data,” in International Conference on Information Processing in Medical Imaging . Springer, 2015, pp. 261–272
2015
Cited alongside, same era.
B. Pass, “Multi-marginal optimal transport: theory and applications,” Math. Model. & Num. Analys. , vol. 49, no. 6, pp. 1771–1790, 2015
2015
Cited alongside, same era.
J.-D. Benamou, G. Carlier, M. Cuturi, L. Nenna, and G. Peyré, “Iterative bregman projections for regularized transportation problems,” SIAM Journal on Scientific Computing , vol. 37, no. 2, pp. A1111–A1138, 2015
2015
Cited alongside, same era.
C. A. Uribe, D. Dvinskikh, P. Dvurechensky, A. Gasnikov, and A. Nedić, “Distributed computation of Wasserstein barycenters over networks,” in IEEE Conference on Decision and Control , 2018, pp. 6544–6549
2018
Later among the works it cites.
2019
Later among the works it cites.
A. Kroshnin, N. Tupitsa, D. Dvinskikh, P. Dvurechensky, A. Gasnikov, and C. Uribe, “On the complexity of approximating Wasserstein barycenters,” in Proceedings of the 36th International Conference on Machine Learning , vol. 97, 2019, pp. 3530–3540
2019
Later among the works it cites.
T. Lin, N. Ho, and M. Jordan, “On efficient optimal transport: An analysis of greedy and accelerated mirror descent algorithms,” in Proceedings of the 36th International Conference on Machine Learning , vol. 97, 2019, pp. 3982–3991
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. Chen, T. T. Georgiou, and M. Pavon, “Optimal transport over a linear dynamical system,” IEEE Transactions on Automatic Control , vol. 62, no. 5, pp. 2137–2152, 2016
2016
Cited alongside, same era.
P. Dvurechensky, A. Gasnikov, E. Gasnikova, S. Matsievsky, A. Rodomanov, and I. Usik, “Primal-dual method for searching equilibrium in hierarchical congestion population games,” in Supplementary Proceedings of Conference on Discrete Optimization and Operations Research (DOOR 2016) , 2016, pp. 584–595
2016
Cited alongside, same era.
M. Arjovsky, S. Chintala, and L. Bottou, “Wasserstein gan,” arXiv:1701.07875 , 2017
2017
Cited alongside, same era.
I. Abraham, R. Abraham, M. Bergounioux, and G. Carlier, “Tomographic reconstruction from a few views: a multi-marginal optimal transport approach,” Appl. Math. & Opt. , vol. 75, no. 1, pp. 55–73, 2017
2017
Cited alongside, same era.
S. Asoodeh, T. Gao, and J. Evans, “Curvature of hypergraphs via multi-marginal optimal transport,” in CDC 2018 , 2018, pp. 1180–1185
2018
Cited alongside, same era.
P. Dvurechensky, A. Gasnikov, and A. Kroshnin, “Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn’s algorithm,” in Proceedings of the 35th International Conference on Machine Learning , vol. 80, 2018, pp. 1367–1376
2018
Cited alongside, same era.
P. Dvurechensky, D. Dvinskikh, A. Gasnikov, C. A. Uribe, and A. Nedić, “Decentralize and randomize: Faster algorithm for Wasserstein barycenters,” in Advances in Neural Information Processing Systems 31 , 2018, pp. 10 783–10 793
2018
Cited alongside, same era.
A. Jambulapati, A. Sidford, and K. Tian, “A direct O ( 1 / ε ) {O}(1/\varepsilon) iteration parallel algorithm for optimal transport,” in NeurIPS 2019 , 2019, pp. 11 359–11 370
2019
Later among the works it cites.
J. Cao, L. Mo, Y. Zhang, K. Jia, C. Shen, and M. Tan, “Multi-marginal wasserstein gan,” in NeurIPS , 2019, pp. 1774–1784
2019
Later among the works it cites.
S. V. Guminov, Y. E. Nesterov, P. E. Dvurechensky, and A. V. Gasnikov, “Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems,” Doklady Mathematics , vol. 99, no. 2, pp. 125–128, 2019
2019
Later among the works it cites.
2020
Closest in time.
P. Dvurechensky, A. Gasnikov, S. Omelchenko, and A. Tiurin, “A stable alternative to Sinkhorn’s algorithm for regularized optimal transport,” in Mathematical Optimization Theory and Operations Research , A. Kononov, M. Khachay, V. A. Kalyagin, and P. Pardalos, Eds. Cham: Springer International Publishing, 2020, pp. 406–423
2020
Closest in time.
Y. Nesterov, A. Gasnikov, S. Guminov, and P. Dvurechensky, “Primal-dual accelerated gradient methods with small-dimensional relaxation oracle,” Optimization Methods and Software , 2020. [Online]. Available: https://doi.org/10.1080/10556788.2020.1731747
2020
Closest in time.