A Discrete-Time Multi-Hop Consensus Protocol for Decentralized Federated Learning

نویسندگان

چکیده

This paper presents a Federated Learning (FL) algorithm that allows the decentralization of all FL solutions employ model-averaging procedure. The proposed proves to be capable attaining faster convergence rates and no performance loss against starting centralized implementation with reduced communication overhead compared existing consensus-based solutions. To this end, Multi-Hop consensus protocol, originally presented in scope dynamical system theory, leveraging on standard Lyapunov stability discussions, has been assure federation clients share same average model employing only information obtained from their m -step neighbours. Experimental results different topologies MNIST MedMNIST v2 datasets validate properties demonstrating drop, setting, about 1%.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Consensus Seeking Using Multi-Hop Relay Protocol

We consider the problem of average consensus seeking in networked multi-agent systems. Based on local information and a simple distributed algorithm, states of all agents automatically converge to the average value of the initial conditions, where the convergence speed is determined by the algebraic connectivity of the underlying communication network. In order to achieve an average consensus q...

متن کامل

Third-order Decentralized Safe Consensus Protocol for Inter-connected Heterogeneous Vehicular Platoons

In this paper, the stability analysis and control design of heterogeneous traffic flow is considered. It is assumed that the traffic flow consists of infinite number of cooperative non-identical vehicular platoons. Two different networks are investigated in stability analysis of heterogeneous traffic flow: 1) inter-platoon network which deals with the communication topology of lead vehicles and...

متن کامل

A Decentralized Online Sortition Protocol

We propose a new online sortition protocol which is decentralized. We argue that our protocol has safety, fairness, randomness, non-reputation and openness properties. Sortition is a process that makes random decision and it is used in competitions and lotteries to determine who is the winner. In the real world, sortition is simply done using a lottery machine and all the participa...

متن کامل

Federated Multi-Task Learning

Federated learning poses new statistical and systems challenges in training machinelearning models over distributed networks of devices. In this work, we show thatmulti-task learning is naturally suited to handle the statistical challenges of thissetting, and propose a novel systems-aware optimization method, MOCHA, that isrobust to practical systems issues. Our method and theor...

متن کامل

The Stellar Consensus Protocol - A federated model for Internet-level consensus

This paper introduces a new model for consensus called federated Byzantine agreement (FBA). FBA achieves robustness through quorum slices—individual trust decisions made by each node that together determine system-level quorums. Slices bind the system together much the way individual networks’ peering and transit decisions now unify the Internet. We also present the Stellar Consensus Protocol (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3299443