Skip to content

Adaptive Phase-Switching for Communication-Efficient Federated LoRA Fine-Tuning

Sep 2026 · 0 citations · 27 references
Computer Science

TL;DR

This paper measures per-round upload and download bytes for a bidirectional B-only federated LoRA protocol and places five methods, three from prior work, on a single communication-quality frontier and finds ReverseAdaptive outperforms FFA-LoRA on TinyLlama-1.1B-Chat with Alpaca.

Abstract

Federated fine-tuning of large language models with low-rank adaptation reduces per-client trainable parameters, but client-to-server communication remains the dominant cost. Existing accounting for federated LoRA protocols omits the asymmetric transition round when a protocol changes aggregation mode, and reports savings that ignore grouped-query attention shapes. This paper measures per-round upload and download bytes for a bidirectional B-only federated LoRA protocol and places five methods, three from prior work, on a single communication-quality frontier. The frontier has a knee, which an adaptive phase-switching aggregator, ReverseAdaptive, locates by monitoring the relative improvement in global training loss against a dimensionless threshold rather than by fixing a phase boundary in advance. On TinyLlama-1.1B-Chat with Alpaca, ReverseAdaptive attains 40.5 percent measured round-trip savings over FLoRA at a held-out instruction-following loss cost of 0.0063. It outperforms FFA-LoRA, which freezes the first of the two LoRA factors at initialization, by 0.0182 in held-out loss, more than twenty times the largest per-method seed standard deviation on that metric, so learning that factor before freezing it produces better adapters. The same threshold transfers across model scales without retuning, and the quality cost of the transition is stable across the two datasets tested.

View source

Similar papers

Conference Open access Aug 2026

Accelerating Federated LoRA Fine-Tuning for LLMs with Adaptive Ranks at Network Edge

FLFAR reduces federated LoRA fine-tuning time by up to 40% while maintaining comparable accuracy, and at the beginning of each global round, the LoRA rank of each device is adapted according to its computational and communication capacity.

Zhi-Hao Zeng, Yu-Xiang Lu, Xiao-Ning Zhang et al. · 0 citations
Review Open access Sep 2026

Federated Fine-Tuning of Large Language Models on Resource-Constrained Clients: Technical Approaches, Resource Costs, and Applicability

This review examines four composable routes---parameter-efficient and quantized adaptation, backpropagation-free adaptation, proxy or submodel adaptation, and split federated adaptation---through a common framework that traces the objects each endpoint retains, exchanges, and discloses.

Yun-Heng Shen, Xiao Liu, Yang Yang et al. · 1 citation

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
Conference Open access Aug 2026

MoE Router-Guided Clustering for Heterogeneous Federated Instruction Tuning

Experimental results show that routing-aware collaboration consistently improves personalized performance compared to conventional federated averaging and local training, while maintaining the same communication cost, and shows that client-centric and expert-centric clustering provides an effective and scalable approac...

Ankita Sharma, B. Farahani, S. Moosavi et al. · 0 citations
#artificial intelligence Preprint Sep 2026

FedSubMuon: Communication-Efficient Federated LLM Fine-Tuning via Structured Subspace Muon

FedSubMuon is proposed, a communication-efficient federated Muon fine-tuning method that optimizes compact coefficient matrices within shared structured subspaces that keeps Muon on a single matrix-valued trainable object, while reducing the client upload to compact coefficient matrices.

Shao-Long Chen, Youming Tao, Shu-Zhen Chen et al. · 0 citations
Preprint Aug 2026

Unveiling the Depth-Performance Dilemma in Split-Federated Fine-tuning of LLMs

This work identifies and characterize the Depth-Performance Dilemma: the regime that maximizes system efficiency is precisely where fine-tuning quality collapses, and challenges the prevailing assumption that partition depth is a utility-neutral tuning knob and provide a structural foundation for stable distributed LLM...

Hariharan Ramesh, S. Murugaiyan, Jyotikrishna Dass · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

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