paper-with-me

홈 › Papers

SepPrune: Structured Pruning for Efficient Deep Speech Separation

2025-05-17 · Yuqi Li, Kai Li, Xin Yin, Zhifei Yang, Junhao Dong, Zeyu Dong, Chuanguang Yang, YingLi Tian, Yao Lu

Although deep learning has substantially advanced speech separation in recent years, most existing studies continue to prioritize separation quality while overlooking computational efficiency, an essential factor for low-latency speech processing in real-time applications. In this paper, we propose SepPrune, the first structured pruning framework specifically designed to compress deep speech separation models and reduce their computational cost. SepPrune begins by analyzing the computational structure of a given model to identify layers with the highest computational burden. It then introduces a differentiable masking strategy to enable gradient-driven channel selection. Based on the learned masks, SepPrune prunes redundant channels and fine-tunes the remaining parameters to recover performance. Extensive experiments demonstrate that this learnable pruning paradigm yields substantial advantages for channel pruning in speech separation models, outperforming existing methods. Notably, a model pruned with SepPrune can recover 85% of the performance of a pre-trained model (trained over hundreds of epochs) with only one epoch of fine-tuning, and achieves convergence 36$\times$ faster than training from scratch. Code is available at https://github.com/itsnotacie/SepPrune.

📄 PDF Abstract BibTeX arXiv:2505.12079

Code (1)

itsnotacie/sepprune 공식 구현 pytorch

Tasks

channel selectionComputational EfficiencySpeech Separation

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

SepPrune:A Separator-based Pruning Framework for Efficient Multimodal Large Language Models

2026-07-28 · Yuchen Wang, Qihui Zhu, Yang Liu, Xiaoyan Sun 외 arxiv

Recent multimodal large language models (MLLMs), such as Qwen2.5-VL and InternVL3, generate large numbers of vision tokens for high-resolution inputs, leading to substantial computational cost. Existing vision token prun…

Structured vs. Unstructured Pruning: An Exponential Gap

2026-02-13 · Davide Ferre', Frédéric Giroire, Frederik Mallmann-Trenn, Emanuele Natale arxiv

The Strong Lottery Ticket Hypothesis (SLTH) states that large, randomly initialized neural networks contain sparse subnetworks capable of approximating a target function at initialization without training, suggesting tha…

RED : Looking for Redundancies for Data-Free Structured Compression of Deep Neural Networks

2021-05-31 · Edouard Yvinec, Arnaud Dapogny, Matthieu Cord, Kevin Bailly

Deep Neural Networks (DNNs) are ubiquitous in today's computer vision land-scape, despite involving considerable computational costs. The mainstream approaches for runtime acceleration consist in pruning connections (uns…

Automatic Complementary Separation Pruning Toward Lightweight CNNs

2025-05-19 · David Levin, Gonen Singer

In this paper, we present Automatic Complementary Separation Pruning (ACSP), a novel and fully automated pruning method for convolutional neural networks. ACSP integrates the strengths of both structured pruning and acti…

RED : Looking for Redundancies for Data-FreeStructured Compression of Deep Neural Networks

2021-12-01 · NeurIPS 2021 12 · Edouard Yvinec, Arnaud Dapogny, Matthieu Cord, Kevin Bailly

Deep Neural Networks (DNNs) are ubiquitous in today's computer vision landscape, despite involving considerable computational costs. The mainstream approaches for runtime acceleration consist in pruning connections (unst…