Pith. sign in

REVIEW 2 cited by

Federated Low-Rank Adaptation with Differential Privacy over Wireless Networks

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 2411.07806 v2 pith:4ZX3BY4S submitted 2024-11-12 cs.LG cs.CReess.SP

classification cs.LGcs.CReess.SP
keywords privacyfedftdevicesnoisewirelessfederatedfine-tuningframework
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Fine-tuning large pre-trained foundation models (FMs) on distributed edge devices presents considerable computational and privacy challenges. Federated fine-tuning (FedFT) mitigates some privacy issues by facilitating collaborative model training without the need to share raw data. To lessen the computational burden on resource-limited devices, combining low-rank adaptation (LoRA) with federated learning enables parameter-efficient fine-tuning. Additionally, the split FedFT architecture partitions an FM between edge devices and a central server, reducing the necessity for complete model deployment on individual devices. However, the risk of privacy eavesdropping attacks in FedFT remains a concern, particularly in sensitive areas such as healthcare and finance. In this paper, we propose a split FedFT framework with differential privacy (DP) over wireless networks, where the inherent wireless channel noise in the uplink transmission is utilized to achieve DP guarantees without adding an extra artificial noise. We shall investigate the impact of the wireless noise on convergence performance of the proposed framework. We will also show that by updating only one of the low-rank matrices in the split FedFT with DP, the proposed method can mitigate the noise amplification effect. Simulation results will demonstrate that the proposed framework achieves higher accuracy under strict privacy budgets compared to baseline methods.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Differentially Private Federated Low Rank Adaptation Beyond Fixed-Matrix

    cs.CR 2025-07 reject novelty 6.0 of 10

    FedASK uses double sketching and server-side SVD to aggregate federated LoRA updates under differential privacy, allowing both A and B matrices to be updated instead of freezing one.

  2. FedGSA: Geometry-Consistent Subspace Aggregation for Differentially Private Federated LoRA

    cs.CR 2026-08 conditional novelty 5.0 of 10

    FedGSA aggregates differentially private federated LoRA updates as subspaces on a Grassmann manifold, improving GLUE and E2E NLG accuracy over Euclidean averaging baselines.

Pith tools