Pith. sign in

REVIEW 3 cited by

APT: Adaptive Pruning and Tuning Pretrained Language Models for Efficient Training and Inference

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 2401.12200 v2 pith:DAX7WQUB submitted 2024-01-22 cs.CL cs.LG

classification cs.CLcs.LG
keywords parametersinferencetrainingefficiencyfine-tuningmodelsmemorypruning
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Fine-tuning and inference with large Language Models (LM) are generally known to be expensive. Parameter-efficient fine-tuning over pretrained LMs reduces training memory by updating a small number of LM parameters but does not improve inference efficiency. Structured pruning improves LM inference efficiency by removing consistent parameter blocks, yet often increases training memory and time. To improve both training and inference efficiency, we introduce APT that adaptively prunes and tunes parameters for the LMs. At the early stage of fine-tuning, APT dynamically adds salient tuning parameters for fast and accurate convergence while discarding unimportant parameters for efficiency. Compared to baselines, our experiments show that APT maintains up to 98% task performance when pruning RoBERTa and T5 models with 40% parameters left while keeping 86.4% LLaMA models' performance with 70% parameters remained. Furthermore, APT speeds up LMs fine-tuning by up to 8x and reduces large LMs memory training footprint by up to 70%.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. FineGates: LLMs Finetuning with Compression using Stochastic Gates

    cs.LG 2024-12 conditional novelty 6.0 of 10

    FineGates uses stochastic gates to prune structured rows and columns of a transformer during fine-tuning, matching LoRA accuracy while removing up to 20-40% of weights.

  2. FTP: A Fine-grained Token-wise Pruner for Large Language Models via Token Routing

    cs.CL 2024-12 reject novelty 6.0 of 10

    A token-wise pruner with a learned router and a genetic-algorithm sparsity scheduler claims near-lossless LLM inference at 22-40% token sparsity.

  3. EfficientLLM: Efficiency in Large Language Models

    cs.CL 2025-05 conditional novelty 5.0 of 10

    A large-scale benchmark of LLM efficiency techniques finds that every method trades off one resource for another, with the best choice depending on model scale, task, and hardware.

Pith tools