REVIEW 2 cited by
DeltaZip: Efficient Serving of Multiple Full-Model-Tuned LLMs
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
Signed reviews
read the original abstract
Fine-tuning large language models (LLMs) greatly improves model quality for downstream tasks. However, serving many fine-tuned LLMs concurrently is challenging due to the sporadic, bursty, and varying request patterns of different LLMs. To bridge this gap, we present DeltaZip, an LLM serving system that efficiently serves multiple full-parameter fine-tuned models concurrently by aggressively compressing model deltas by up to 10x while maintaining high model quality. The key insight behind this design is that fine-tuning results in small-magnitude changes to the pre-trained model. By co-designing the serving system with the compression algorithm, DeltaZip achieves 2x to 12x improvement in throughput compared to the state-of-the-art systems.
Forward citations
Cited by 2 Pith papers
-
Dynamic Base model Shift for Delta Compression
A dynamic base-model shift plus two per-task scalars recovers much of the accuracy lost by extreme delta pruning and quantization, though the evaluation tunes the scalars on test-set samples.
-
Quantized Delta Weight Is Safety Keeper
One-bit quantization of fine-tuning delta weights suppresses alignment-breaking and backdoor attacks on LLMs, at the price of measurable utility loss.
Discussion (0). Continue with ORCID to comment.