Fetching the paper…
Reading the bibliography…
We propose an efficient federated dual decomposition algorithm for calculating the Wasserstein barycenter of several distributions, including choosing the support of the solution.
L-shaped linear programs with applications to optimal control and stochastic programming
R. M. Van Slyke and R. Wets · 1969
Earlier work this paper cites.
A regularized decomposition method for minimizing a sum of polyhedral functions
A. Ruszczyński · 1986
Earlier work this paper cites.
A multicut algorithm for two-stage stochastic linear programs
J. R. Birge and F. V. Louveaux · 1988
Earlier work this paper cites.
Scenarios and policy aggregation in optimization under uncertainty
R. T. Rockafellar and R. J.-B. Wets · 1991
Earlier work this paper cites.
A new scenario decomposition method for large-scale stochastic optimization
J. M. Mulvey and A. Ruszczyński · 1995
Earlier work this paper cites.
Ergodic, primal convergence in dual subgradient schemes for convex programming
T. Larsson, M. Patriksson, and A.-B. Strömberg · 1999
Earlier work this paper cites.
The earth mover’s distance as a metric for image retrieval
Y. Rubner, C. Tomasi, and L. J. Guibas · 2000
Earlier work this paper cites.
Stochastic Programming, Handbooks in OR and MS
A. Ruszczyński and A. Shapiro · 2003
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
M. Zinkevich · 2003
Earlier work this paper cites.
Fast and robust earth mover’s distances
O. Pele and M. Werman · 2009
Earlier work this paper cites.
Optimal Transport: Old and New
C. Villani · 2009
Earlier work this paper cites.
Barycenters in the Wasserstein space
M. Agueh and G. Carlier · 2011
Earlier work this paper cites.
Sinkhorn distances: Lightspeed computation of optimal transport
M. Cuturi · 2013
Earlier work this paper cites.
Constructive quantization: Approximation by empirical measures
S. Dereich, M. Scheutzow, and R. Schottstedt · 2013
Earlier work this paper cites.
Fast computation of Wasserstein barycenters
M. Cuturi and A. Doucet · 2014
Earlier work this paper cites.
Wasserstein propagation for semi-supervised learning
J. Solomon, R. Rustamov, L. Guibas, and A. Butscher · 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.
On the rate of convergence in Wasserstein distance of the empirical measure
N. Fournier and A. Guillin · 2015
Earlier work this paper cites.
A fixed-point approach to barycenters in Wasserstein space
P. C. Álvarez-Esteban, E. Del Barrio, J. Cuesta-Albertos, and C. Matrán · 2016
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.
Federated optimization: Distributed machine learning for on-device intelligence
J. Konečný, H. B. McMahan, D. Ramage, and P. Richtárik · 2016
Cited alongside, same era.
Communication-efficient learning of deep networks from decentralized data
H. B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y. Arcas · 2016
Cited alongside, same era.
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
J. Altschuler, J. Niles-Weed, and P. Rigollet · 2017
Fair regression with wasserstein barycenters
E. Chzhen, C. Denis, M. Hebiri, L. Oneto, and M. Pontil · 2020
Later among the works it cites.
A Wasserstein-type distance in the space of Gaussian mixture models
J. Delon and A. Desolneux · 2020
Later among the works it cites.
Projection to fairness in statistical learning
T. L. Gouic, J.-M. Loubes, and P. Rigollet · 2020
Later among the works it cites.
Federated learning: Challenges, methods, and future directions
T. Li, A. K. Sahu, A. Talwalkar, and V. Smith · 2020
Later among the works it cites.
Computational hardness and fast algorithm for fixed-support Wasserstein barycenter
T. Lin, N. Ho, X. Chen, M. Cuturi, and M. I. Jordan · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
M. Arjovsky, S. Chintala, and L. Bottou · 2017
Cited alongside, same era.
Multilevel clustering via Wasserstein means, 2017
N. Ho, X. Nguyen, M. Yurochkin, H. H. Bui, V. Huynh, and D. Phung · 2017
Cited alongside, same era.
Federated multi-task learning
V. Smith, C.-K. Chiang, M. Sanjabi, and A. Talwalkar · 2017
Cited alongside, same era.
Semidual regularized optimal transport
M. Cuturi and G. Peyré · 2018
Cited alongside, same era.
Decentralize and randomize: Faster algorithm for wasserstein barycenters
P. Dvurechenskii, D. Dvinskikh, A. Gasnikov, C. Uribe, and A. Nedich · 2018
Cited alongside, same era.
Decentralize and randomize: Faster algorithm for Wasserstein barycenters
P. Dvurechensky, D. Dvinskikh, A. Gasnikov, C. Uribe, and A. Nedich · 2018
Cited alongside, same era.
An improved analysis of stochastic gradient descent with momentum
Y. Liu, Y. Gao, and W. Yin · 2020
Later among the works it cites.
A fast proximal point method for computing exact Wasserstein distance
Y. Xie, X. Wang, R. Wang, and H. Zha · 2020
Later among the works it cites.
Lectures on Stochastic Programming: Modeling and Theory
A. Shapiro, D. Dentcheva, and A. Ruszczyński · 2021
Later among the works it cites.
A field guide to federated optimization
J. Wang, Z. Charles, Z. Xu, G. Joshi, H. B. McMahan, B. A. y. Arcas, M. Al-Shedivat, G. Andrew, S. Avestimehr, K. Daly, D. Data, S. Diggavi, H. Eichner, A. Gadhikar, Z. Garrett, A. M. Girgis, F. Hanzely, A. Hard, C. He, S. Horvath, Z. Huo, A. Ingerman, M. Jaggi, T. Javidi, P. Kairouz, S. Kale, S. P. Karimireddy, J. Konecny, S. Koyejo, T. Li, L. Liu, M. Mohri, H. Qi, S. J. Reddi, P. Richtarik, K. Singhal, V. Smith, M. Soltanolkotabi, W. Song, A. T. Suresh, S. U. Stich, A. Talwalkar, H. Wang, B. Woodworth, S. Wu, F. X. Yu, H. Yuan, M. Zaheer, M. Zhang, T. Zhang, C. Zheng, C. Zhu, and W. Zhu · 2021
Later among the works it cites.
Applications of weak transport theory
J. Backhoff-Veraguas and G. Pammer · 2022
Later among the works it cites.
The sketched Wasserstein distance for mixture distributions, 2022
X. Bing, F. Bunea, and J. Niles-Weed · 2022
Later among the works it cites.
Randomized wasserstein barycenter computation: Resampling with statistical guarantees
F. Heinemann, A. Munk, and Y. Zemel · 2022
Later among the works it cites.
Mitigating discrimination in insurance with wasserstein barycenters
A. Charpentier, F. Hu, and P. Ratz · 2023
Later among the works it cites.
Handbook of convergence theorems for (stochastic) gradient methods, 2023
G. Garrigos and R. M. Gower · 2023
Later among the works it cites.
Fair learning with Wasserstein barycenters for non-decomposable performance measures
S. Gaucher, N. Schreuder, and E. Chzhen · 2023
Later among the works it cites.
An integrated transportation distance between kernels and approximate dynamic risk evaluation in Markov systems
Z. Lin and A. Ruszczyński · 2023
Later among the works it cites.
Neural optimal transport at scale: Wasserstein barycenters for fair insurance
G. V. Carassai · 2024
Later among the works it cites.