跳到正文
arXiv cs.AI· Marco Deano, Filippo Ziche, Nicola Bombieri·· 9 天前AI 评分22

S4oP:面向资源受限设备的结构化状态空间模型算子级剪枝

S4oP: Operator-level Pruning of Structured State Space Models for Resource-Constrained Devices

AI 导读

研究者提出 S4oP,一种针对 S4 和 S4D 等结构化状态空间模型(SSM)的增量式算子级剪枝方法,通过结构化掩码与微调交替进行,并同步监控精度与推理延迟。实验显示,在多个基准数据集上剪除多达 70% 的模型算子,多数情况下仍能保持原模型性能,同时大幅降低推理延迟。作者称这是首个系统研究 SSM 结构化算子剪枝的工作。

正文 · 原文

View PDF HTML (experimental)

Abstract:Structured State Space Models (SSMs), including the S4 and S4D architectures, have recently emerged as powerful alternatives to attention-based models for capturing long-range dependencies in sequential data. Despite their strong empirical performance, deploying these models in time- and resource-constrained settings remains challenging due to their computational and memory demands. In this paper, we propose a novel incremental, operator-level pruning approach for S4- and S4D-based models that significantly reduces inference cost while preserving predictive performance. To the best of our knowledge, this is the first work to systematically investigate structured operator pruning for SSMs. Our method progressively prunes model operators by interleaving structured masking with fine-tuning, while jointly monitoring accuracy and inference latency. We implement this approach within a unified training and evaluation framework that enables systematic exploration of efficiency-accuracy trade-offs. Experiments across multiple benchmark datasets show that pruning up to 70% of the model operators preserves the performance of the original models in most cases, while substantially reducing inference latency. These results demonstrate that structured operator pruning is an effective and previously unexplored strategy for improving the efficiency of SSMs and facilitate their deployment in practical, resource-constrained scenarios.
Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Distributed, Parallel, and Cluster Computing (cs.DC)
Cite as: arXiv:2606.18096 [cs.LG]
  (or arXiv:2606.18096v2 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2606.18096

arXiv-issued DOI via DataCite

Submission history

From: Marco Deano [view email]
[v1] Tue, 16 Jun 2026 15:59:10 UTC (1,771 KB)
[v2] Thu, 8 Oct 2026 10:32:07 UTC (1,772 KB)

来源:arXiv cs.AI · arxiv.org