ASLGSDOct 14, 2019

Dual-path RNN: efficient long sequence modeling for time-domain single-channel speech separation

arXiv:1910.06379v2950 citations
Originality Highly original
AI Analysis

This addresses the problem of long sequence modeling for speech separation researchers, offering a more efficient method that is incremental but provides significant gains.

The paper tackles the challenge of modeling extremely long sequences in time-domain speech separation by proposing the Dual-path RNN (DPRNN), which splits input into chunks for efficient processing, achieving a new state-of-the-art performance on WSJ0-2mix with a 20 times smaller model.

Recent studies in deep learning-based speech separation have proven the superiority of time-domain approaches to conventional time-frequency-based methods. Unlike the time-frequency domain approaches, the time-domain separation systems often receive input sequences consisting of a huge number of time steps, which introduces challenges for modeling extremely long sequences. Conventional recurrent neural networks (RNNs) are not effective for modeling such long sequences due to optimization difficulties, while one-dimensional convolutional neural networks (1-D CNNs) cannot perform utterance-level sequence modeling when its receptive field is smaller than the sequence length. In this paper, we propose dual-path recurrent neural network (DPRNN), a simple yet effective method for organizing RNN layers in a deep structure to model extremely long sequences. DPRNN splits the long sequential input into smaller chunks and applies intra- and inter-chunk operations iteratively, where the input length can be made proportional to the square root of the original sequence length in each operation. Experiments show that by replacing 1-D CNN with DPRNN and apply sample-level modeling in the time-domain audio separation network (TasNet), a new state-of-the-art performance on WSJ0-2mix is achieved with a 20 times smaller model than the previous best system.

Code Implementations8 repos

Data from Papers with Code (CC-BY-SA-4.0)

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes