Federated Low-Rank Adaptation of Foundation Models: Representation, Ownership, Transformation, and Cross-Round Continuity

Low-rank adaptation (LoRA) reduces training and communication costs in federated fine-tuning of foundation models, including large language models (LLMs). However, a given effective weight update generally admits multiple low-rank factorizations. Shared states, private states, residuals, backbone models, and optimizer states may also be transformed during aggregation, refactorization, merging, and client re-entry. These transformations create state-consistency challenges across clients, rounds, and model versions that cannot be fully characterized by parameter averaging or communication volume alone. This survey reviews federated LoRA from a state-lifecycle perspective. It maps existing methods across state representation, ownership, transformation, cross-round continuity, and correctness, while comparing factor-based, effective weight-update, subspace, and composite representations, together with states used to support training and recovery. It also derives exact first-moment transport under fixed invertible factor reparameterization, analyzes the limits of diagonal second-moment migration, and distinguishes four outcomes of version changes: direct reuse, migration, reset, and rejection. The synthesis shows that trainable, uploaded, aggregated, and persistent states must be defined separately; aggregation in factor space is generally not equivalent to aggregation in weight-update space; and refactorization, backbone merging, and structural changes require explicit version management and state-migration rules. Building on these findings, this survey presents an evaluation checklist and research agenda for transformation fidelity, offline recovery, optimizer migration, and long-term storage, providing guidance for federated foundation-model adaptation across diverse deployment settings, including future sixth-generation (6G) edge-intelligence systems.

Authors

Institutions

Publication Details

Journal
Information
Published
2026-11-10
DOI
https://doi.org/10.3390/info17111127
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Federated Low-Rank Adaptation of Foundation Models: Representation, Ownership, Transformation, and Cross-Round Continuity

Y. Jay Guo, Wei Ni, J. Andrew Zhang, Ren Ping Liu et al.
Information
Privacy-Preserving Technologies in Data
article

Federated Low-Rank Adaptation of Foundation Models: Representation, Ownership, Transformation, and Cross-Round Continuity

Y. Jay Guo, Wei Ni, J. Andrew Zhang, Ren Ping Liu, Kai Wu, Xin Yuan, Rongping Zhang
article en

Abstract

Low-rank adaptation (LoRA) reduces training and communication costs in federated fine-tuning of foundation models, including large language models (LLMs). However, a given effective weight update generally admits multiple low-rank factorizations. Shared states, private states, residuals, backbone models, and optimizer states may also be transformed during aggregation, refactorization, merging, and client re-entry. These transformations create state-consistency challenges across clients, rounds, and model versions that cannot be fully characterized by parameter averaging or communication volume alone. This survey reviews federated LoRA from a state-lifecycle perspective. It maps existing methods across state representation, ownership, transformation, cross-round continuity, and correctness, while comparing factor-based, effective weight-update, subspace, and composite representations, together with states used to support training and recovery. It also derives exact first-moment transport under fixed invertible factor reparameterization, analyzes the limits of diagonal second-moment migration, and distinguishes four outcomes of version changes: direct reuse, migration, reset, and rejection. The synthesis shows that trainable, uploaded, aggregated, and persistent states must be defined separately; aggregation in factor space is generally not equivalent to aggregation in weight-update space; and refactorization, backbone merging, and structural changes require explicit version management and state-migration rules. Building on these findings, this survey presents an evaluation checklist and research agenda for transformation fidelity, offline recovery, optimizer migration, and long-term storage, providing guidance for federated foundation-model adaptation across diverse deployment settings, including future sixth-generation (6G) edge-intelligence systems.

InformationVol. 17(11)
University of Technology Sydney (AU), Edith Cowan University (AU), Commonwealth Scientific and Industrial Research Organisation (AU), UNSW Sydney (AU), Data61 (AU)
Privacy-Preserving Technologies in Data
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon