Hierarchical Split Federated Learning: Convergence Analysis and System Optimization

W. Dinkelbach, “On Nonlinear Fractional Programming,” Manage. Sci. , vol. 13, no. 7, pp. 492–498, Mar. 1967

1967

Earlier work this paper cites.

Y. Lecun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based Learning Applied to Document Recognition,” Proc. IEEE , vol. 86, no. 11, pp. 2278–2324, Nov. 1998

1998

Earlier work this paper cites.

R. G. Ródenas, M. L. López, and D. Verastegui, “Extensions of Dinkelbach’s Algorithm for Solving Non-linear Fractional Programming Problems,” Top , vol. 7, pp. 33–70, Jun. 1999

1999

Earlier work this paper cites.

P. Tseng, “Convergence of A Block Coordinate Descent Method for Nondifferentiable Minimization,” J Optim Theory Appl , vol. 109, pp. 475–494, Jun. 2001

2001

Earlier work this paper cites.

A. Krizhevsky, G. Hinton et al. , “Learning Multiple Layers of Features From Tiny Images,” Tech. Rep. , Apr. 2009

2009

Earlier work this paper cites.

Y. Zhang, M. J. Wainwright, and J. C. Duchi, “Communication-efficient Algorithms for Statistical Optimization,” in Proc. NIPS , Jun. 2012

2012

Earlier work this paper cites.

D. Yue and F. You, “A Reformulation-linearization Method for the Global Optimization of Large-scale Mixed-Integer Linear Fractional Programming Problems and Cyclic Scheduling aApplication,” in Proc. ACC , Jun. 2013

2013

Earlier work this paper cites.

Z. Li, C. Jin, T. Xu, C. Wilson, Y. Liu, L. Cheng, Y. Liu, Y. Dai, and Z.-L. Zhang, “Towards Network-level Efficiency for Cloud Storage Services,” in Proc. ACM Int. Meas. Conf. , Nov. 2014

2014

Earlier work this paper cites.

K. Simonyan and A. Zisserman, “Very Deep Convolutional Networks for Large-scale Image Recognition,” in Proc. ICLR , 2015

2015

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 Proc. AISTATS , Apr. 2017

2017

Earlier work this paper cites.

X. Lian, C. Zhang, H. Zhang, C.-J. Hsieh, W. Zhang, and J. Liu, “Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descent,” in Proc. NIPS , Jun. 2017

2017

Earlier work this paper cites.

H. Mania, X. Pan, D. Papailiopoulos, B. Recht, K. Ramchandran, and M. I. Jordan, “Perturbed Iterate Analysis for Asynchronous Stochastic Optimization,” SIAM J. Optim. , vol. 27, no. 4, pp. 2202–2229, Jan. 2017

2017

Earlier work this paper cites.

A. Hard, K. Rao, R. Mathews, S. Ramaswamy, F. Beaufays, S. Augenstein, H. Eichner, C. Kiddon, and D. Ramage, “Federated Learning for Mobile Keyboard Prediction,” arXiv preprint arXiv:1811.03604 , Nov. 2018

Original

2018

Earlier work this paper cites.

P. Vepakomma, O. Gupta, T. Swedish, and R. Raskar, “Split Learning for Health: Distributed Deep Learning without Sharing Raw Patient Data,” arXiv preprint arXiv:1812.00564 , Dec. 2018

Original

2018

Earlier work this paper cites.

Karimireddy, Sai Praneeth and Kale, Satyen and Mohri, Mehryar and Reddi, Sashank and Stich, Sebastian and Suresh, Ananda Theertha, “On the Convergence Properties of A K-step Averaging Stochastic Gradient Descent Algorithm for Nonconvex Optimization,” in Proc. IJCAI , Jul. 2018

2018

Earlier work this paper cites.

S. Wang, T. Tuor, T. Salonidis, K. K. Leung, C. Makaya, T. He, and K. Chan, “Adaptive Federated Learning in Resource Constrained Edge Computing Systems,” IEEE J. Sel. Areas Commun. , vol. 37, no. 6, pp. 1205–1221, Mar. 2019

2019

Earlier work this paper cites.

H. Yu and R. Jin, “On the Computation and Communication Complexity of Parallel SGD with Dynamic Batch Sizes for Stochastic Non-convex Optimization,” in Proc. ICML , Jun. 2019

2019

Earlier work this paper cites.

H. Yu, R. Jin, and S. Yang, “On the Linear Speedup Analysis of Communication Efficient Momentum SGD For Distributed Non-convex Optimization,” in Proc. ICML , Jun. 2019, pp. 7184–7193

2019

Earlier work this paper cites.

T. Lin, S. U. Stich, K. K. Patel, and M. Jaggi, “Don’t Use Large Mini-batches, Use Local SGD,” in Proc. ICLR , Dec. 2019

2019

Earlier work this paper cites.

Z. Geng, C. Wei, Y. Han, Q. Wei, and Z. Ouyang, “Pipeline Network Simulation Calculation based on Improved Newton Jacobian Iterative Method,” in Proc. AICS , Jul. 2019

2019

Cited alongside, same era.

G. Zhu, Y. Wang, and K. Huang, “Broadband analog aggregation for low-latency federated edge learning,” IEEE Trans. Wireless Commun. , vol. 19, no. 1, pp. 491–506, Oct. 2019

2019

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 Proc. ICLR , Apr. 2020

2020

Cited alongside, same era.

W. Shi, S. Zhou, Z. Niu, M. Jiang, and L. Geng, “Joint Device Scheduling and Resource Allocation for Latency Constrained Wireless Federated Learning,” IEEE Trans. Wireless Commun. , vol. 20, no. 1, pp. 453–467, Sep. 2020

2020

Cited alongside, same era.

P. Han, S. Wang, Y. Jiao, and J. Huang, “Federated Learning While Providing Model as a Service: Joint Training and Inference Optimization,” in Proc. INFOCOM , May. 2024

2024

Closest in time.

Z. Lin, Z. Chen, Z. Fang, X. Chen, X. Wang, and Y. Gao, “FedSN: A Federated Learning Framework over Heterogeneous LEO Satellite Networks,” IEEE Trans. Mobile Comput. , Oct. 2024

2024

Closest in time.

M. Hu, J. Zhang, X. Wang, S. Liu, and Z. Lin, “Accelerating Federated Learning with Model Segmentation for Edge Networks,” IEEE Trans. Green Commun. Netw. , Jul. 2024

2024

Closest in time.

X. Su, Y. Zhou, L. Cui, and S. Guo, “Expediting In-Network Federated Learning by Voting-Based Consensus Model Compression,” in Proc. INFOCOM , May. 2024

2024

Closest in time.

J. Yan, J. Liu, S. Wang, H. Xu, H. Liu, and J. Zhou, “Heroes: Lightweight Federated Learning with Neural Composition and Adaptive Local Update in Heterogeneous Edge Networks,” in Proc. INFOCOM , May. 2024