Skip to content
Preprint

FedFFT: Taming Client Drift in Federated SAM via Spectral Perturbation Filtering

Jul 2026 · 0 citations · 46 references
Computer Science

TL;DR

Experimental evidence from a new perspective, the frequency domain, for SAM perturbations in federated settings is provided, revealing that inter-client perturbation inconsistencies are predominantly concentrated in the low-frequency spectrum.

Abstract

Federated Learning (FL) enables decentralized training without data sharing, but suffers from statistical heterogeneity across clients, leading to client drift, poor generalization, and sharp minima compared to centralized training. Sharpness-Aware Minimization (SAM) has emerged as a promising approach to improve generalization, yet its application in federated learning still suffers from divergence problems, since perturbations are computed locally and reflect client-specific loss geometries. To better understand this issue, we provide experimental evidence from a new perspective, the frequency domain, for SAM perturbations in federated settings, revealing that inter-client perturbation inconsistencies are predominantly concentrated in the low-frequency spectrum. Motivated by this insight, we propose Federated learning with Frequency-domain Filtering of SAM perturbations (FedFFT). It is a lightweight and plug-and-play method that filters out low-frequency components of SAM perturbations without requiring additional communication, thereby suppressing inconsistent components in client updates while preserving consistent learning signals. Extensive experiments across multiple benchmarks and diverse backbones demonstrate that FedFFT consistently outperforms SAM-based FL methods, particularly under severe non-IID distributions. These results highlight the effectiveness, scalability, and general applicability of our frequency-domain perspective for sharpness-aware federated optimization.

View source

Similar papers

Open access 2026

Federated Learning with Consistency Optimization Algorithms under Non-IID Data

This paper proposes Federated Learning with Consistency Optimization Algorithms (FedCO), a novel optimization framework that incorporates a label-skew-aware correction loss and neural feature distribution regularization during local training that significantly improves accuracy and convergence under diverse non-IID settings.

Ruiqi Wu, Yehong Li, Hongjie Guo et al. · 0 citations
2025

Rising from Ashes: Generalized Federated Learning via Dynamic Parameter Reset

A novel FL framework is presented, FedPhoenix, that stochastically re-sets partial parameters in each round to destroy some features of the global model, guiding FL training to learn multiple generalized features for inference rather than specific overfitting features.

Jiahao Wu, Ming Hu, Yanxin Yang et al. · 1 citation
#machine learning Preprint Jul 2026

SpecGradFilter: A Spectral Gradient Filtering Framework for Taming Federated Heterogeneity

This work revisits client drift from a novel frequency-domain perspective and uncovers a critical Spectral Bias of Drift: inter-client gradient divergence is predominantly concentrated in low-frequency components which encode client-specific distributional shifts, while high-frequency components representing fine-grained features remain relatively consistent.

Liyang Yuan, Yibo Yang, Dandan Guo et al. · 0 citations
Conference Aug 2026

URP-FL: Robust and Personalized Federated Learning under Heterogeneous and Adversarial Conditions

Federated learning is appealing for privacy-sensitive network systems, yet its practical deployment remains hindered by the following three recurring challenges: (1) client drift under non-IID data, (2) vulnerability to corrupted updates, and (3) the communication cost of repeated model exchange. Most existing approaches address these issues in isolation. While analytically convenient, this separation often fails to reflect real-world conditions. For instance, defenses against poisoning may suppress useful updates, while personalization and compression can alter the aggregation geometry itself. In this paper, we study these effects jointly and propose URP-FL, a compact training framework that integrates reliability-aware aggregation, local regularization for drift control, and sparse client uploads. We provide theoretical analysis establishing a convergence bound with distinct terms capturing optimization error, data heterogeneity, and adversarial impact. Experiments on a non-IID image classification benchmark with sign-flip and label-flip attacks demonstrate the benefits of the unified design. Compared to FedAvg and FedProx, this URP-FL maintains accuracy under attack while reducing transmitted parameters by approximately 75%. Rather than presenting a production ready system, it offers a reproducible and technically coherent step toward federated learning that is more robust under realistic conditions.

Hua Kun, Wei Wang · 0 citations
Jul 2026

Regularization-Enhanced Federated Class-Incremental Learning with Generative Replay for Smart Edge

This work proposes RAVEL-FCL, a generative replay-based framework for federated continual learning that integrates an improved generative model based on Rebooting ACGAN with multi-level feature alignment to ensure consistency and employs Elastic Variational Continual Learning on the server to probabilistically regularize the global model and preserve past knowledge.

Yurui Zhou, Jia Hu, Geyong Min et al. · 0 citations
Open access Aug 2026

FedDecouple: Mitigating Noise Accumulation in Differentially Private Federated Learning via Phase Decoupling

Differential privacy protection in federated learning faces the fundamental challenge of noise accumulation: noise added dispersedly by clients accumulates in variance during server-side aggregation, severely harming model convergence and accuracy. This paper proposes FedDecouple, a phase-decoupled differentially private federated learning framework that is analytically suited for resource-constrained mobile devices. The core innovation lies in decoupling the noise addition phase from the client computation phase—clients only upload clean gradients, while two auxiliary servers collaboratively generate and inject noise through a secure two-party MPC protocol. This design reduces the effective noise variance while eliminating the per-sample gradient computation burden on clients. Experimental results show that on MNIST, FedDecouple maintains 97.75% accuracy under strict privacy, significantly outperforming client-side noised DP-SGD with 94.0% accuracy. On CIFAR-10, it achieves 76.2% test accuracy, which is 13.4 percentage points higher than DP-SGD. FedDecouple’s total training time on both datasets is faster than Opacus and DP-SGD.

Unknown authors · 0 citations