atlas

Research map / Federated learning and privacy / Communication-efficient FL

Robust Federated Finetuning of LLMs via Alternating Optimization of LoRA

NeurIPS 2025 · Federated learning and privacy › Communication-efficient FL · approach: Federated optimization algorithms · 4 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes RoLoRA, a federated LoRA fine-tuning method that alternates between freezing and aggregating the down-projection (A) and up-projection (B) matrices, with linear-model theory showing it beats FFA-LoRA and experiments on RoBERTa-Large and Llama-2-7B.

Problem

Naive FedAvg on LoRA's A and B matrices yields inexact aggregated updates (average of A_i B_i differs from product of averages), while freezing one of the matrices (FFA-LoRA) limits expressiveness and robustness, especially with fewer fine-tuning parameters or more clients.

Approach

Alternate between odd and even communication rounds: in one round all clients freeze A and train/aggregate B, in the next they freeze B and train/aggregate A, so both down- and up-projections are learned while keeping aggregation exact and halving per-round communication. Theory on a rank-1 linear model shows exponential convergence versus FFA-LoRA's error floor set by initialization.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use alternating updates of both LoRA projection matrices rather than directly averaging LoRA matricesRoBERTa-Large federated finetuning · GLUE average, 50 clients, rank 4accuracy: 76.48 -> 85.81Helped
Use alternating updates of both LoRA projection matrices rather than directly averaging LoRA matricesRoBERTa-Large federated finetuning · MNLI, Dir(1.0), 15 clientsaccuracy: 74.54 -> 81.55Helped
Increase clients from 3 to 50 while maintaining the sample countLoRA · GLUE average, rank 4accuracy: 88.20 -> 70.72Hurt
Learn projection A instead of keeping it frozen (ablation)FFA-LoRA / RoLoRA · MNLI, 50 clientsaccuracyHelped
Prioritize multiple B updates over balanced A/B alternation (ablation)RoLoRA · Accuracy over communication roundsaccuracyHurt
Prioritize multiple A updates over balanced A/B alternation (ablation)RoLoRA · Accuracy over communication roundsaccuracyHurt
Use unequal learning rates for A and B instead of balanced alternation (ablation)RoLoRA · Accuracy over communication roundsaccuracyHurt
Increase FFA-LoRA local steps per round while keeping total computation fixed (ablation)FFA-LoRA · MNLI, 50 clientsaccuracy: 72.52 -> 71.73 -> 69.64 -> 69.97Hurt
Increase FFA-LoRA local steps per round while keeping total computation fixed (ablation)FFA-LoRA · QQP, 50 clientsaccuracy: 80.51 -> 80.2 -> 79.07 -> 78.44Hurt
Vary RoLoRA local steps per round while keeping total computation fixed (ablation)RoLoRA · MNLI, 50 clientsaccuracy: 84.39 -> 84.96 -> 84.79 -> 82.98No clear effect
Vary RoLoRA local steps per round while keeping total computation fixed (ablation)RoLoRA · QQP, 50 clientsaccuracy: 85.24 -> 85.44 -> 84.77 -> 85.71No clear effect

Surprising findings

Limitations

Experimental setup

Datasets: SST-2 QNLI MNLI QQP RTE MNLI (MNIST-free text partitions) HumanEval MMLU commonsense reasoning tasks (8 tasks incl. PIQA, SIQA)

Benchmarks: GLUE (SST-2, QNLI, MNLI, QQP, RTE) commonsense reasoning (8 tasks) HumanEval MMLU MNIST (toy non-linear model)

Metrics: accuracy standard deviation over seeds

Baselines: LoRA (FedAvg of LoRA) FFA-LoRA FlexLoRA FLoRA

Builds on: LoRA FedAvg FFA-LoRA FedRep FederatedScope-LLM

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy