Pith. sign in

REVIEW 2 cited by

SepIt: Approaching a Single Channel Speech Separation Bound

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.11801 v4 pith:GEQCPG4V submitted 2022-05-24 eess.AS cs.LGcs.SDstat.ML

classification eess.AScs.LGcs.SDstat.ML
keywords speakersboundsepitspeechchannelneuralseparationsingle
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We present an upper bound for the Single Channel Speech Separation task, which is based on an assumption regarding the nature of short segments of speech. Using the bound, we are able to show that while the recent methods have made significant progress for a few speakers, there is room for improvement for five and ten speakers. We then introduce a Deep neural network, SepIt, that iteratively improves the different speakers' estimation. At test time, SpeIt has a varying number of iterations per test sample, based on a mutual information criterion that arises from our analysis. In an extensive set of experiments, SepIt outperforms the state-of-the-art neural networks for 2, 3, 5, and 10 speakers.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Flow Matching-Based Speech Source Separation with Best-of-N Biometric Sampling

    cs.SD 2026-07 conditional novelty 5.0 of 10

    A flow-matching speech separator with biometric best-of-N candidate selection and chunk-wise channel alignment achieves competitive separation metrics and the best downstream ASR/SV error rates among evaluated systems...

  2. Multiple Choice Learning for Efficient Speech Separation with Many Speakers

    cs.SD 2024-11 conditional novelty 4.0 of 10

    Multiple choice learning matches permutation invariant training for speech separation on WSJ0-mix and LibriMix with up to 20 speakers, at lower loss-computation cost.

Pith tools