Table of Contents
Fetching ...

Learnable Sparse Customization in Heterogeneous Edge Computing

Jingjing Xue, Sheng Sun, Min Liu, Yuwei Wang, Zhuotao Liu, Jingyuan Wang

TL;DR

This work tackles dual challenges in edge Federated Learning: system heterogeneity and statistical heterogeneity arising from non-IID data. It introduces FedLPS, a framework enabling learnable sparse training and adaptive sparse-ratio decisions to produce personalized, resource-aware submodels for each client. A key contribution is the Learnable Sparse Training that learns unit-wise importance indicators to derive personalized sparse patterns, coupled with P-UCBV, a multi-armed bandit approach that adaptively selects sparse ratios based on a reward balancing local cost and accuracy. Theoretical convergence guarantees are provided, and extensive experiments across five datasets show FedLPS achieves substantial accuracy gains while reducing computation costs and training time compared with state-of-the-art baselines. The approach offers practical improvements for real-world edge data management by aligning model sparsity with heterogeneous device capabilities and non-IID data distributions.

Abstract

To effectively manage and utilize massive distributed data at the network edge, Federated Learning (FL) has emerged as a promising edge computing paradigm across data silos. However, FL still faces two challenges: system heterogeneity (i.e., the diversity of hardware resources across edge devices) and statistical heterogeneity (i.e., non-IID data). Although sparsification can extract diverse submodels for diverse clients, most sparse FL works either simply assign submodels with artificially-given rigid rules or prune partial parameters using heuristic strategies, resulting in inflexible sparsification and poor performance. In this work, we propose Learnable Personalized Sparsification for heterogeneous Federated learning (FedLPS), which achieves the learnable customization of heterogeneous sparse models with importance-associated patterns and adaptive ratios to simultaneously tackle system and statistical heterogeneity. Specifically, FedLPS learns the importance of model units on local data representation and further derives an importance-based sparse pattern with minimal heuristics to accurately extract personalized data features in non-IID settings. Furthermore, Prompt Upper Confidence Bound Variance (P-UCBV) is designed to adaptively determine sparse ratios by learning the superimposed effect of diverse device capabilities and non-IID data, aiming at resource self-adaptation with promising accuracy. Extensive experiments show that FedLPS outperforms status quo approaches in accuracy and training costs, which improves accuracy by 1.28%-59.34% while reducing running time by more than 68.80%.

Learnable Sparse Customization in Heterogeneous Edge Computing

TL;DR

This work tackles dual challenges in edge Federated Learning: system heterogeneity and statistical heterogeneity arising from non-IID data. It introduces FedLPS, a framework enabling learnable sparse training and adaptive sparse-ratio decisions to produce personalized, resource-aware submodels for each client. A key contribution is the Learnable Sparse Training that learns unit-wise importance indicators to derive personalized sparse patterns, coupled with P-UCBV, a multi-armed bandit approach that adaptively selects sparse ratios based on a reward balancing local cost and accuracy. Theoretical convergence guarantees are provided, and extensive experiments across five datasets show FedLPS achieves substantial accuracy gains while reducing computation costs and training time compared with state-of-the-art baselines. The approach offers practical improvements for real-world edge data management by aligning model sparsity with heterogeneous device capabilities and non-IID data distributions.

Abstract

To effectively manage and utilize massive distributed data at the network edge, Federated Learning (FL) has emerged as a promising edge computing paradigm across data silos. However, FL still faces two challenges: system heterogeneity (i.e., the diversity of hardware resources across edge devices) and statistical heterogeneity (i.e., non-IID data). Although sparsification can extract diverse submodels for diverse clients, most sparse FL works either simply assign submodels with artificially-given rigid rules or prune partial parameters using heuristic strategies, resulting in inflexible sparsification and poor performance. In this work, we propose Learnable Personalized Sparsification for heterogeneous Federated learning (FedLPS), which achieves the learnable customization of heterogeneous sparse models with importance-associated patterns and adaptive ratios to simultaneously tackle system and statistical heterogeneity. Specifically, FedLPS learns the importance of model units on local data representation and further derives an importance-based sparse pattern with minimal heuristics to accurately extract personalized data features in non-IID settings. Furthermore, Prompt Upper Confidence Bound Variance (P-UCBV) is designed to adaptively determine sparse ratios by learning the superimposed effect of diverse device capabilities and non-IID data, aiming at resource self-adaptation with promising accuracy. Extensive experiments show that FedLPS outperforms status quo approaches in accuracy and training costs, which improves accuracy by 1.28%-59.34% while reducing running time by more than 68.80%.

Paper Structure

This paper contains 18 sections, 2 theorems, 39 equations, 9 figures, 2 tables, 2 algorithms.

Key Result

Lemma 1

Let Assumptions 1-4 hold. For any $r \in \{0,\dots,R-1\}$, $l \in \{0,\dots,E-1\}$, it follows with the learning rate $\eta_r \leq \sqrt{\frac{1}{24ERV_rL^2}}$, where $V_r = \max_{k\in [K], l\in[E]} \{ \frac{ \|m^r_{k,E} \odot m^r_{k,l} \odot \nabla_{\Tilde{\omega}} F_k(\Tilde{\omega}^r_{k,l}) - m_k^* \odot \nabla_{\Tilde{\omega}} F_k(\Tilde{\omega}_{k,r}) \|^2 }{ \| \nabla_{\omega} F_k({\ome

Figures (9)

  • Figure 1: Different pattern strategies. The padding represents importance scores and no padding indicates the unit is sparsified.
  • Figure 2: The overview diagram of our FedLPS framework, where the numbers ① --⑤ represent the training procedures.
  • Figure 3: Test accuracy versus FLOP computation costs on four datasets.
  • Figure 4: Test accuracy versus running time on four datasets.
  • Figure 5: TTA on CIFAR10, CIFAR100, and Tiny-Imagenet.
  • ...and 4 more figures

Theorems & Definitions (4)

  • Lemma 1
  • proof
  • Theorem 1
  • proof