Graph Sparsification-Based Secure Federated Learning for Consumer-Driven Internet of Things

Abstract

Federated learning enables model training for the consumer-driven Internet of Things (IoT) in a distributed manner without violating individual privacy. Several secure aggregation protocols have been proposed for large-scale federated learning models in IoT scenarios. However, the communication and computational overheads grow quadratically with the number of clients, which becomes a significant obstacle to these secure aggregation protocols. To address this problem, some work utilizes deterministic graphs of logarithmic degrees, such as the Harary graph or Erdős-Rényi graph, instead of the complete communication graph. The graph generated under the given fixed conditions is unique and invariant throughout the federated learning process. In this paper, we propose SparsiFL, a graph sparsification-based secure aggregation protocol for federated learning, which significantly reduces communication and computational overhead while maintaining correctness and privacy. SparsiFL takes a complete graph as input and formulates the optimization problem as an uncertain graph sparsification task, which reduces the number of edges and redistributes the probabilities attached to them. In the process, SparsiFL also preserves the underlying structure. The graph can accurately and efficiently approximate the secure-sharing task in secure aggregation. Theoretical analysis shows correctness and privacy. Experiments show that SparsiFL reduces the communication and computational overheads up to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$6.10\times $ </tex-math></inline-formula> and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$3.16\times $ </tex-math></inline-formula> as compared to other related approaches.

Topics & Concepts