Fetching the paper…
Reading the bibliography…
There is an increasing interest in a fast-growing machine learning technique called Federated Learning, in which the model training is distributed over mobile user equipments (UEs), exploiting UEs' local computation and training data.
T. D. Burd and R. W. Brodersen, “Processor Design for Portable Systems,” Journal of VLSI Signal Processing System , vol. 13, no. 2-3, pp. 203–221, Aug. 1996
1996
Earlier work this paper cites.
Y. Lecun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proceedings of the IEEE , vol. 86, no. 11, pp. 2278–2324, Nov./1998
1998
Earlier work this paper cites.
B. Prabhakar, E. U. Biyikoglu, and A. E. Gamal, “Energy-efficient transmission over a wireless link via lazy packet scheduling,” in IEEE INFOCOM 2001 , vol. 1, 2001, pp. 386–394
2001
Earlier work this paper cites.
S. Boyd and L. Vandenberghe, Convex Optimization . Cambridge University Press, Mar. 2004
2004
Earlier work this paper cites.
A. Wächter and L. T. Biegler, “On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming,” Mathematical Programming , vol. 106, no. 1, pp. 25–57, Mar. 2006
2006
Earlier work this paper cites.
A. P. Miettinen and J. K. Nurminen, “Energy Efficiency of Mobile Clients in Cloud Computing,” in USENIX HotCloud’10 , Berkeley, CA, USA, 2010, pp. 4–4
2010
Earlier work this paper cites.
O. Shamir, N. Srebro, and T. Zhang, “Communication-efficient Distributed Optimization Using an Approximate Newton-type Method,” in ICML , Beijing, China, 2014, pp. II–1000–II–1008
2014
Earlier work this paper cites.
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
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 , Apr. 2017, pp. 1273–1282
2017
Earlier work this paper cites.
C. Ma et al. , “Distributed optimization with arbitrary local solvers,” Optimization Methods and Software , vol. 32, no. 4, pp. 813–848, Jul. 2017
2017
Earlier work this paper cites.
V. Smith, C.-K. Chiang, M. Sanjabi, and A. Talwalkar, “Federated Multi-task Learning,” in NeurIPS’17 , CA, U.S., 2017, pp. 4427–4437
2017
Cited alongside, same era.
H. Zhang et al. , “ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning,” in International Conference on Machine Learning , Jul. 2017, pp. 4035–4043
2017
Cited alongside, same era.
G. Scutari, F. Facchinei, and L. Lampariello, “Parallel and Distributed Methods for Constrained Nonconvex Optimization—: ,” IEEE Transactions on Signal Processing , vol. 65, no. 8, pp. 1929–1944, Apr. 2017
2017
Cited alongside, same era.
G. Cohen, S. Afshar, J. Tapson, and A. van Schaik, “EMNIST: Extending MNIST to handwritten letters,” in 2017 International Joint Conference on Neural Networks (IJCNN) , May 2017, pp. 2921–2926
2017
Cited alongside, same era.
S. Wang et al. , “Adaptive Federated Learning in Resource Constrained Edge Computing Systems,” IEEE Journal on Selected Areas in Communications , vol. 37, no. 6, pp. 1205–1221, Jun. 2019
2019
Closest in time.
T. Li et al. , “Federated Optimization for Heterogeneous Networks,” in Proceedings of the 1st Adaptive & Multitask Learning, ICML Workshop, 2019 , Long Beach, CA, 2019, p. 16
2019
Closest in time.
2019
Closest in time.
S. U. Stich, “Local SGD Converges Fast and Communicates Little,” In ICLR 2019 International Conference on Learning Representations , 2019
2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
V. Smith et al. , “CoCoA: A General Framework for Communication-Efficient Distributed Optimization,” Journal of Machine Learning Research , vol. 18, no. 230, pp. 1–49, 2018
2018
Cited alongside, same era.
F. Zhou and G. Cong, “On the Convergence Properties of a K-step Averaging Stochastic Gradient Descent Algorithm for Nonconvex Optimization,” in Proceedings of the 27th International Joint Conference on Artificial Intelligence , Stockholm, Sweden, Jul. 2018, pp. 3219–3227
2018
Cited alongside, same era.
H. Tang, S. Gan, C. Zhang, T. Zhang, and J. Liu, “Communication Compression for Decentralized Training,” in NeurIPS , 2018, pp. 7663–7673
2018
Cited alongside, same era.
H. Wang et al. , “ATOMO: Communication-efficient Learning via Atomic Sparsification,” in NeurIPS , 2018, pp. 9850–9861
2018
Cited alongside, same era.
Y. Nesterov, Lectures on Convex Optimization . Springer International Publishing, 2018, vol. 137
2018
Cited alongside, same era.
2018
Cited alongside, same era.
N. H. Tran, W. Bao, A. Zomaya, M. N. Nguyen, and C. S. Hong, “Federated Learning over Wireless Networks: Optimization Model Design and Analysis,” in IEEE INFOCOM 2019 , Paris, France, Apr. 2019
2019
Cited alongside, same era.
2019
Closest in time.
2019
Closest in time.
C. T. Dinh et al. , “Federated Learning with Proximal Stochastic Variance Reduced Gradient Algorithms,” in 49th International Conference on Parallel Processing - ICPP , Edmonton Canada, Aug. 2020, pp. 1–11
2020
Closest in time.
T. T. Vu et al. , “Cell-Free Massive MIMO for Wireless Federated Learning,” IEEE Transactions on Wireless Communications , vol. 19, no. 10, pp. 6377–6392, Oct. 2020
2020
Closest in time.
L. U. Khan et al. , “Federated Learning for Edge Networks: Resource Optimization and Incentive Mechanism,” IEEE Communication Magazine, 2020 , Sep. 2020
2020
Closest in time.
S. R. Pandey et al. , “A Crowdsourcing Framework for On-Device Federated Learning,” IEEE Transactions on Wireless Communications , vol. 19, no. 5, pp. 3241–3256, May 2020
2020
Closest in time.