ReGLA: Refining Gated Linear Attention (2025.naacl-long)

Copied to clipboard

Challenge: Recent advances in Large Language Models (LLMs) are known for their computational and storage requirements due to the quadratic computation complexity of softmax attention.
Approach: They propose to reduce the quadratic computation complexity of softmax attention by using feature maps, normalization and the gating mechanism to improve performance.
Outcome: The proposed model outperforms existing gated linear attention models in extensive tasks including training from scratch and post-linearization with continual pre-training.

Similar Papers

Lizard: An Efficient Linearization Framework for Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing linearization frameworks that rely on softmax attention with quadratic time and memory complexity pose significant computational and memory bottlenecks for long-context applications.
Approach: They propose a linearization framework that transforms pretrained Transformer-based Large Language Models into subquadratic architectures that closely approximate softmax attention while preserving model quality.
Outcome: Experiments show that the proposed framework outperforms existing methods by 9.4 - 24.5 points on the 5-shot MMLU benchmark and demonstrating superior associative recall.
Modeling Context With Linear Attention for Scalable Document-Level Translation (2022.findings-emnlp)

Copied to clipboard

Challenge: Document-level machine translation models lack quadratic complexity in the sequence length due to their attention layers.
Approach: They evaluate a recent linear attention model with a sentential gate to promote a recency inductive bias and compare it to open-source document translation.
Outcome: The proposed model significantly improves translation quality on IWSLT 2015 and OpenSubtitles 2018 with similar or better BLEU scores.
ABC: Attention with Bounded-memory Control (2022.acl-long)

Copied to clipboard

Challenge: Existing approaches to attention with bounded-memory control (ABC) have a quadratic complexity in sequence lengths, making it prohibitive for long sequences.
Approach: They propose a new abstraction that bounds memory size to improve efficiency . they propose bounded-memory control, which connects several efficient attention variants .
Outcome: The proposed approach outperforms existing approaches on language modeling, machine translation, and masked language model finetuning.
Sparse Attention with Linear Units (2021.emnlp-main)

Copied to clipboard

Challenge: Recent studies have suggested that sparse attention mechanisms can be made more interpretable by replacing the softmax activation with its sparser variants.
Approach: They propose a method to replace softmax activation with a ReLU to achieve sparsity in attention by layer normalization with either a specialized initialization or an additional gating function.
Outcome: The proposed model is easy to implement and more efficient than previously proposed sparse attention mechanisms.
Analyzing Memorization in Large Language Models through the Lens of Model Attribution (2025.naacl-long)

Copied to clipboard

Challenge: Existing research has focused on extracting memorized content from LLMs or developing memorization metrics without exploring the underlying architectural factors that contribute to memorizing.
Approach: They analyze how attention modules at different layers impact its memorization and generalization performance by using attribution techniques.
Outcome: The proposed model can be used to mitigate memorization while keeping other components like layer normalization and MLP transformations intact.
The Devil in Linear Transformer (2022.emnlp-main)

Copied to clipboard

Challenge: Existing linear transformers suffer from performance degradations on various tasks and corpus.
Approach: They propose a new linear attention that replaces scaling with a normalization to stabilize gradients and confine attention to neighbouring tokens in early layers.
Outcome: The proposed model outperforms vanilla transformers on the long-range arena benchmark while being significantly more space-time efficient.
IAM: Efficient Inference through Attention Mapping between Different-scale LLMs (2025.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) are a challenge due to their internal reasoning processes.
Approach: They propose an algorithm that can optimize attention matrices by performing attention mapping between small and large LLMs.
Outcome: The proposed framework can reduce KV cache usage by 22.1% and accelerate prefill by 15% without sacrificing performance.
GSM-Noise: Exploring and Enhancing Large Language Models’ Reasoning under Noisy Inputs (2026.findings-acl)

Copied to clipboard

Challenge: Large language models struggle when dealing with complex, ill-formed, or noisy inputs . open-source models are less robust, while closed-source ones are more robust .
Approach: They propose to use GSM-Noise to refine inputs before engaging in in-depth analysis to improve LLM robustness under noisy conditions.
Outcome: The proposed model can achieve consistent performance gains under noisy conditions with prompt engineering, supervised finetuning, and reinforcement learning.
Chain and Causal Attention for Efficient Entity Tracking (2024.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to handle entity tracking require at least log2 (n+1) layers to handle n state changes.
Approach: They propose an efficient enhancement to the standard attention mechanism to handle long-term dependencies with a single layer.
Outcome: The proposed model can handle entity tracking with n state changes with a single layer.
Scalable Efficient Training of Large Language Models with Low-dimensional Projected Attention (2024.emnlp-main)

Copied to clipboard

Challenge: Existing studies have found that low-rank pre-training often compromises effectiveness.
Approach: They propose to apply low-dimensional module only to the attention layer to improve both effectiveness and efficiency.
Outcome: The proposed model saves 12.4% time while improving test perplexity and on downstream tasks compared with vanilla Transformer.

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