Subspace-Constrained Federated Learning with Low-Rank Adaptation
Federated low-rank adaptation methods are attractive for fine-tuning large models under communication and privacy constraints, but heterogeneous client data can induce geometric misalignment between local low-rank updates. We study whether this subspace misalignment leads to destructive aggregation and slower convergence in LoRA-based federated learning. We propose a subspace-regularized federated LoRA objective that encourages local client updates to remain close to a shared global reference su
Record details
Published: 21 June 2026
Source: arXiv
Category: Research
Topics: Safety & alignment · Privacy
Retrieved: 14 July 2026
Related evidence
These records share source-supplied organisations, an exact publisher byline, automatic topics or regions. The reason is shown on every link; related does not mean supporting, agreeing with or verifying this record.
PrivacyAlign: Contextual Privacy Alignment for LLM Agents
arXiv · 19 June 2026
Challenges to Grassroots Organization Engagement with AI Policy
arXiv · 18 June 2026
RiskNet: A large-scale dataset of AI risk incidents from news with alignment and multi-dimensional annotations
arXiv · 7 June 2026
Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives
arXiv fairness query · 8 July 2026
Trustworthy synthetic data for campaign decision support: strategy simulation fidelity and the PolicySynth framework
arXiv cs.LG · 13 July 2026
Silent Failures in Federated Personalization of Foundation Models
arXiv · 31 May 2026
How to cite this record
ethics.ai (21 June 2026), “Subspace-Constrained Federated Learning with Low-Rank Adaptation,” evidence record 725, https://ethics.ai/record/725 (originally published by arXiv).
Use and limitations
This page is a stable index and citation surface for a source record. ethics.ai did not author the underlying report and has not independently verified every claim. Automatic topics may be imperfect. For consequential use, quote and cite the original publisher.