针对边缘设备多模态联邦学习,提出自适应压缩框架,提升通信效率与模型精度。
Entropy-Guided Tensor Compression for Multimodal Federated Learning on Edge Devices

- 根据更新矩阵的谱熵动态分配压缩秩,实现层、模态、设备级自适应压缩。
- 在15节点树莓派集群上实现最高56.8倍压缩,最终准确率超基线2.01%。
- 适合资源受限的多模态边缘设备,尤其适用于异构传感与算力场景。
移动与边缘设备上的联邦学习日益涉及多模态模型,客户端在感知能力与计算能力上存在差异。现有更新压缩方法通常对各层与设备采用统一策略,未考虑模态间谱结构与可压缩性的差异。本文提出MESH-FL,一种基于谱熵引导的矩阵乘积态(MPS)更新压缩框架,用于资源受限设备上的模态异构联邦学习。MESH-FL通过截断奇异值分解估计每层更新的谱熵,并在满足客户端传输预算的前提下,自适应地分配MPS压缩秩,覆盖层、模态与设备维度。我们证明:在奇异值能量分布的优序关系下,更高的谱熵需更高重构秩。基于此,我们证明所提熵引导分配可解决凸近似秩分配问题,在精确负载模型下保持单调性,并在显式压缩依赖误差项下保证收敛性。在包含15个异构树莓派4/5节点的集群上实验表明,MESH-FL实现最高56.8倍压缩,最终准确率较未压缩的FedAvg基线提升达2.01%,且总传输数据量减少高达66倍即可达到收敛。
原文摘要 · Abstract (English)
Federated learning (FL) over mobile and edge devices increasingly involves multimodal models in which clients differ in both sensing capability and computational capacity. Existing update compression schemes typically apply uniform policies across layers and devices, without accounting for modality-specific differences in spectral structure and compressibility. We propose MESH-FL, an entropy-guided matrix product state (MPS) update-compression framework for modality-heterogeneous FL on resource-constrained devices. MESH-FL estimates the spectral entropy of each layer-wise update via truncated singular value decomposition and allocates MPS compression ranks adaptively across layers, modalities, and devices under per-client payload budgets. We show that higher spectral entropy necessitates a higher reconstruction rank under the majorization order on singular-value energy distributions. Building on this result, we prove that the proposed entropy-guided allocation solves a convex surrogate rank-allocation problem, preserves monotonicity under the exact payload model, and achieves convergence with an explicit compression-dependent error term. Experiments on a 15-node heterogeneous Raspberry Pi~4/5 cluster with modality-heterogeneous clients show that MESH-FL achieves up to $56.8\times$ compression while surpassing the uncompressed FedAvg baseline in final accuracy by up to 2.01%, and reduces total transmitted data to reach convergence by up to $66\times$.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。