UniAttn: Reducing Inference Costs via Softmax Unification for Post-Training LLMs
Not on the map. Why?
Abstract (arXiv)
Post-training is essential for adapting Large Language Models (LLMs) to real-world applications. Deploying post-trained models faces significant challenges due to substantial memory overhead and noticeable inference latency. Existing work has identified significant redundancies in LLMs and proposed efficient architectures, namely intra-layer KV sharing and cross-layer KV sharing. However, these methods still result in high inference time overhead, remaining suboptimal for post-training pre-trained LLMs. In this paper, we identify that the textttSoftmax operation is a primary bottleneck for LLM inference and discover that it is actually highly redundant during post-training. We propose Softmax Unification in Attention (UniAttn), a novel post-training method that unifies Softmax activations across transformer blocks to reduce LLM inference costs. Additionally, UniAttn adopts a linear projection to compensate for the errors induced by Softmax unification. Experiments show that UniAttn matches the performance of standard post-training while significantly reducing inference costs, outperforming existing efficient architectures during post-training.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 30 of its 44 references that are in the map. First posted on arXiv 1 Feb 2025.
Builds on
30 of 44 references.
References · 30
- 2023GPT-4 Technical Reportcited by 18,132
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2023Visual Instruction Tuningcited by 7,792
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2023Qwen Technical Reportcited by 3,273
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,793
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
- 2020What Disease does this Patient Have? A Large-scale Open Domain Question Answering Dataset from Medical Examscited by 1,324
- 2019PubMedQA: A Dataset for Biomedical Research Question Answeringcited by 1,271
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,270
18 more
- 2022Token Merging: Your ViT But Fastercited by 995
- 2024Tulu 3: Pushing Frontiers in Open Language Model Post-Trainingcited by 988
- 2020On Layer Normalization in the Transformer Architecturecited by 906
- 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 700
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2024An Image is Worth 1/2 Tokens After Layer 2: Plug-and-Play Inference Acceleration for Large Vision-Language Modelscited by 629
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
- 2022DeepNet: Scaling Transformers to 1,000 Layerscited by 176
- 2024You Only Cache Once: Decoder-Decoder Architectures for Language Modelscited by 135
- 2024Reducing Transformer Key-Value Cache Size with Cross-Layer Attentioncited by 122
- 2024LongAlign: A Recipe for Long Context Alignment of Large Language Modelscited by 102
- 2023Goat: Fine-tuned LLaMA Outperforms GPT-4 on Arithmetic Taskscited by 84
- 2024What Matters in Transformers? Not All Attention is Neededcited by 83
- 2022SimA: Simple Softmax-free Attention for Vision Transformerscited by 32
- 2024Your Transformer is Secretly Linearcited by 23
- 2024PYRA: Parallel Yielding Re-Activation for Training-Inference Efficient Task Adaptationcited by 17
- 2024ConSmax: Hardware-Friendly Alternative Softmax with Learnable Parameterscited by 14
- 2024Breaking the Stage Barrier: A Novel Single-Stage Approach to Long Context Extension for Large Language Modelscited by 1
Built on by
Citing papers per year: 2025: 3.
3 papers.
- 2025Neutralizing Token Aggregation via Information Augmentation for Efficient Test-Time Adaptationcited by 2
- 2025DiffusionCom: Structure-Aware Multimodal Diffusion Model for Multimodal Knowledge Graph Completioncited by 1
- 2025ELMM: Efficient Lightweight Multimodal Large Language Models for Multimodal Knowledge Graph Completioncited by 1
- 2025ELMM: Efficient Lightweight Multimodal Large Language Models for Multimodal Knowledge Graph Completion19 Oct 2025
- 2025Neutralizing Token Aggregation via Information Augmentation for Efficient Test-Time Adaptation5 Aug 2025
- 2025DiffusionCom: Structure-Aware Multimodal Diffusion Model for Multimodal Knowledge Graph Completion9 Apr 2025