Skip to content

FlexP-SFT: A Flexible Aggregation-Free Framework for On-Device Personalized Split Federated Fine-Tuning of LLMs

Aug 2025 · 3 citations · 41 references
Computer Science

TL;DR

FlexP-SFT is proposed, a novel aggregation-free framework for personalized split federated fine-tuning, which fundamentally eliminates the client-side aggregation process and introduces a layer-flexible alignment strategy to balance personalization and generalization capabilities.

Abstract

To fine-tune large language models (LLMs) over private data, federated learning (FL) has emerged as a promising paradigm. However, the prohibitive memory and communication demands of LLMs render standard FL impractical for resource-constrained edge devices. While split federated learning (SFL) alleviates the computing burdens via model partitioning, existing frameworks still suffer from communication bottlenecks and straggler problem due to the parameter aggregation process. To address these challenges, we propose FlexP-SFT, a novel aggregation-free framework for personalized split federated fine-tuning, which fundamentally eliminates the client-side aggregation process. Crucially, to ensure robust training in the absence of global synchronization, we introduce a layer-flexible alignment strategy to balance personalization and generalization capabilities. We further formulate split-ratio selection as a resource-aware discrete optimization problem that jointly accounts for personalization accuracy and system cost. Our proposed scheme simultaneously enhances personalized performance, reduces communication overhead, and resolves the straggler problem. Extensive results show that FlexP-SFT substantially outperforms baselines in both accuracy and latency, and that the optimized split ratio achieves a better resource-accuracy trade-off than static or memory-only choices.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

Task-Aware Federated Fine-Tuning for MoE-based Large Language Models

FedTAR is proposed, a task-aware federated fine-tuning method for MoE-based LLMs that establishes the association between local updates and task preference via routing outputs and preserves expert specialization and mitigates destructive interference among heterogeneous clients.

Ting-Qi Wang, Hongyu Ke, Hao-Xin Wang et al. · 0 citations
Conference Open access Sep 2026

Beyond Client Clustering: Fine-Grained Preference Alignment in Federated RLHF via Self-Evolving Routing

FedPrism is proposed, a novel framework that shifts alignment granularity from the coarse client level to the precise instance level and devise a Posterior-Guided Performance Distillation mechanism that leverages experts' actual training loss as self-supervision to autonomously refine routing policies without explicit...

Ke Wang, Shao-Jing Fu, Yu-Chuan Luo et al. · 0 citations
#artificial intelligence Preprint Sep 2026

FedLAFP: Low-Rank Aggregation Meets Full-Rank Personalization in Federated Fine-Tuning

Federated parameter-efficient fine-tuning enables clients to adapt pre-trained models without sharing raw data or communicating the full model, but statistical heterogeneity makes a single global adapter insufficient for personalized prediction. Existing personalized methods typically use the same low-rank structure fo...

Meng-Jun Yi, Huai-An Gu, Yi-Hao Ai et al. · 0 citations
Conference Open access Sep 2026

DASFL: Dynamic Adaptive Split Federated Learning for Heterogeneous Clients

Split Federated Learning (SFL) has emerged as a pivotal paradigm for privacy-preserving distributed training on resource-constrained edge devices by partitioning neural networks between clients and a server. A critical design choice in SFL is the split layer, which determines the computation distribution and the semant...

Ai-Jing Li, Ya-Wen Li, Guan-Hua Ye et al. · 0 citations

Just Talk Once: Communication-Efficient Split Federated LLM Fine-Tuning on Edge Devices

L-shaped SFT is presented, a split fine-tuning framework that removes the need for continuous client participation and introduces one-shot SFT, in which clients upload activations once and then go offline while the server continues optimization over cached representations.

Jia-Xiang Geng, Xian-Hao Chen, Bing Luo · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

MIT News · Artificial Intelligence Oct 23, 2026

Q&A: How AI came to model the “messy” human mind

Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.