Amount Of Communication Resources Research Articles

FedOpt: Towards Communication Efficiency and Privacy Preservation in Federated Learning

Artificial Intelligence (AI) has been applied to solve various challenges of real-world problems in recent years. However, the emergence of new AI technologies has brought several problems, especially with regard to communication efficiency, security threats and privacy violations. Towards this end, Federated Learning (FL) has received widespread attention due to its ability to facilitate the collaborative training of local learning models without compromising the privacy of data. However, recent studies have shown that FL still consumes considerable amounts of communication resources. These communication resources are vital for updating the learning models. In addition, the privacy of data could still be compromised once sharing the parameters of the local learning models in order to update the global model. Towards this end, we propose a new approach, namely, Federated Optimisation (FedOpt) in order to promote communication efficiency and privacy preservation in FL. In order to implement FedOpt, we design a novel compression algorithm, namely, Sparse Compression Algorithm (SCA) for efficient communication, and then integrate the additively homomorphic encryption with differential privacy to prevent data from being leaked. Thus, the proposed FedOpt smoothly trade-offs communication efficiency and privacy preservation in order to adopt the learning task. The experimental results demonstrate that FedOpt outperforms the state-of-the-art FL approaches. In particular, we consider three different evaluation criteria; model accuracy, communication efficiency and computation overhead. Then, we compare the proposed FedOpt with the baseline configurations and the state-of-the-art approaches, i.e., Federated Averaging (FedAvg) and the paillier-encryption based privacy-preserving deep learning (PPDL) on all these three evaluation criteria. The experimental results show that FedOpt is able to converge within fewer training epochs and a smaller privacy budget.

Speeding-up information retrieval with the employment of a multi-agent system

This paper focuses on Mobile Agents (MAs) and their use for information retrieval. A multi-agent system is considered; a number of agents are involved in a cooperative effort to retrieve distributed data from network nodes. Our objective is to find the routes of the agents so that the total completion time is minimised. The system design goal of producing an 'optimal' answer with minimal use of communication and processing resources is the driving reason for testing three heuristic algorithms. Our endmost goal is to achieve an 'acceptable' answer using a 'reasonable' amount of communication resources.