Metraipolis › archive › dc_71eb33c71609

Efficient Resource Optimization for Split Federated Learning — arXiv:2608.17849

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.17849
License (as archived)
CC0-1.0
Archived
2026-10-18T14:48:44.536Z
SHA-256 of the archived text
030fc29ca1dc8e0d6fed3f94b3a920981469c68818c2a58c42aec1d4b5c65cda
Stable URL of this page
https://metraipolis.com/documento/dc_71eb33c71609

How to cite

Efficient Resource Optimization for Split Federated Learning — arXiv:2608.17849 — arXiv (en), https://arxiv.org/abs/2608.17849 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_71eb33c71609 (Metraipolis archive dc_71eb33c71609, sha256 030fc29ca1dc8e0d6fed3f94b3a920981469c68818c2a58c42aec1d4b5c65cda)
BibTeX
@misc{dc71eb33c71609,
  title = {Efficient Resource Optimization for Split Federated Learning — arXiv:2608.17849},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.17849},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_71eb33c71609; sha256 030fc29ca1dc8e0d6fed3f94b3a920981469c68818c2a58c42aec1d4b5c65cda},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.17849. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Split federated learning (SFL) has emerged as a powerful paradigm for model training at the edge. However, SFL inherently involves discrete decision variables for model splitting and resource allocation, resulting in a challenging mixed-integer problem. Consequently, prior optimization schemes for SFL are either \textit{heuristic} or \textit{computationally inefficient}, which cannot handle large-scale user populations. To address this limitation, this work establishes an efficient optimization framework for SFL under resource-constrained networks. Our framework jointly optimizes model splitting and resource allocation to minimize training cost, which is defined as the weighted sum of latency and energy costs. We first study the model splitting problem and develop a polynomial-time algorithm that achieves the global optimum. Then, we extend the approach to the joint model splitting and resource allocation problem. In this case, we formulate it as a two-dimensional master problem and develop an efficient approximation method with a $(1+\epsilon)$-approximation guarantee. Extensive experiments show that the proposed approach provides efficient solutions to strike the optimal energy--latency tradeoff.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-19 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.17849 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T14:47:59.416Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-19?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).