ISBN: 9783031966484 - federated edge learning: algorithms, architectures and trustworthiness (wireless networks) (6 Ergebnisse)

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book presents various effective schemes from the perspectives of algorithms, architectures, privacy, and security to enable scalable and trustworthy Federated Edge Learning (FEEL). From the algorithmic perspective, the authors elaborate various federated optimization algorithms, including zeroth-order, first-order, and second-order methods. There is a specific emphasis on presenting provable convergence analysis to illustrate the impact of learning and wireless communication parameters. The convergence rate, computation complexity and communication overhead of the federated zeroth/first/second-order algorithms over wireless networks are elaborated.From the networking architecture perspective, the authors illustrate how the critical challenges of FEEL can be addressed by exploiting different architectures and designing effective communication schemes. Specifically, the communication straggler issue of FEEL can be mitigated by utilizing reconfigurable intelligent surface and unmanned aerial vehicle to reconfigure the propagation environment, while over-the-air computation is utilized to support ultra-fast model aggregation for FEEL by exploiting the waveform superposition property. Additionally, the multi-cell architecture presents a feasible solution for collaborative FEEL training among multiple cells. Finally, the authors discuss the challenges of FEEL from the privacy and security perspective, followed by presenting effective communication schemes that can achieve differentially private model aggregation and Byzantine-resilient model aggregation to achieve trustworthy FEEL.This book is designed for researchers and professionals whose focus is wireless communications. Advanced-level students majoring in computer science and electrical engineering will also find this book useful as a reference.…

Hardcover. Zustand: Brand New. 200 pages. 9.25x6.10x9.21 inches. In Stock.

Gebundene Ausgabe. Zustand: Neu. This book presents various effective schemes from the perspectives of algorithms, architectures, privacy, and security to enable scalable and trustworthy Federated Edge Learning (FEEL). From the algorithmic perspective, the authors elaborate various federated optimization algorithms, including zeroth-order, first-order, and second-order methods. There is a specific emphasis on presenting provable convergence analysis to illustrate the impact of learning and wireless communication parameters. The convergence rate, computation complexity and communication overhead of the federated zeroth/first/second-order algorithms over wireless networks are elaborated.From the networking architecture perspective, the authors illustrate how the critical challenges of FEEL can be addressed by exploiting different architectures and designing effective communication schemes. Specifically, the communication straggler issue of FEEL can be mitigated by utilizing reconfigurable intelligent surface and unmanned aerial vehicle to reconfigure the propagation environment, while over-the-air computation is utilized to support ultra-fast model aggregation for FEEL by exploiting the waveform superposition property. Additionally, the multi-cell architecture presents a feasible solution for collaborative FEEL training among multiple cells. Finally, the authors discuss the challenges of FEEL from the privacy and security perspective, followed by presenting effective communication schemes that can achieve differentially private model aggregation and Byzantine-resilient model aggregation to achieve trustworthy FEEL. This book is designed for researchers and professionals whose focus is wireless communications. Advanced-level students majoring in computer science and electrical engineering will also find this book useful as a reference. Sprache: Englisch Gewicht in Gramm: 431.…