Challenge: Attention pruning techniques have been developed to identify and exploit sparseness . previous work has taken pioneering steps to discover and explain the sparsity in attention patterns .
Approach: They propose a framework that observes attention patterns in a fixed dataset and generates a global sparseness mask.
Outcome: The proposed approach saves 90% of computations and maintains quality of results.

Similar Papers

DAM: Dynamic Attention Mask for Long-Context Large Language Model Inference Acceleration (2025.findings-acl)

Copied to clipboard

Challenge: Long-context understanding is crucial for many NLP applications, but transformers struggle with efficiency due to quadratic complexity of self-attention.
Approach: They propose a dynamic sparse attention mechanism that assigns adaptive masks at the attention-map level, preserving heterogeneous attention patterns.
Outcome: The proposed method achieves high alignment with full-attention models while reducing memory and compute overhead.
Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention (2025.acl-long)

Copied to clipboard

Challenge: Long-context modeling is crucial for next-generation language models, but high computational cost of standard attention mechanisms poses significant computational challenges.
Approach: They propose a natively trained Sparse Attention mechanism that integrates algorithms with hardware-aligned optimizations to achieve efficient long-context modeling.
Outcome: The proposed model maintains or exceeds Full Attention models across general benchmarks, long-context tasks, and instruction-based reasoning.
Gradient-based Intra-attention Pruning on Pre-trained Language Models (2023.acl-long)

Copied to clipboard

Challenge: Pre-trained language models are computationally expensive and slow in inference due to their large sizes.
Approach: They propose a structured pruning method which combines pruning with knowledge distillation to yield highly effective models.
Outcome: The proposed method outperforms other pruning methods in sparsity regimes while maintaining 93% 99% performance.
Cross-layer Attention Sharing for Pre-trained Large Language Models (2026.tacl-1)

Copied to clipboard

Challenge: Existing studies focus on compressing the Key-Value cache or grouping attention heads, while overlooking redundancy between layers.
Approach: They propose a lightweight substitute for self-attention in well-trained LLMs that uses feed-forward networks to align attention heads between adjacent layers and low-rank matrices to approximate differences in layer-wise attention weights.
Outcome: The proposed model reduces redundancy by sharing weights across layers while maintaining high response quality while reducing redundant calculations within 53% 84% of the total layers.
The Sparse Frontier: Sparse Attention Trade-offs in Transformer LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Sparse attention is a promising strategy to extend long-context capabilities in LLMs . but its efficiency–accuracy trade-offs remain unclear due to the lack of comprehensive evaluation .
Approach: They evaluate sparse attention methods across multiple model families and sizes . they find larger sparser models outperform smaller dense ones at equivalent cost .
Outcome: The proposed methods outperform smaller sparse models at equivalent cost and improve the Pareto frontier.
Structured Pruning for Efficient Generative Pre-trained Language Models (2023.findings-acl)

Copied to clipboard

Challenge: Large-scale generative Pre-trained Language Models (PLMs) are limited in their deployment in real-world applications.
Approach: They propose to prune the feed-forward networks of generative pre-trained language models to smaller widths without designing extra operators.
Outcome: The proposed method achieves 1.51x/6.96x inference speedup on GPU/CPU with 67% size reduction.
Beyond Fully Random Masking: Attention-Guided Denoising and Optimization for Diffusion Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for full-attention dLLMs rely on random masking strategies that overlook intrinsic token dependencies.
Approach: They propose an attention-guided denoising and optimization framework that aligns training and optimization with attention-derived dependencies.
Outcome: The proposed framework outperforms state-of-the-art methods on mathematical and coding benchmarks.
Rethinking Network Pruning – under the Pre-train and Fine-tune Paradigm (2021.naacl-main)

Copied to clipboard

Challenge: Existing pruning results on benchmark transformers, such as BERT, are not as remarkable as those of convolutional neural networks.
Approach: They propose to apply a knowledge-aware pruning process to transformer-based pre-trained language models to reduce model size and model weight.
Outcome: The proposed pruning method outperforms the leading competitors with a 20-times weight/FLOPs compression and neglectable loss in prediction accuracy.
Attending via both Fine-tuning and Compressing (2021.findings-acl)

Copied to clipboard

Challenge: Existing studies show that attention mechanisms can improve models' interpretation, but they are not explicable.
Approach: They propose a framework consisting of a learner and a compressor to purify attention scores . they propose to fine-tune and compress the attention mechanism to obtain a more faithful explanation .
Outcome: The proposed framework improves performance and interpretability on eight benchmark datasets.
Focus-dLLM: Accelerating Long-Context Diffusion LLM Inference via Confidence-Guided Context Focusing (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for estimating attention importance for tokens are ineffective . dLLMs require bidirectional attention, which limits inference efficiency .
Approach: They propose a training-free attention sparsification framework for efficient long-context inference . they propose 'sink-aware pruning strategy' to accurately estimate and remove redundant computation .
Outcome: The proposed approach offers 29 lossless speedup under 32K context length.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations