{"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/self-paced-multi-task-clustering","title":"Self-Paced Multi-Task Clustering","arxiv_id":"1808.08068","date":"2018-08-24","proceeding":null,"authors":["Yazhou Ren","Xiaofan Que","Dezhong Yao","Zenglin Xu"],"abstract":"Multi-task clustering (MTC) has attracted a lot of research attentions in\nmachine learning due to its ability in utilizing the relationship among\ndifferent tasks. Despite the success of traditional MTC models, they are either\neasy to stuck into local optima, or sensitive to outliers and noisy data. To\nalleviate these problems, we propose a novel self-paced multi-task clustering\n(SPMTC) paradigm. In detail, SPMTC progressively selects data examples to train\na series of MTC models with increasing complexity, thus highly decreases the\nrisk of trapping into poor local optima. Furthermore, to reduce the negative\ninfluence of outliers and noisy data, we design a soft version of SPMTC to\nfurther improve the clustering performance. The corresponding SPMTC framework\ncan be easily solved by an alternating optimization method. The proposed model\nis guaranteed to converge and experiments on real data sets have demonstrated\nits promising results compared with state-of-the-art multi-task clustering\nmethods.","url_abs":"http://arxiv.org/abs/1808.08068v1","url_pdf":"http://arxiv.org/pdf/1808.08068v1.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":"self-paced-multi-task-clustering","repo_url":"https://github.com/markWJJ/Multitask-Learning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"markWJJ/Multitask-Learning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"16542e6c27a786b6d9f89a6342c8b84114c85be0775c235890f1d8b0f01a4250","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}