Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2404.00466v2

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2404.00466v2 (cs)
[Submitted on 30 Mar 2024 (v1) , last revised 14 Apr 2025 (this version, v2)]

Title: Computation and Communication Efficient Lightweighting Vertical Federated Learning for Smart Building IoT

Title: 计算和通信高效轻量级垂直联邦学习在智能建筑物联网中的应用

Authors:Heqiang Wang, Xiang Liu, Yucheng Liu, Jia Zhou, Weihong Yang, Xiaoxiong Zhong
Abstract: With the increasing number and enhanced capabilities of IoT devices in smart buildings, these devices are evolving beyond basic data collection and control to actively participate in deep learning tasks. Federated Learning (FL), as a decentralized learning paradigm, is well-suited for such scenarios. However, the limited computational and communication resources of IoT devices present significant challenges. While existing research has extensively explored efficiency improvements in Horizontal FL, these techniques cannot be directly applied to Vertical FL due to fundamental differences in data partitioning and model structure. To address this gap, we propose a Lightweight Vertical Federated Learning (LVFL) framework that jointly optimizes computational and communication efficiency. Our approach introduces two distinct lightweighting strategies: one for reducing the complexity of the feature model to improve local computation, and another for compressing feature embeddings to reduce communication overhead. Furthermore, we derive a convergence bound for the proposed LVFL algorithm that explicitly incorporates both computation and communication lightweighting ratios. Experimental results on an image classification task demonstrate that LVFL effectively mitigates resource demands while maintaining competitive learning performance.
Abstract: 随着物联网设备数量的增加和功能的增强,在智能建筑中,这些设备正超越基本的数据收集和控制,积极地参与到深度学习任务中。联邦学习(FL)作为一种去中心化的学习范式,非常适合此类场景。然而,物联网设备有限的计算和通信资源带来了显著挑战。尽管现有研究广泛探索了水平联邦学习(Horizontal FL)的效率改进,但由于数据划分和模型结构的根本差异,这些技术不能直接应用于垂直联邦学习(Vertical FL)。为了解决这一差距,我们提出了一种轻量级垂直联邦学习(LVFL)框架,该框架联合优化计算和通信效率。我们的方法引入了两种不同的轻量化策略:一种用于减少特征模型的复杂性以提高本地计算能力,另一种用于压缩特征嵌入以减少通信开销。此外,我们推导出了针对所提出的LVFL算法的收敛界限,该界限明确包含了计算和通信轻量化比率。在图像分类任务上的实验结果表明,LVFL有效地缓解了资源需求,同时保持了具有竞争力的学习性能。
Subjects: Machine Learning (cs.LG) ; Distributed, Parallel, and Cluster Computing (cs.DC)
Cite as: arXiv:2404.00466 [cs.LG]
  (or arXiv:2404.00466v2 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2404.00466
arXiv-issued DOI via DataCite

Submission history

From: Heqiang Wang [view email]
[v1] Sat, 30 Mar 2024 20:19:28 UTC (62 KB)
[v2] Mon, 14 Apr 2025 12:22:21 UTC (64 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
cs.LG
< prev   |   next >
new | recent | 2024-04
Change to browse by:
cs
cs.DC

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号