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:2510.02701

Help | Advanced Search

Computer Science > Information Theory

arXiv:2510.02701 (cs)
[Submitted on 3 Oct 2025 ]

Title: Robust Segmented Analog Broadcast Design to Accelerate Wireless Federated Learning

Title: 鲁棒分段模拟广播设计以加速无线联邦学习

Authors:Chong Zhang, Ben Liang, Min Dong, Ali Afana, Yahia Ahmed
Abstract: We consider downlink broadcast design for federated learning (FL) in a wireless network with imperfect channel state information (CSI). Aiming to reduce transmission latency, we propose a segmented analog broadcast (SegAB) scheme, where the parameter server, hosted by a multi-antenna base station, partitions the global model parameter vector into segments and transmits multiple parameters from these segments simultaneously over a common downlink channel. We formulate the SegAB transmission and reception processes to characterize FL training convergence, capturing the effects of downlink beamforming and imperfect CSI. To maximize the FL training convergence rate, we establish an upper bound on the expected model optimality gap and show that it can be minimized separately over the training rounds in online optimization, without requiring knowledge of the future channel states. We solve the per-round problem to achieve robust downlink beamforming, by minimizing the worst-case objective via an epigraph representation and a feasibility subproblem that ensures monotone convergence. Simulation with standard classification tasks under typical wireless network setting shows that the proposed SegAB substantially outperforms conventional full-model per-parameter broadcast and other alternatives.
Abstract: 我们考虑在具有不完美信道状态信息(CSI)的无线网络中联邦学习(FL)的下行广播设计。 旨在减少传输延迟,我们提出了一种分段模拟广播(SegAB)方案,其中由多天线基站托管的参数服务器将全局模型参数向量划分为多个段,并通过公共下行信道同时传输这些段中的多个参数。 我们将SegAB的传输和接收过程进行建模,以表征FL训练的收敛性,捕捉下行波束成形和不完美CSI的影响。 为了最大化FL训练的收敛速度,我们建立了期望模型最优性差距的上界,并表明可以在在线优化中单独针对每个训练轮次进行最小化,而无需了解未来的信道状态。 我们通过最小化最坏情况目标来解决每轮问题,以实现鲁棒的下行波束成形,利用一个等价图表示和一个可行性子问题来确保单调收敛。 在典型无线网络设置下的标准分类任务仿真表明,所提出的SegAB显著优于传统的全模型逐参数广播和其他替代方案。
Comments: 10 pages, 10 figures
Subjects: Information Theory (cs.IT)
Cite as: arXiv:2510.02701 [cs.IT]
  (or arXiv:2510.02701v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2510.02701
arXiv-issued DOI via DataCite

Submission history

From: Chong Zhang [view email]
[v1] Fri, 3 Oct 2025 03:42:07 UTC (383 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs
math
math.IT

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号