Pith. sign in

REVIEW

FedHM: Efficient Federated Learning for Heterogeneous Models via Low-rank Factorization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2111.14655 v2 pith:M7JJLD7M submitted 2021-11-29 cs.LG cs.AIcs.DC

classification cs.LGcs.AIcs.DC
keywords heterogeneousmodelsfederatedfedhmdifferentlearninglow-rankmodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

One underlying assumption of recent federated learning (FL) paradigms is that all local models usually share the same network architecture and size, which becomes impractical for devices with different hardware resources. A scalable federated learning framework should address the heterogeneity that clients have different computing capacities and communication capabilities. To this end, this paper proposes FedHM, a novel heterogeneous federated model compression framework, distributing the heterogeneous low-rank models to clients and then aggregating them into a full-rank model. Our solution enables the training of heterogeneous models with varying computational complexities and aggregates them into a single global model. Furthermore, FedHM significantly reduces the communication cost by using low-rank models. Extensive experimental results demonstrate that FedHM is superior in the performance and robustness of models of different sizes, compared with state-of-the-art heterogeneous FL methods under various FL settings. Additionally, the convergence guarantee of FL for heterogeneous devices is first theoretically analyzed.

Discussion (0). Sign in to comment.

Pith tools