paper-with-me

Papers

Beyond Factor Aggregation: Gauge-Aware Low-Rank Server Representations for Federated LoRA

2026-05-07 · Jinqian Chen, Chang Liu, Jihua Zhu arxiv

Federated LoRA enables parameter-efficient adaptation of large language models under decentralized data and limited client resources.However, directly averaging LoRA factors is representation-dependent: the same intrinsic update admits infinitely many gauge-equivalent factorizations, so factor-level aggregation can change under arbitrary coordinate choices while the underlying update remains unchanged. This reveals a semantic mismatch in existing federated LoRA aggregation rules. We propose \textbf{GLoRA}, a gauge-aware server representation for federated LoRA.Instead of aggregating raw factors, GLoRA estimates a consensus update subspace from client projectors and aggregates client updates in shared reference coordinates, thereby representing semantic update aggregation entirely in low-rank form. To support heterogeneous client capacities, GLoRA further provides a rank-compatible readout that instantiates adapters of different ranks from the same server state without dense update reconstruction. Experiments on GLUE and SuperNI show that GLoRA consistently outperforms federated LoRA baselines under data, resource, and task heterogeneity, including heterogeneous client ranks, sparse participation, larger backbones, and unseen-task evaluation. GLoRA also achieves a favorable efficiency--performance trade-off, suggesting that effective federated LoRA requires not merely averaging low-rank factors, but defining a semantically meaningful server-side representation for aggregation.

📄 PDF Abstract BibTeX arXiv:2605.06733

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

PRISM: Gauge-Invariant Tangent-Space Differentially Private LoRA

2026-05-31 · Shihao Wang, Xueru Zhang arxiv

Applying differential privacy (DP) via DP-SGD to Low-Rank Adaptation (LoRA) is a natural approach for privacy-preserving fine-tuning. However, LoRA's low-rank parameterization poses a fundamental challenge. In LoRA, each…

Gauge-Equivariant Graph Networks via Self-Interference Cancellation

2025-11-20 · Yoonhyuk Choi, Jiho Choi, Jiwoo Kang arxiv

Graph Neural Networks (GNNs) excel on homophilous graphs but often fail under heterophily due to self-reinforcing and phase-inconsistent signals. We propose a \textbf{G}auge-\textbf{E}quivariant Graph Network with \textb…

Convex relaxations of structured matrix factorizations

2013-09-12 · Francis Bach

We consider the factorization of a rectangular matrix $X $ into a positive linear combination of rank-one factors of the form $u v^\top$, where $u$ and $v$ belongs to certain sets $\mathcal{U}$ and $\mathcal{V}$, that ma…

Globally optimized SVD compression of LLMs via Fermi-function-based rank selection and gauge fixing

2025-11-26 · Roman Rausch, David Jansen, Sukhbinder Singh, Román Orús arxiv

Large Language Models (LLMs) are very demanding in terms of their computational resources. Low-rank decompositions of LLM weights, e.g. via Singular Value Decomposition (SVD), is a promising approach for LLM compression,…

BALF: Budgeted Activation-Aware Low-Rank Factorization for Fine-Tuning-Free Model Compression

2025-09-29 · David González-Martínez arxiv

Activation-aware low-rank factorization techniques yield strong compression results but are generally confined to linear layers, while existing whitening-based theory typically makes an implicit full-rank assumption on a…

Model Compression