Layer-Adaptive State Pruning for Deep State Space Models
Minseon Gwak, Seongrok Moon, Joohwan Ko, PooGyeon Park
TL;DR
This work addresses the inefficiency of large state dimensions in deep diagonal state-space models by introducing Layer-Adaptive STate pruning (LAST). LAST computes per-state H_infty-based importance scores and applies energy normalization to enable cross-layer, global pruning without retraining, while preserving stability via Hurwitz-parameterized diagonal SSMs. Across diverse benchmarks, LAST demonstrates substantial compressibility—averaging about 33% state reduction—with minimal accuracy loss (e.g., ~0.5%) in MIMO settings, and shows robust performance without retraining. The proposed approach provides a principled, transferable method to shrink state spaces in SSMs, enabling more efficient inference and training while maintaining stability guarantees.
Abstract
Due to the lack of state dimension optimization methods, deep state space models (SSMs) have sacrificed model capacity, training search space, or stability to alleviate computational costs caused by high state dimensions. In this work, we provide a structured pruning method for SSMs, Layer-Adaptive STate pruning (LAST), which reduces the state dimension of each layer in minimizing model-level output energy loss by extending modal truncation for a single system. LAST scores are evaluated using the $\mathcal{H}_{\infty}$ norms of subsystems and layer-wise energy normalization. The scores serve as global pruning criteria, enabling cross-layer comparison of states and layer-adaptive pruning. Across various sequence benchmarks, LAST optimizes previous SSMs, revealing the redundancy and compressibility of their state spaces. Notably, we demonstrate that, on average, pruning 33% of states still maintains performance with 0.52% accuracy loss in multi-input multi-output SSMs without retraining. Code is available at https://github.com/msgwak/LAST.
