Pith. sign in

REVIEW 2 cited by

LadaBERT: Lightweight Adaptation of BERT through Hybrid Model Compression

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 2004.04124 v2 pith:VFPH7IDW submitted 2020-04-08 cs.CL cs.LG

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

Signed reviews

No signed human review yet.

0 comments
read the original abstract

BERT is a cutting-edge language representation model pre-trained by a large corpus, which achieves superior performances on various natural language understanding tasks. However, a major blocking issue of applying BERT to online services is that it is memory-intensive and leads to unsatisfactory latency of user requests, raising the necessity of model compression. Existing solutions leverage the knowledge distillation framework to learn a smaller model that imitates the behaviors of BERT. However, the training procedure of knowledge distillation is expensive itself as it requires sufficient training data to imitate the teacher model. In this paper, we address this issue by proposing a hybrid solution named LadaBERT (Lightweight adaptation of BERT through hybrid model compression), which combines the advantages of different model compression methods, including weight pruning, matrix factorization and knowledge distillation. LadaBERT achieves state-of-the-art accuracy on various public datasets while the training overheads can be reduced by an order of magnitude.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. CURing Large Models: Compression via CUR Decomposition

    cs.LG 2025-01 conditional novelty 6.0 of 10

    CUR decomposition with WANDA-and-DEIM row/column selection compresses LLM weights quickly, and the linking matrix U can be fine-tuned as a PEFT-style healing step.

  2. TensorSLM: Energy-efficient Embedding Compression of Sub-billion Parameter Language Models on Low-end Devices

    cs.CL 2025-06 conditional novelty 4.0 of 10

    TensorSLM applies per-vector tensor-train SVD to compress SLM token embeddings training-free, showing competitive task performance at roughly 2x embedding compression on Raspberry Pi with an estimated, pre-decoder ene...

Pith tools