REVIEW 3 cited by
Dynamic Context Pruning for Efficient and Interpretable Autoregressive Transformers
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
abstract
Autoregressive Transformers adopted in Large Language Models (LLMs) are hard to scale to long sequences. Despite several works trying to reduce their computational cost, most of LLMs still adopt attention layers between all pairs of tokens in the sequence, thus incurring a quadratic cost. In this study, we present a novel approach that dynamically prunes contextual information while preserving the model's expressiveness, resulting in reduced memory and computational requirements during inference. Our method employs a learnable mechanism that determines which uninformative tokens can be dropped from the context at any point across the generation process. By doing so, our approach not only addresses performance concerns but also enhances interpretability, providing valuable insight into the model's decision-making process. Our technique can be applied to existing pre-trained models through a straightforward fine-tuning process, and the pruning strength can be specified by a sparsity parameter. Notably, our empirical findings demonstrate that we can effectively prune up to 80\% of the context without significant performance degradation on downstream tasks, offering a valuable tool for mitigating inference costs. Our reference implementation achieves up to $2\times$ increase in inference throughput and even greater memory savings.
Forward citations
Cited by 3 Pith papers
-
Provence: efficient and robust context pruning for retrieval-augmented generation
Provence prunes and reranks retrieved contexts in one pass, compressing 50-80% of the context while keeping question-answering accuracy close to the full-context baseline.
-
CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation
CSR compresses LLM key-value caches through sparse dictionary coding, reaching 1 bit per cache value while roughly matching 2-bit and 4-bit quantization baselines on LongBench.
-
CITER: Collaborative Inference for Efficient Large Language Model Decoding with Token-Level Routing
CITER trains a token-level router with preference optimization to route non-critical tokens to a small model and critical tokens to a large model, reducing inference cost on QA and math benchmarks.
Discussion (0). Continue with ORCID to comment.