LGMLJun 12

Federated Learning for Feature Generalization with Convex Constraints

arXiv:2606.14416v14.71 citations
Predicted impact top 81% in LG · last 90 daysOriginality Incremental advance
AI Analysis

Addresses generalization in federated learning for practitioners dealing with non-IID data.

Federated learning suffers from poor generalization due to heterogeneous client data. FedCONST uses convex constraints to modulate update magnitudes, achieving state-of-the-art performance.

Federated learning (FL) often struggles with generalization due to heterogeneous client data. Local models are prone to overfitting their local data distributions, and even transferable features can be distorted during aggregation. To address these challenges, we propose FedCONST, an approach that adaptively modulates update magnitudes based on the parameter strength of the global model. This prevents over-emphasizing well-learned parameters while reinforcing underdeveloped ones. Specifically, FedCONST employs linear convex constraints to ensure training stability and preserve locally learned generalization capabilities during aggregation. A Gradient Signal to Noise Ratio (GSNR) analysis further validates the effectiveness of FedCONST in enhancing feature transferability and robustness. As a result, FedCONST effectively aligns local and global objectives, mitigating overfitting and promoting stronger generalization across diverse FL environments, achieving state-of-the-art performance.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes