mlsanityData to 7 Oct 2026

La RoSA: Enhancing LLM Efficiency via Layerwise Rotated Sparse Activation

arXiv 2507.01299 ↗First posted 2 Jul 2025cs.CLcited by 5

Not on the map. Why?

Abstract (arXiv)

Activation sparsity can reduce the computational overhead and memory transfers during the forward pass of Large Language Model (LLM) inference. Existing methods face limitations, either demanding time-consuming recovery training that hinders real-world adoption, or relying on empirical magnitude-based pruning, which causes fluctuating sparsity and unstable inference speed-up. This paper introduces LaRoSA (Layerwise Rotated Sparse Activation), a novel method for activation sparsification designed to improve LLM efficiency without requiring additional training or magnitude-based pruning. We leverage layerwise orthogonal rotations to transform input activations into rotated forms that are more suitable for sparsification. By employing a Top-K selection approach within the rotated activations, we achieve consistent model-level sparsity and reliable wall-clock time speed-up. LaRoSA is effective across various sizes and types of LLMs, demonstrating minimal performance degradation and robust inference acceleration. Specifically, for LLaMA2-7B at 40% sparsity, LaRoSA achieves a mere 0.17 perplexity gap with a consistent 1.30x wall-clock time speed-up, and reduces the accuracy gap in zero-shot tasks compared to the dense model to just 0.54%, while surpassing TEAL by 1.77% and CATS by 17.14%.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 34 of its 45 references that are in the map. First posted on arXiv 2 Jul 2025.

Builds on

34 of 45 references.

References · 34

  1. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  2. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  3. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  4. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
  5. 2023Let's Verify Step by Stepcited by 3,598
  6. 2016Pointer Sentinel Mixture Modelscited by 2,992
  7. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  8. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
  9. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  10. 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
  11. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  12. 2020GLU Variants Improve Transformercited by 1,724
22 more
  1. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  2. 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
  3. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
  4. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
  5. 2024QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMscited by 598
  6. 2024SpinQuant: LLM quantization with learned rotationscited by 446
  7. 2023OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Modelscited by 403
  8. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
  9. 2023PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPUcited by 210
  10. 2023LLM in a flash: Efficient Large Language Model Inference with Limited Memorycited by 170
  11. 2024DuQuant: Distributing Outliers via Dual Transformation Makes Stronger Quantized LLMscited by 165
  12. 2021Primer: Searching for Efficient Transformers for Language Modelingcited by 162
  13. 2022The Lazy Neuron Phenomenon: On Emergence of Activation Sparsity in Transformerscited by 121
  14. 2020Data Movement Is All You Need: A Case Study on Optimizing Transformerscited by 108
  15. 2023ReLU Strikes Back: Exploiting Activation Sparsity in Large Language Modelscited by 91
  16. 2024ReLU2 Wins: Discovering Efficient Activation Functions for Sparse LLMscited by 66
  17. 2023SparseViT: Revisiting Activation Sparsity for Efficient High-Resolution Vision Transformercited by 60
  18. 2024Training-Free Activation Sparsity in Large Language Modelscited by 51
  19. 2024MaskLLM: Learnable Semi-Structured Sparsity for Large Language Modelscited by 49
  20. 2024ProSparse: Introducing and Enhancing Intrinsic Activation Sparsity within Large Language Modelscited by 43
  21. 2024Turbo Sparse: Achieving LLM SOTA Performance with Minimal Activated Parameterscited by 37
  22. 2024Q-Sparse: All Large Language Models can be Fully Sparsely-Activatedcited by 24

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 3.

5 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025R-Sparse: Rank-Aware Activation Sparsity for Efficient LLM Inference
  2. 2026WiSparse: Boosting LLM Inference Efficiency with Weight-Aware Mixed Activation Sparsity
  3. 2026TopK-Guided: Adaptive, Budget-Aware Activation Sparsity for Efficient LLM Inference
  4. 2025Accelerating LLM Inference with Flexible N:M Sparsity via A Fully Digital Compute-in-Memory Accelerator
  5. 2023Sparse Fine-tuning for Inference Acceleration of Large Language Models
  6. 2026SPARQLe: Sub-Precision Activation Representation for Quantized LLM Inference ↗
  7. 2024Enabling High-Sparsity Foundational Llama Models with Efficient Pretraining and Deployment
  8. 2026ELAS: Efficient Pre-Training of Low-Rank Large Language Models via 2:4 Activation Sparsity