Abstract

Federated learning (FL) is an effective approach to exploiting different data sources for collaborative model training while maintaining the privacy of users. Adequate data is necessary to improve the accuracy of the federated learning. However, it is difficult for all data sources to acquire sufficient data for each iteration of federated training. In this paper, we study the data acquisition problem in cloud–edge networks, where edges acquire data from users and conduct the local training while the cloud aggregates the local models. Since data acquired by users with uncertainty, it is not easy to make the data acquisition decision for the FL online. Even worse, due to the unknown cost of data, it is difficult to make a macro-timescale decision. We propose a two-timescale online scheduling for federated learning to confront the uncertainty of the data acquisition. By learning empirical state information of the system with a carefully designed Lyapunov virtual queue and coordinating the data acquisition in different timescales in an online manner, the proposed approach minimizes the data acquisition cost of federated learning, reduces the data transmission delay and accelerates the convergence speed of federated learning. Rigorous theoretical analysis shows strong performance guarantees of the proposed two-timescale Lyapunov optimization algorithm and extensive trace-driven experimental results suggests that the algorithm achieves outstanding performance gains over existing benchmarks.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.