Federated learning (FL) is a machine learning setting where clients keep the training data decentralised and collaboratively train a model either under the coordination of a central server (centralised FL) or in a peer-to-peer network (decentralised FL). Correct orchestration is one of the main challenges. In this paper, we formally verify the correctness of two generic FL algorithms, a centralised and a decentralised one, using the CSP process calculus and the PAT model checker. The CSP models consist of CSP processes corresponding to generic FL algorithm instances. PAT automatically proves the correctness of the two generic FL algorithms by proving their deadlock freeness (safety property) and successful termination (liveness property). The CSP models are constructed bottom-up by hand as a faithful representation of the real Python code and is automatically checked top-down by PAT.
@article{arxiv.2306.14529,
title = {Correct orchestration of Federated Learning generic algorithms: formalisation and verification in CSP},
author = {Ivan Prokić and Silvia Ghilezan and Simona Kašterović and Miroslav Popovic and Marko Popovic and Ivan Kaštelan},
journal= {arXiv preprint arXiv:2306.14529},
year = {2023}
}
Comments
arXiv admin note: text overlap with arXiv:2305.20027