Fetching the paper…
Reading the bibliography…
Federated learning is a framework for distributed optimization that places emphasis on communication efficiency.
D. W. Peaceman and H. H. Rachford, Jr, “The numerical solution of parabolic and elliptic differential equations,” Journal of the Society for industrial and Applied Mathematics , vol. 3, no. 1, pp. 28–41, 1955
1955
Earlier work this paper cites.
J. Douglas and H. H. Rachford, “On the numerical solution of heat conduction problems in two and three space variables,” Transactions of the American mathematical Society , vol. 82, no. 2, pp. 421–439, 1956
1956
Earlier work this paper cites.
D. Gabay and B. Mercier, “A dual algorithm for the solution of nonlinear variational problems via finite element approximation,” Computers & mathematics with applications , vol. 2, no. 1, pp. 17–40, 1976
1976
Earlier work this paper cites.
P.-L. Lions and B. Mercier, “Splitting algorithms for the sum of two nonlinear operators,” SIAM Journal on Numerical Analysis , vol. 16, no. 6, pp. 964–979, 1979
1979
Earlier work this paper cites.
D. Gabay, “Chapter ix applications of the method of multipliers to variational inequalities,” in Studies in mathematics and its applications . Elsevier, 1983, vol. 15, pp. 299–331
1983
Earlier work this paper cites.
J. Eckstein, “Splitting methods for monotone operators with applications to parallel optimization,” Ph.D. dissertation, Massachusetts Institute of Technology, 1989
1989
Earlier work this paper cites.
M. Fukushima, “Application of the alternating direction method of multipliers to separable convex programming problems,” Computational Optimization and Applications , vol. 1, no. 1, pp. 93–111, 1992
1992
Earlier work this paper cites.
S. Boyd, N. Parikh, E. Chu, B. Peleato, J. Eckstein et al. , “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Foundations and Trends® in Machine learning , vol. 3, no. 1, pp. 1–122, 2011
2011
Earlier work this paper cites.
N. Parikh and S. Boyd, “Proximal algorithms,” Foundations and Trends in optimization , vol. 1, no. 3, pp. 127–239, 2014
2014
Earlier work this paper cites.
O. Shamir, N. Srebro, and T. Zhang, “Communication-efficient distributed optimization using an approximate newton-type method,” in International conference on machine learning . PMLR, 2014, pp. 1000–1008
2014
Earlier work this paper cites.
G. Li and T. K. Pong, “Global convergence of splitting methods for nonconvex composite optimization,” SIAM Journal on Optimization , vol. 25, no. 4, pp. 2434–2460, 2015
2015
Earlier work this paper cites.
P. Giselsson and S. Boyd, “Linear convergence and metric selection for Douglas-Rachford splitting and ADMM,” IEEE Transactions on Automatic Control , vol. 62, no. 2, pp. 532–544, 2016
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
——, “Douglas–Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems,” Mathematical programming , vol. 159, no. 1, pp. 371–401, 2016
2016
Earlier work this paper cites.
P. Richtárik and M. Takáč, “Parallel coordinate descent methods for big data optimization,” Mathematical Programming , vol. 156, no. 1, pp. 433–484, 2016
2016
Cited alongside, same era.
M. Yan and W. Yin, “Self equivalence of the alternating direction method of multipliers,” in Splitting Methods in Communication, Imaging, Science, and Engineering . Springer, 2016, pp. 165–194
2016
Cited alongside, same era.
B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, “Communication-efficient learning of deep networks from decentralized data,” in Artificial intelligence and statistics . PMLR, 2017, pp. 1273–1282
2017
Cited alongside, same era.
2018
Cited alongside, same era.
S. P. Karimireddy, S. Kale, M. Mohri, S. Reddi, S. Stich, and A. T. Suresh, “Scaffold: Stochastic controlled averaging for federated learning,” in International Conference on Machine Learning . PMLR, 2020, pp. 5132–5143
2020
Later among the works it cites.
R. Pathak and M. J. Wainwright, “FedSplit: An algorithmic framework for fast federated optimization,” Advances in Neural Information Processing Systems , vol. 33, pp. 7057–7066, 2020
2020
Later among the works it cites.
A. Themelis and P. Patrinos, “Douglas–Rachford splitting and ADMM for nonconvex optimization: Tight convergence results,” SIAM Journal on Optimization , vol. 30, no. 1, pp. 149–181, 2020
2020
Later among the works it cites.
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2019
Cited alongside, same era.
2019
Cited alongside, same era.
X. Li and F. Orabona, “On the convergence of stochastic gradient descent with adaptive stepsizes,” in The 22nd International Conference on Artificial Intelligence and Statistics . PMLR, 2019, pp. 983–992
2019
Cited alongside, same era.
M. Mohri, G. Sivek, and A. T. Suresh, “Agnostic federated learning,” in International Conference on Machine Learning . PMLR, 2019, pp. 4615–4625
2019
Cited alongside, same era.
2021
Later among the works it cites.
P. Kairouz, H. B. McMahan, B. Avent, A. Bellet, M. Bennis, A. N. Bhagoji, K. Bonawitz, Z. Charles, G. Cormode, R. Cummings et al. , “Advances and open problems in federated learning,” Foundations and Trends® in Machine Learning , vol. 14, no. 1–2, pp. 1–210, 2021
2021
Later among the works it cites.
A. Mitra, R. Jaafar, G. Pappas, and H. Hassani, “Linear Convergence in Federated Learning: Tackling Client Heterogeneity and Sparse Gradients,” Advances in Neural Information Processing Systems , vol. 34, 2021
2021
Later among the works it cites.
Q. Tran Dinh, N. Pham, D. Phan, and L. Nguyen, “FedDR–randomized Douglas-Rachford splitting algorithms for nonconvex federated composite optimization,” Advances in Neural Information Processing Systems , vol. 34, 2021
2021
Later among the works it cites.
H. Yuan, M. Zaheer, and S. Reddi, “Federated composite optimization,” in International Conference on Machine Learning . PMLR, 2021, pp. 12 253–12 266
2021
Later among the works it cites.
X. Zhang and M. Hong, “On the Connection Between FedDyn and FedPD,” 2021
2021
Later among the works it cites.
X. Zhang, M. Hong, S. Dhople, W. Yin, and Y. Liu, “FedPD: A federated learning framework with adaptivity to non-iid data,” IEEE Transactions on Signal Processing , vol. 69, pp. 6055–6070, 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
A. Reisizadeh, A. Mokhtari, H. Hassani, A. Jadbabaie, and R. Pedarsani, “FedPAQ: A communication-efficient federated learning method with periodic averaging and quantization,” in International Conference on Artificial Intelligence and Statistics . PMLR, 2020, pp. 2021–2031
2031
Closest in time.