A

Pruning Federated Models Through Loss Landscape Analysis and Client Agreement Scoring

IEEE Internet of Things Journal, vol. 13, pp. 31283–31293

Abstract

The practical deployment of Federated Learning (FL) on resource-constrained devices is fundamentally limited by the high cost of training large models and the instability caused by heterogeneous (non-IID) client data. Conventional pruning methods often treat data heterogeneity as a problem to be mitigated. In this work, we introduce a paradigm shift: we reframe client diversity as a feature to be harnessed. We propose AutoFLIP, a framework that begins not with training, but with a one-time federated loss exploration. During this phase, clients collaboratively build a map of the collective loss landscape, using their diverse data to reveal the problem's essential structure. This shared intelligence then guides an adaptive pruning strategy that is dynamically refined by client agreement throughout training. This approach allows AutoFLIP to identify robust and efficient sub-networks from the outset. Our extensive experiments show that AutoFLIP reduces computational overhead by an average of 52% and communication costs by over 65% while simultaneously achieving state-of-the-art accuracy in challenging non-IID settings.

Authors 6

  1. Bielefeld University

    Affiliation as printed

    Bielefeld University, Bielefeld, Germany

  2. Leiden University

    Affiliation as printed

    Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Leiden, The Netherlands

  3. Honda (Germany)

    Affiliation as printed

    Honda Research Institute Europe, Europe, Germany

  4. Leiden University

    Affiliation as printed

    Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Leiden, The Netherlands

  5. Westlake University

    Affiliation as printed

    School of Engineering, Westlake University, Hangzhou, China

  6. Bielefeld University

    Affiliation as printed

    Bielefeld University, Bielefeld, Germany

Cited by 2 stored of 2

2 results

No patents citing this paper on Lens.org (checked 2026-10-11).

References 0