mlsanityData to 14 Oct 2026

Incentivizing Multi-Tenant Split Federated Learning for Foundation Models at the Network Edge

arXiv 2503.04971 ↗First posted 6 Mar 2025cs.LG cs.AI cs.DCcited by 1

Not on the map. Why?

Abstract (arXiv)

Foundation models (FMs) such as GPT-4 exhibit exceptional generative capabilities across diverse downstream tasks through fine-tuning. Split Federated Learning (SFL) facilitates privacy-preserving FM fine-tuning on resource-constrained local devices by offloading partial FM computations to edge servers, enabling device-edge synergistic fine-tuning. Practical edge networks often host multiple SFL tenants to support diversified downstream tasks. However, existing research primarily focuses on single-tenant SFL scenarios, and lacks tailored incentive mechanisms for multi-tenant settings, which are essential to effectively coordinate self-interested local devices for participation in various downstream tasks, ensuring that each SFL tenant's distinct FM fine-tuning requirements (e.g., FM types, performance targets, and fine-tuning deadlines) are met. To address this gap, we propose a novel Price-Incentive Mechanism (PRINCE) that guides multiple SFL tenants to offer strategic price incentives, which solicit high-quality device participation for efficient FM fine-tuning. Specifically, we first develop a bias-resilient global SFL model aggregation scheme to eliminate model biases caused by independent device participation. We then derive a rigorous SFL convergence bound to evaluate the contributions of heterogeneous devices to FM performance improvements, guiding the incentive strategies of SFL tenants. Furthermore, we model inter-tenant device competition as a congestion game for Stackelberg equilibrium (SE) analysis, deriving each SFL tenant's optimal incentive strategy. Extensive simulations involving four representative SFL tenant types (ViT, BERT, Whisper, and LLaMA) across diverse data modalities (text, images, and audio) demonstrate that PRINCE accelerates FM fine-tuning by up to 3.07x compared to state-of-the-art approaches, while consistently meeting fine-tuning performance targets.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 22 of its 43 references that are in the map. First posted on arXiv 6 Mar 2025.

Builds on

22 of 43 references.

References · 22

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  3. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  4. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  5. 2022Robust Speech Recognition via Large-Scale Weak Supervisioncited by 4,057
  6. 2019Common Voice: A Massively-Multilingual Speech Corpuscited by 1,384
  7. 2019On the Convergence of FedAvg on Non-IID Datacited by 1,229
  8. 2018Neural Network Acceptability Judgmentscited by 958
  9. 2018Adaptive Federated Learning in Resource Constrained Edge Computing Systemscited by 409
  10. 2020SplitFed: When Federated Learning Meets Split Learningcited by 310
  11. 2018Distributed learning of deep neural network over multiple agentscited by 279
  12. 2021DialogSum: A Real-Life Scenario Dialogue Summarization Datasetcited by 183
10 more
  1. 2023Efficient Parallel Split Learning over Resource-constrained Wireless Edge Networkscited by 95
  2. 2024Holistic Autonomous Driving Understanding by Bird's-Eye-View Injected Multi-Modal Large Modelscited by 76
  3. 2021Tackling System and Statistical Heterogeneity for Federated Learning with Adaptive Client Samplingcited by 66
  4. 2020An Incentive Mechanism for Federated Learning in Wireless Cellular network: An Auction Approachcited by 39
  5. 2024MELTing point: Mobile Evaluation of Language Transformerscited by 36
  6. 2022Communication-Efficient Device Scheduling for Federated Learning Using Stochastic Optimizationcited by 28
  7. 2023Achieving Linear Speedup in Non-IID Federated Bilevel Learningcited by 18
  8. 2022Multi-Edge Server-Assisted Dynamic Federated Learning with an Optimized Floating Aggregation Pointcited by 10
  9. 2023Incentive Mechanism Design for Unbiased Federated Learning with Randomized Client Participationcited by 8
  10. 2022Dynamic Pricing for Client Recruitment in Federated Learningcited by 3

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.