{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/sepit-approaching-a-single-channel-speech","title":"SepIt: Approaching a Single Channel Speech Separation Bound","arxiv_id":"2205.11801","date":"2022-05-24","proceeding":null,"authors":["Shahar Lutati","Eliya Nachmani","Lior Wolf"],"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.","url_abs":"https://arxiv.org/abs/2205.11801v4","url_pdf":"https://arxiv.org/pdf/2205.11801v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[],"tasks":[{"task_slug":"audio-source-separation","task_name":"Audio Source Separation"},{"task_slug":"generalization-bounds","task_name":"Generalization Bounds"},{"task_slug":"multi-speaker-source-separation","task_name":"Multi-Speaker Source Separation"},{"task_slug":"speech-separation","task_name":"Speech Separation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/speech-separation-on-libri10mix","task":"Speech Separation","dataset":"Libri10Mix","model":"SepIt","rank_in_archive_order":2,"of":3,"metrics":{"SI-SDRi":"8.2"},"uses_additional_data":false},{"leaderboard":"/sota/speech-separation-on-libri5mix","task":"Speech Separation","dataset":"Libri5Mix","model":"SepIt","rank_in_archive_order":2,"of":4,"metrics":{"SI-SDRi":"13.7"},"uses_additional_data":true},{"leaderboard":"/sota/speech-separation-on-wsj0-2mix","task":"Speech Separation","dataset":"WSJ0-2mix","model":"SepIt","rank_in_archive_order":14,"of":40,"metrics":{"SI-SDRi":"22.4"},"uses_additional_data":false},{"leaderboard":"/sota/speech-separation-on-wsj0-3mix","task":"Speech Separation","dataset":"WSJ0-3mix","model":"SepIt","rank_in_archive_order":6,"of":9,"metrics":{"SI-SDRi":"20.1"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2205.11801","atlas_url":"https://app.syntology.ai/?focus=2205.11801","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2205.11801"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2205.11801\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2205.11801"},"call":"get_concepts_for_paper(arxiv_id=\"2205.11801\")"}],"by_repo":[],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"6b28638a3226530f66ff2afca33f9d0a421156fa74c7ed56406e3ddd493b03e9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}