Communication-Efficient Neural Tangent Kernels for Heterogeneous Decentralized Federated Learning
Not on the map. Why?
Abstract (arXiv)
Decentralized federated learning (DFL) enables collaborative model training without a central server, but converges slowly under statistical heterogeneity. Recent work has shown that neural tangent kernel (NTK) methods achieve faster convergence than gradient-based updates in DFL, while momentum has proven effective for accelerating gradient-based FL. However, applying momentum to NTK updates can destabilize training under heterogeneous data. We propose SPARK, which addresses this instability with a stage-wise annealed soft-label regularizer evaluated on neighborhood-aggregated data, so that momentum can accelerate NTK updates stably. Under high heterogeneity, SPARK converges about 3× faster than baselines and lowers the total communication to a target accuracy by up to about 70%, and it attains higher accuracy across heterogeneity levels. We further study random projection as an optional Jacobian-compression strategy for bandwidth-constrained settings. We validate the approach across multiple datasets, network topologies, and heterogeneity levels.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 25 of its 40 references that are in the map. First posted on arXiv 14 Dec 2025.
Builds on
25 of 40 references.
References · 25
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2019Advances and Open Problems in Federated Learningcited by 3,046
- 2018Federated Optimization in Heterogeneous Networkscited by 2,987
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,475
- 2019Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classificationcited by 851
- 2018LEAF: A Benchmark for Federated Settingscited by 792
- 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 502
- 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 478
- 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 370
13 more
- 2019PowerSGD: Practical Low-Rank Gradient Compression for Distributed Optimizationcited by 238
- 2021Decentralized Federated Averagingcited by 114
- 2023Decentralized Federated Learning: A Survey and Perspectivecited by 86
- 2022DisPFL: Towards Communication-Efficient Personalized Federated Learning via Decentralized Sparse Trainingcited by 74
- 2023Improving the Model Consistency of Decentralized Federated Learningcited by 45
- 2023Momentum Benefits Non-IID Federated Learning Simply and Provablycited by 38
- 2023A Survey on Decentralized Federated Learningcited by 27
- 2022TCT: Convexifying Federated Learning using Bootstrapped Neural Tangent Kernelscited by 26
- 2021Neural Tangent Kernel Empowered Federated Learningcited by 15
- 2023Surrogate Model Extension (SME): A Fast and Accurate Weight Update Attack on Federated Learningcited by 11
- 2023Dynamic Heterogeneous Federated Learning with Multi-Level Prototypescited by 7
- 2024NTK-DFL: Enhancing Decentralized Federated Learning in Heterogeneous Settings via Neural Tangent Kernelcited by 4
- 2025Trajectory-Aware Information Matching for Multi-Step Gradient Inversion in Federated Learningcited by 2
Built on by
Not cited yet.