Fetching the paper…
Reading the bibliography…
Federated learning (FL) is a decentralized and privacy-preserving machine learning technique in which a group of clients collaborate with a server to learn a global model without sharing clients' data.
M. Mohri, G. Sivek, and A. T. Suresh, “Agnostic Federated Learning,”
1902
Earlier work this paper cites.
N. Guha, A. Talwalkar, and V. Smith, “One-Shot Federated Learning,”
1902
Earlier work this paper cites.
1902
Earlier work this paper cites.
1905
Earlier work this paper cites.
M. Khodak, M.-F. Balcan, and A. Talwalkar, “Adaptive Gradient-Based Meta-Learning Methods,”
1906
Earlier work this paper cites.
X. Li, K. Huang, W. Yang, S. Wang, and Z. Zhang, “On the Convergence of FedAvg on Non-IID Data,”
1907
Earlier work this paper cites.
1907
Earlier work this paper cites.
1908
Earlier work this paper cites.
1908
Earlier work this paper cites.
1909
Earlier work this paper cites.
1909
Earlier work this paper cites.
1909
Earlier work this paper cites.
A. Khaled, K. Mishchenko, and P. Richtárik, “First Analysis of Local GD on Heterogeneous Data,”
1909
Earlier work this paper cites.
1910
Earlier work this paper cites.
D. Li and J. Wang, “FedMD: Heterogenous Federated Learning via Model Distillation,”
1910
Earlier work this paper cites.
F. Haddadpour and M. Mahdavi, “On the Convergence of Local Descent Methods in Federated Learning,”
1910
Earlier work this paper cites.
X. Li, W. Yang, S. Wang, and Z. Zhang, “Communication-Efficient Local Decentralized SGD Methods,”
1910
Earlier work this paper cites.
K. Pillutla, S. M. Kakade, and Z. Harchaoui, “Robust Aggregation for Federated Learning,”
1912
Cited alongside, same era.
1912
Cited alongside, same era.
J.-J. Moreau, “Propriétés des applications ‘prox’,”
1963
Cited alongside, same era.
C. Lemaréchal and C. Sagastizábal, “Practical Aspects of the Moreau–Yosida Regularization: Theoretical Preliminaries,”
1997
Cited alongside, same era.
Y. Lecun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-Based Learning Applied to Document Recognition,”
1998
Cited alongside, same era.
V. Smith, C.-K. Chiang, M. Sanjabi, and A. Talwalkar, “Federated Multi-Task Learning,”
2018
Later among the works it cites.
2018
Later among the works it cites.
A. Nichol, J. Achiam, and J. Schulman, “On First-Order Meta-Learning Algorithms,”
2018
Later among the works it cites.
F. Chen, Z. Dong, Z. Li, and X. He, “Federated Meta-Learning for Recommendation,” Feb. 2018
2018
Later among the works it cites.
2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2002
Cited alongside, same era.
F. Hanzely and P. Richtárik, “Federated Learning of a Mixture of Global and Local Models,”
2002
Cited alongside, same era.
2002
Cited alongside, same era.
Y. Deng, M. M. Kamani, and M. Mahdavi, “Adaptive Personalized Federated Learning,”
2003
Cited alongside, same era.
J. C. Duchi, M. I. Jordan, and M. J. Wainwright, “Privacy Aware Learning,”
2014
Cited alongside, same era.
S. Bubeck, “Convex Optimization: Algorithms and Complexity,”
2015
Cited alongside, same era.
Later among the works it cites.
Y. Nesterov,
2018
Later among the works it cites.
2018
Later among the works it cites.
2019
Later among the works it cites.
S. U. Stich, “Local SGD Converges Fast and Communicates Little,”
2019
Later among the works it cites.
P. Kairouz
2019
Later among the works it cites.
P. Zhou, X. Yuan, H. Xu, S. Yan, and J. Feng, “Efficient Meta Learning via Minibatch Proximal Update,” in
2019
Later among the works it cites.
L. Nguyen
2019
Later among the works it cites.
A. Paszke
2019
Later among the works it cites.
T. Lin, S. U. Stich, K. K. Patel, and M. Jaggi, “Don’t Use Large Mini-Batches, Use Local SGD,”
2020
Closest in time.
Z. Li, V. Sharma, and S. P. Mohanty, “Preserving Data Privacy via Federated Learning: Challenges and Solutions,”
2020
Closest in time.
T. Hoheisel, M. Laborde, A. Oberman, and ,Department of Mathematics and Statistics, McGill University, Montreal, Canada, “A regularization interpretation of the proximal point method for weakly convex functions,”
2020
Closest in time.