pith. sign in

arxiv: 2008.06767 · v2 · pith:GFKW4HPSnew · submitted 2020-08-15 · 💻 cs.LG · stat.ML

Heterogeneous Federated Learning

classification 💻 cs.LG stat.ML
keywords federatedlearninginformationcollaborativemodelsalignmentdistributionfeature
0
0 comments X
read the original abstract

Federated learning learns from scattered data by fusing collaborative models from local nodes. However, due to chaotic information distribution, the model fusion may suffer from structural misalignment with regard to unmatched parameters. In this work, we propose a novel federated learning framework to resolve this issue by establishing a firm structure-information alignment across collaborative models. Specifically, we design a feature-oriented regulation method ({$\Psi$-Net}) to ensure explicit feature information allocation in different neural network structures. Applying this regulating method to collaborative models, matchable structures with similar feature information can be initialized at the very early training stage. During the federated learning process under either IID or non-IID scenarios, dedicated collaboration schemes further guarantee ordered information distribution with definite structure matching, so as the comprehensive model alignment. Eventually, this framework effectively enhances the federated learning applicability to extensive heterogeneous settings, while providing excellent convergence speed, accuracy, and computation/communication efficiency.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Subspace Optimization for Efficient Federated Learning under Heterogeneous Data

    cs.LG 2026-04 unverdicted novelty 5.0

    SSF enables efficient federated learning under heterogeneous data by optimizing in a low-dimensional subspace with projected corrections and backfill updates, achieving a non-asymptotic convergence rate of order O~(1/...

  2. FedSLoP: Memory-Efficient Federated Learning with Low-Rank Gradient Projection

    cs.LG 2026-04 unverdicted novelty 5.0

    FedSLoP reduces communication and memory costs in federated learning through stochastic low-rank gradient projections, with a nonconvex convergence rate of O(1/sqrt(NT)) and competitive accuracy on heterogeneous MNIST data.

  3. FedSLoP: Memory-Efficient Federated Learning with Low-Rank Gradient Projection

    cs.LG 2026-04 unverdicted novelty 4.0

    FedSLoP applies stochastic low-rank gradient projections in federated learning to reduce communication volume and client memory while proving O(1/sqrt(NT)) convergence to stationary points under standard assumptions a...