arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2306.02433eess.SPcs.LG

基于黎曼低秩模型压缩的联邦学习空中聚合方法

Riemannian Low-Rank Model Compression for Federated Learning with Over-the-Air Aggregation

Shenzhen Research Institute of Big Data(深圳大数据研究院);Hong Kong University of Science and Technology(香港科技大学)

Ye Xue, Vincent Lau

AI总结:

本文针对联邦学习中的低秩模型压缩问题,提出一种基于黎曼流形优化的不放宽低秩约束的新方法,并设计带预编码器的交替优化算法以支持高效的空中聚合,实验证明其优于现有基线。

摘要:

低秩模型压缩是一种广泛使用的技术,用于减少训练机器学习模型时的计算负荷。然而,现有方法通常依赖使用正则化核范数惩罚来放宽模型权重的低秩约束,这需要一个在实践中难以确定的合适超参数。此外,现有压缩技术无法直接应用于分布式物联网场景下联邦学习系统中的高效空中聚合。本文提出了一种新颖的流形优化公式,用于联邦学习中的低秩模型压缩,且不放宽低秩约束。我们的优化直接在低秩流形上进行,保证模型具有精确的低秩性。我们还在优化公式中引入了共识惩罚以支持空中聚合。基于该优化公式,我们提出了一种带有预编码器的交替黎曼优化算法,能够在不牺牲训练性能的情况下实现低秩本地模型的高效空中聚合。此外,我们针对关键系统参数提供了收敛性分析,并使用真实世界数据集进行了大量实验,证明了所提出的黎曼低秩模型压缩方案相较于各种最先进基线的有效性。

英文摘要:

Low-rank model compression is a widely used technique for reducing the computational load when training machine learning models. However, existing methods often rely on relaxing the low-rank constraint of the model weights using a regularized nuclear norm penalty, which requires an appropriate hyperparameter that can be difficult to determine in practice. Furthermore, existing compression techniques are not directly applicable to efficient over-the-air (OTA) aggregation in federated learning (FL) systems for distributed Internet-of-Things (IoT) scenarios. In this paper, we propose a novel manifold optimization formulation for low-rank model compression in FL that does not relax the low-rank constraint. Our optimization is conducted directly over the low-rank manifold, guaranteeing that the model is exactly low-rank. We also introduce a consensus penalty in the optimization formulation to support OTA aggregation. Based on our optimization formulation, we propose an alternating Riemannian optimization algorithm with a precoder that enables efficient OTA aggregation of low-rank local models without sacrificing training performance. Additionally, we provide convergence analysis in terms of key system parameters and conduct extensive experiments with real-world datasets to demonstrate the effectiveness of our proposed Riemannian low-rank model compression scheme compared to various state-of-the-art baselines.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑