Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
41 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
41 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Learn To be Efficient: Build Structured Sparsity in Large Language Models (2402.06126v4)

Published 9 Feb 2024 in cs.CL, cs.AI, and cs.LG

Abstract: LLMs have achieved remarkable success with their billion-level parameters, yet they incur high inference overheads. The emergence of activation sparsity in LLMs provides a natural approach to reduce this cost by involving only parts of the parameters for inference. However, existing methods only focus on utilizing this naturally formed activation sparsity in a post-training setting, overlooking the potential for further amplifying this inherent sparsity. In this paper, we hypothesize that LLMs can learn to be efficient by achieving more structured activation sparsity. To achieve this, we introduce a novel training algorithm, Learn-To-be-Efficient (LTE), designed to train efficiency-aware LLMs to learn to activate fewer neurons and achieve a better trade-off between sparsity and performance. Furthermore, unlike SOTA MoEfication methods, which mainly focus on ReLU-based models, LTE can also be applied to LLMs like LLaMA using non-ReLU activations. Extensive evaluation on language understanding, language generation, and instruction tuning tasks show that LTE consistently outperforms SOTA baselines. Along with our hardware-aware custom kernel implementation, LTE reduces LLaMA2-7B inference latency by 25% at 50% sparsity.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (7)
  1. Haizhong Zheng (14 papers)
  2. Xiaoyan Bai (4 papers)
  3. Beidi Chen (61 papers)
  4. Fan Lai (27 papers)
  5. Atul Prakash (36 papers)
  6. Xueshen Liu (3 papers)
  7. Z. Morley Mao (34 papers)
Citations (6)
X Twitter Logo Streamline Icon: https://streamlinehq.com