Pith. sign in

REVIEW 1 cited by

Transkimmer: Transformer Learns to Layer-wise Skim

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 2205.07324 v1 pith:CEKO7UNX submitted 2022-05-15 cs.CL

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

Transformer architecture has become the de-facto model for many machine learning tasks from natural language processing and computer vision. As such, improving its computational efficiency becomes paramount. One of the major computational inefficiency of Transformer-based models is that they spend the identical amount of computation throughout all layers. Prior works have proposed to augment the Transformer model with the capability of skimming tokens to improve its computational efficiency. However, they suffer from not having effectual and end-to-end optimization of the discrete skimming predictor. To address the above limitations, we propose the Transkimmer architecture, which learns to identify hidden state tokens that are not required by each layer. The skimmed tokens are then forwarded directly to the final output, thus reducing the computation of the successive layers. The key idea in Transkimmer is to add a parameterized predictor before each layer that learns to make the skimming decision. We also propose to adopt reparameterization trick and add skim loss for the end-to-end training of Transkimmer. Transkimmer achieves 10.97x average speedup on GLUE benchmark compared with vanilla BERT-base baseline with less than 1% accuracy degradation.

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. Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism

    cs.LG 2024-11 reject novelty 2.0 of 10

    The paper claims that a sparse attention mechanism, embodied in a custom GPT named GiantRabbit, reduces chain-of-thought reasoning time and length versus o1 Preview on nine linear algebra questions, at some accuracy cost.

Pith tools