Pith. sign in

REVIEW 1 cited by

Federated Full-Parameter Tuning of Billion-Sized Language Models with Communication Cost under 18 Kilobytes

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 2312.06353 v5 pith:32MYQQIF submitted 2023-12-11 cs.LG cs.DC

classification cs.LGcs.DC
keywords federatedllmsfine-tuningfull-parametertuningcommunicationdatalanguage
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Pre-trained large language models (LLMs) need fine-tuning to improve their responsiveness to natural language instructions. Federated learning offers a way to fine-tune LLMs using the abundant data on end devices without compromising data privacy. Most existing federated fine-tuning methods for LLMs rely on parameter-efficient fine-tuning techniques, which may not reach the performance height possible with full-parameter tuning. However, federated full-parameter tuning of LLMs is a non-trivial problem due to the immense communication cost. This work introduces FedKSeed that employs zeroth-order optimization with a finite set of random seeds. It significantly reduces transmission requirements between the server and clients to just a few random seeds and scalar gradients, amounting to only a few thousand bytes, making federated full-parameter tuning of billion-sized LLMs possible on devices. Building on it, we develop a strategy enabling probability-differentiated seed sampling, prioritizing perturbations with greater impact on model accuracy. Experiments across six scenarios with various LLMs, datasets and data partitions demonstrate that our approach outperforms existing federated LLM fine-tuning methods in both communication efficiency and new task generalization.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Byzantine-Resilient Zero-Order Optimization for Communication-Efficient Heterogeneous Federated Learning

    cs.LG 2025-01 conditional novelty 6.0 of 10

    CyBeR-0 performs Byzantine-robust federated learning by robustly aggregating zero-order gradient estimates in a low-dimensional random projection space, with non-convex convergence guarantees and large communication savings.

Pith tools