Table of Contents
Fetching ...

CA-HFP: Curvature-Aware Heterogeneous Federated Pruning with Model Reconstruction

Gang Hu, Yinglei Teng, Pengfei Wu, Shijun Ma

Abstract

Federated learning on heterogeneous edge devices requires personalized compression while preserving aggregation compatibility and stable convergence. We present Curvature-Aware Heterogeneous Federated Pruning (CA-HFP), a practical framework that enables each client perform structured, device-specific pruning guided by a curvature-informed significance score, and subsequently maps its compact submodel back into a common global parameter space via a lightweight reconstruction. We derive a convergence bound for federated optimization with multiple local SGD steps that explicitly accounts for local computation, data heterogeneity, and pruning-induced perturbations; from which a principled loss-based pruning criterion is derived. Extensive experiments on FMNIST, CIFAR-10, and CIFAR-100 using VGG and ResNet architectures under varying degrees of data heterogeneity demonstrate that CA-HFP preserves model accuracy while significantly reducing per-client computation and communication costs, outperforming standard federated training and existing pruning-based baselines.

CA-HFP: Curvature-Aware Heterogeneous Federated Pruning with Model Reconstruction

Abstract

Federated learning on heterogeneous edge devices requires personalized compression while preserving aggregation compatibility and stable convergence. We present Curvature-Aware Heterogeneous Federated Pruning (CA-HFP), a practical framework that enables each client perform structured, device-specific pruning guided by a curvature-informed significance score, and subsequently maps its compact submodel back into a common global parameter space via a lightweight reconstruction. We derive a convergence bound for federated optimization with multiple local SGD steps that explicitly accounts for local computation, data heterogeneity, and pruning-induced perturbations; from which a principled loss-based pruning criterion is derived. Extensive experiments on FMNIST, CIFAR-10, and CIFAR-100 using VGG and ResNet architectures under varying degrees of data heterogeneity demonstrate that CA-HFP preserves model accuracy while significantly reducing per-client computation and communication costs, outperforming standard federated training and existing pruning-based baselines.
Paper Structure (19 sections, 2 theorems, 15 equations, 6 figures, 2 tables)

This paper contains 19 sections, 2 theorems, 15 equations, 6 figures, 2 tables.

Key Result

Lemma 1

Suppose that each client performs $E$ local SGD steps as in Eq. eq:local_sgd, and the server aggregates according to Eq. eq:agg. Let the local step size $0 < \eta \leqslant \frac{1}{{4LE}}$, and define $e_t$ implicitly by Eq. eq:global_update_noise. Under Assumptions as:smooth--as:heterogeneity, th

Figures (6)

  • Figure 1: Curvature-Aware Heterogeneous Federated Pruning (CA-HFP) Framework.
  • Figure 2: Model Pruning and Reconstruction.
  • Figure 3: The convergence with different pruning methods.
  • Figure 4: The accuracy under different pruning ratio.
  • Figure 5: The cost under different pruning ratio. The communication cost includes the uploading and the downloading and the calculation of FLOPS is according to PruneFL.
  • ...and 1 more figures

Theorems & Definitions (2)

  • Lemma 1: Result of one round
  • Theorem 1: FL Convergence with personal pruning