Pith. sign in

REVIEW 1 cited by

FedDUAP: Federated Learning with Dynamic Update and Adaptive Pruning Using Shared Data on the Server

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 2204.11536 v1 pith:JKHNJA7S submitted 2022-04-25 cs.DC cs.AI

classification cs.DCcs.AI
keywords serverdataefficiencyfedduapmodelpruningupdateaccuracy
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Despite achieving remarkable performance, Federated Learning (FL) suffers from two critical challenges, i.e., limited computational resources and low training efficiency. In this paper, we propose a novel FL framework, i.e., FedDUAP, with two original contributions, to exploit the insensitive data on the server and the decentralized data in edge devices to further improve the training efficiency. First, a dynamic server update algorithm is designed to exploit the insensitive data on the server, in order to dynamically determine the optimal steps of the server update for improving the convergence and accuracy of the global model. Second, a layer-adaptive model pruning method is developed to perform unique pruning operations adapted to the different dimensions and importance of multiple layers, to achieve a good balance between efficiency and effectiveness. By integrating the two original techniques together, our proposed FL model, FedDUAP, significantly outperforms baseline approaches in terms of accuracy (up to 4.8% higher), efficiency (up to 2.8 times faster), and computational cost (up to 61.9% smaller).

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. TinyProto: Communication-Efficient Federated Learning with Sparse Prototypes in Resource-Constrained Environments

    cs.LG 2025-07 conditional novelty 5.0 of 10

    Compressing class prototypes with per-class masks and a sample-count scaling trick cuts communication cost in prototype-based federated learning by up to several times without hurting accuracy.

Pith tools