Pith. sign in

REVIEW 5 cited by

SLoRA: Federated Parameter Efficient Fine-Tuning of Language Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2308.06522 v1 pith:OIPV75YX submitted 2023-08-12 cs.LG cs.AI

SLoRA: Federated Parameter Efficient Fine-Tuning of Language Models

classification cs.LG cs.AI
keywords fine-tuningdataefficientfederatedmodelssloraacrossedge
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Transfer learning via fine-tuning pre-trained transformer models has gained significant success in delivering state-of-the-art results across various NLP tasks. In the absence of centralized data, Federated Learning (FL) can benefit from distributed and private data of the FL edge clients for fine-tuning. However, due to the limited communication, computation, and storage capabilities of edge devices and the huge sizes of popular transformer models, efficient fine-tuning is crucial to make federated training feasible. This work explores the opportunities and challenges associated with applying parameter efficient fine-tuning (PEFT) methods in different FL settings for language tasks. Specifically, our investigation reveals that as the data across users becomes more diverse, the gap between fully fine-tuning the model and employing PEFT methods widens. To bridge this performance gap, we propose a method called SLoRA, which overcomes the key limitations of LoRA in high heterogeneous data scenarios through a novel data-driven initialization technique. Our experimental results demonstrate that SLoRA achieves performance comparable to full fine-tuning, with significant sparse updates with approximately $\sim 1\%$ density while reducing training time by up to $90\%$.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Concordia: Self-Improving Synthetic Tables for Federated LLMs

    cs.LG 2026-05 unverdicted novelty 7.0

    Concordia aligns synthetic table generation with federated validation utility via client-side utility scorers and group-relative policy optimization to improve LLM adaptation on non-IID tabular tasks.

  2. FedSmoothLoRA: Toward Smoother and Faster Convergence in Federated Low-Rank Adaptation

    cs.CV 2026-05 unverdicted novelty 6.0

    FedSmoothLoRA improves federated LoRA fine-tuning by constructing local initializations from a round-matching matrix for cross-round continuity and a gradient-aligned matrix for client-specific guidance, yielding fast...

  3. Amortizing Federated Adaptation: Hypernetwork Driven LoRA for Personalized Foundation Models

    cs.AI 2026-06 unverdicted novelty 5.0

    HyperLoRA amortizes federated LoRA adaptation via hypernetwork-generated initializations and product-space aggregation to fix structural bias and initialization lag.

  4. Concordia: Self-Improving Synthetic Tables for Federated LLMs

    cs.LG 2026-05 unverdicted novelty 5.0

    Concordia aligns synthetic table generation with federated validation utility via client-level LoRA training, utility scorers, and outer GRPO refinement to boost performance over static synthetic baselines.

  5. Understanding Communication Backends in Cross-Silo Federated Learning

    cs.DC 2026-04 unverdicted novelty 4.0

    Benchmarks of MPI, gRPC, and PyTorch RPC in cross-silo FL plus a new gRPC+S3 hybrid backend deliver up to 3.8x speedup for large-model transmission under realistic network conditions.