{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T02:47:53Z","timestamp":1773802073243,"version":"3.50.1"},"reference-count":47,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/cdc.2018.8619160","type":"proceedings-article","created":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T05:12:50Z","timestamp":1548306770000},"page":"6544-6549","source":"Crossref","is-referenced-by-count":25,"title":["Distributed Computation of Wasserstein Barycenters Over Networks"],"prefix":"10.1109","author":[{"given":"Cesar A.","family":"Uribe","sequence":"first","affiliation":[]},{"given":"Darina","family":"Dvinskikh","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Dvurechensky","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[]},{"given":"Angelia","family":"Nedic","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"584","article-title":"Primal-dual method for searching equilibrium in hierarchical congestion population games","author":"dvurechensky","year":"2016","journal-title":"Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016) Vladivostok"},{"key":"ref38","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate $\\mathcal{O}(1\/k^{2})$","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Mathematics Doklady"},{"key":"ref33","article-title":"A dual approach for optimal algorithms in distributed optimization over networks","author":"uribe","year":"2018"},{"key":"ref32","article-title":"Optimal algorithms for distributed optimization","author":"uribe","year":"2017"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542516040084"},{"key":"ref30","article-title":"Adaptive similar triangles method: a stable alternative to Sinkhorn's algorithm for regularized optimal transport","author":"dvurechensky","year":"2017"},{"key":"ref37","article-title":"Linear coupling: An ultimate unification of gradient and mirror descent","author":"allen-zhu","year":"2014"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542517080048"},{"key":"ref35","article-title":"Regularization of barycenters in the wasserstein space","author":"bigot","year":"2016"},{"key":"ref34","first-page":"215","article-title":"Les éléments aléatoires de nature quelconque dans un espace distancié","volume":"10","author":"fr\u00e9chet","year":"1948","journal-title":"Ann Inst Poincar"},{"key":"ref10","article-title":"Smooth and sparse optimal transport","author":"blondel","year":"2017"},{"key":"ref40","first-page":"391","author":"chernov","year":"2016","journal-title":"Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints"},{"key":"ref11","article-title":"Large-scale optimal transport and mapping estimation","author":"seguy","year":"2017"},{"key":"ref12","article-title":"Stochastic optimization for large-scale optimal transport","author":"aude","year":"2016"},{"key":"ref13","volume":"338","author":"villani","year":"2008","journal-title":"Optimal Transport Old and New"},{"key":"ref14","article-title":"Computational optimal transport","author":"solomon","year":"2017","journal-title":"Mathematisches Forschungsinstitut Oberwolfach"},{"key":"ref15","article-title":"Computational optimal transport","author":"peyr\u00e9","year":"2018"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/100805741"},{"key":"ref17","first-page":"685","article-title":"Fast computation of wasserstein barycenters","author":"cuturi","year":"2014","journal-title":"International Conference on Machine Learning"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00780-013-0205-8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.85.062502"},{"key":"ref28","first-page":"2644","article-title":"Parallel streaming wasserstein barycenters","author":"staib","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref4","first-page":"2053","article-title":"Learning with a wasserstein loss","author":"frogner","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref27","article-title":"Consensus in the wasserstein metric space of probability measures","author":"bishop","year":"2014"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2018.01.009"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/2766963","article-title":"Convolutional wasserstein distances: Efficient optimal transportation on geometric domains","volume":"34","author":"solomon","year":"2015","journal-title":"ACM Transactions on Graphics (TOG)"},{"key":"ref29","first-page":"2292","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","author":"cuturi","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref5","first-page":"435","article-title":"Wasserstein barycenter and its application to texture mixing","author":"rabin","year":"2011","journal-title":"Int Conf Scale Space and Variational Methods in Computer Vision"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"8662","DOI":"10.3182\/20140824-6-ZA-1003.00341","article-title":"Distributed nonlinear consensus in the space of probability measures","volume":"47","author":"bishop","year":"2014","journal-title":"IFAC Proceedings Volumes"},{"key":"ref7","first-page":"912","article-title":"Wasp: Scalable bayes via barycenters of subset posteriors","author":"srivastava","year":"2015","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref2","first-page":"199","article-title":"On the translocation of masses","volume":"37","author":"kantorovich","year":"1942","journal-title":"Dokl Akad Nauk USSR (NS)"},{"key":"ref9","article-title":"Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn's algorithm","author":"dvurechensky","year":"0"},{"key":"ref1","first-page":"1781","article-title":"Mémoire sur la théorie des déblais et des remblais","author":"monge","year":"0","journal-title":"Histoire de l'Académie Royale des Sciences de Paris"},{"key":"ref46","article-title":"Decentralize and randomize: Faster algorithm for wasserstein barycenters","author":"dvurechensky","year":"2018"},{"key":"ref20","author":"lecun","year":"1998","journal-title":"The MNIST Database of Handwritten Digits"},{"key":"ref45","article-title":"Stochastic wasserstein barycenters","author":"claici","year":"2018"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/15M1032600"},{"key":"ref47","article-title":"Optimal distributed optimization on slowly time-varying graphs","author":"rogozin","year":"2018"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-016-0549-x"},{"key":"ref42","volume":"87","author":"nesterov","year":"2013","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref41","article-title":"On the duality of strong convexity and strong smoothness: Learning applications and matrix regularization","author":"kakade","year":"2009","journal-title":"Unpublished manuscript"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"5538","DOI":"10.1109\/TAC.2017.2690401","article-title":"Fast convergence rates for distributed non-bayesian learning","volume":"62","author":"nedi?","year":"2017","journal-title":"IEEE Transactions on Automatic Control"},{"key":"ref43","article-title":"Communication-efficient algorithms for decentralized and stochastic optimization","author":"lan","year":"2017"},{"key":"ref25","article-title":"Distributed learning for cooperative inference","author":"nedi?","year":"2017"}],"event":{"name":"2018 IEEE Conference on Decision and Control (CDC)","location":"Miami Beach, FL","start":{"date-parts":[[2018,12,17]]},"end":{"date-parts":[[2018,12,19]]}},"container-title":["2018 IEEE Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8592870\/8618647\/08619160.pdf?arnumber=8619160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T04:26:26Z","timestamp":1598243186000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8619160\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/cdc.2018.8619160","relation":{},"subject":[],"published":{"date-parts":[[2018,12]]}}}