DecHW: Heterogeneous Decentralized Federated Learning Exploiting Second-Order Information
Adnan Ahmad, Chiara Boldrini, Lorenzo Valerio, Andrea Passarella, Marco Conti
TL;DR
This work tackles data and model initialization heterogeneity in Decentralized Federated Learning by introducing DecHW, a Hessian-based, parameter-wise aggregation method. By normalizing and accumulating the diagonal of the Hessian, DecHW assigns per-parameter weights to neighbor updates, enabling robust, topology-agnostic fusion without a central server. Empirical results on MNIST, Fashion-MNIST, and CIFAR-10 demonstrate faster convergence and higher accuracy than multiple baselines across varying non-IID data distributions, with a practical discussion on communication overhead. The approach offers a scalable, communication-efficient solution for decentralized learning in heterogeneous networks, with public code and clear advantages over existing KD or averaging-based methods.
Abstract
Decentralized Federated Learning (DFL) is a serverless collaborative machine learning paradigm where devices collaborate directly with neighbouring devices to exchange model information for learning a generalized model. However, variations in individual experiences and different levels of device interactions lead to data and model initialization heterogeneities across devices. Such heterogeneities leave variations in local model parameters across devices that leads to slower convergence. This paper tackles the data and model heterogeneity by explicitly addressing the parameter level varying evidential credence across local models. A novel aggregation approach is introduced that captures these parameter variations in local models and performs robust aggregation of neighbourhood local updates. Specifically, consensus weights are generated via approximation of second-order information of local models on their local datasets. These weights are utilized to scale neighbourhood updates before aggregating them into global neighbourhood representation. In extensive experiments with computer vision tasks, the proposed approach shows strong generalizability of local models at reduced communication costs.
