修剪
冗余(工程)
算法
计算机科学
离散化
灵敏度(控制系统)
国家(计算机科学)
基质(化学分析)
计算复杂性理论
人工智能
组分(热力学)
变压器
状态空间
时间复杂性
电流(流体)
数学
空格(标点符号)
理论计算机科学
状态空间表示
数据挖掘
高效算法
钥匙(锁)
标识
DOI:10.48550/arxiv.2506.09613
摘要
State-space language models such as Mamba match Transformer quality while permitting linear complexity inference, yet still comprise billions of parameters that hinder deployment. Existing one-shot pruning methods are tailored to attention blocks and fail to account for the time-shared and discretized state-transition matrix at the heart of the selective state-space module (SSM). In this paper, we introduce SparseSSM, the first training-free pruning framework that extends the classic optimal brain surgeon (OBS) framework to state space architectures. Our layer-wise algorithm (i) derives an approximate second-order saliency score that aggregates Hessian-trace information across time steps, (ii) incorporates a component sensitivity analysis to guide feed-forward network (FFN) pruning, which also sheds light on where redundancy resides in mamba architecture, (iii) can be easily extended to semi-structured and structured sparsity. Empirically, we prune 50% of SSM weights without fine-tuning and observe no zero-shot accuracy loss, achieving the current state-of-the-art pruning algorithm for Mamba-based LLMs.
科研通智能强力驱动
Strongly Powered by AbleSci AI