Pith. sign in

REVIEW 2 cited by

AdapLeR: Speeding up Inference by Adaptive Length Reduction

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 2203.08991 v1 pith:P7SCNBF3 submitted 2022-03-16 cs.CL

classification cs.CL
keywords methodcostperformancetokensadaplercomputationaldownstreaminference
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Pre-trained language models have shown stellar performance in various downstream tasks. But, this usually comes at the cost of high latency and computation, hindering their usage in resource-limited settings. In this work, we propose a novel approach for reducing the computational cost of BERT with minimal loss in downstream performance. Our method dynamically eliminates less contributing tokens through layers, resulting in shorter lengths and consequently lower computational cost. To determine the importance of each token representation, we train a Contribution Predictor for each layer using a gradient-based saliency method. Our experiments on several diverse classification tasks show speedups up to 22x during inference time without much sacrifice in performance. We also validate the quality of the selected tokens in our method using human annotations in the ERASER benchmark. In comparison to other widely used strategies for selecting important tokens, such as saliency and attention, our proposed method has a significantly lower false positive rate in generating rationales. Our code is freely available at https://github.com/amodaresi/AdapLeR .

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. C3oT: Generating Shorter Chain-of-Thought without Compromising Effectiveness

    cs.CL 2024-12 conditional novelty 6.0 of 10

    C3oT uses prompt-conditioned fine-tuning on both long and short chain-of-thought data to generate about 50 percent shorter reasoning traces with roughly unchanged accuracy.

  2. LeMo: Enabling LEss Token Involvement for MOre Context Fine-tuning

    cs.CL 2025-01 conditional novelty 5.0 of 10

    LeMo reduces long-context fine-tuning memory by eliminating low-informativeness tokens, predicting sparsity patterns, and optimizing kernels, while keeping perplexity close to LoRA.

Pith tools