Fedrtid: an efficient shuffle federated learning via random participation and adaptive time constraint

Abstract Federated learning is a promising new distributed machine learning paradigm, where the client realizes secure and collaborative multi-user training of machine learning models by retaining private data and sharing model parameters with the server. However, with the frequent interaction of model parameters between the client and the server, the client will consume a large amount of network and arithmetic resources, and resource-constrained clients can hardly maintain model security while ensuring the efficiency of collaborative user training. Therefore, we propose FedRtid, a shuffle differential privacy federated learning scheme with random participation and adaptive time constraints, to improve the efficiency of collaborative user training while considering model privacy. First, in model training, the participating clients have the right to decide on random participation in training locally and independently, to alleviate the user’s resource constraints and reduce the time of user interaction to train the model, while adding differential noise to the shared model parameters to ensure model security. In addition, to avoid the global model security decline of server aggregation due to fewer clients participating in training, and the model accuracy decline caused by adding differential noise to all model parameters, we constructed user sparsification and adaptive time-constrained shuffle techniques to reduce the number of model parameters to which the user adds noise, and enhance the model security. Under two types of data distributions, independently and identically distributed and non-independently and identically distributed, we conduct a large number of experiments on three real datasets, and the results show that FedRtid can effectively balance the accuracy and privacy of the model.