{"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/alternative-objective-functions-for-deep","title":"Alternative Objective Functions for Deep Clustering","arxiv_id":null,"date":"2018-04-01","proceeding":"ICASSP 2018 4","authors":["Wang","Z.-Q.; Le Roux","J.; Hershey","J.R"],"abstract":"The recently proposed deep clustering framework represents a significant step towards solv-ing the cocktail party problem. This study proposes and compares a variety of alternativeobjective functions for training deep clustering networks. In addition, whereas the originaldeep clustering work relied on k-means clustering for test-time inference, here we investigateinference methods that are matched to the training objective. Furthermore, we explore theuse of an improved chimera network architecture for speech separation, which combines deepclustering with mask-inference networks in a multiobjective training scheme. The deep clus-tering loss acts as a regularizer while training the end-to-end mask inference network for bestseparation. With further iterative phase reconstruction, our best proposed method achievesa state-of-the-art 11.5 dB signal-to-distortion ratio (SDR) result on the publicly availablewsj0-2mix dataset, with a much simpler architecture than the previous best approach.","url_abs":"https://www.merl.com/publications/docs/TR2018-005.pdf","url_pdf":"https://www.merl.com/publications/docs/TR2018-005.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":[{"paper_slug":"alternative-objective-functions-for-deep","repo_url":"https://github.com/mpariente/asteroid","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"deep-clustering","task_name":"Deep Clustering"},{"task_slug":"speech-separation","task_name":"Speech Separation"}],"methods":[{"method_slug":"k-means-clustering","method_name":"k-Means Clustering"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/speech-separation-on-wsj0-2mix","task":"Speech Separation","dataset":"WSJ0-2mix","model":"Chimera++","rank_in_archive_order":38,"of":40,"metrics":{"SI-SDRi":"11.5"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"mpariente/asteroid","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2008.00264"],"harvested_for_calls":[{"arxiv_id":"2008.00264","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2008.00264"},"call":"get_harvested_code_for_paper(arxiv_id=\"2008.00264\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"8f85f16f1b9782f23ecd58b703f1c04be6786f979f1746f1e552b3e6fe262c8a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}