{"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/doubly-stochastic-subspace-clustering","title":"Doubly Stochastic Subspace Clustering","arxiv_id":"2011.14859","date":"2020-11-30","proceeding":null,"authors":["Derek Lim","René Vidal","Benjamin D. Haeffele"],"abstract":"Many state-of-the-art subspace clustering methods follow a two-step process by first constructing an affinity matrix between data points and then applying spectral clustering to this affinity. Most of the research into these methods focuses on the first step of generating the affinity, which often exploits the self-expressive property of linear subspaces, with little consideration typically given to the spectral clustering step that produces the final clustering. Moreover, existing methods often obtain the final affinity that is used in the spectral clustering step by applying ad-hoc or arbitrarily chosen postprocessing steps to the affinity generated by a self-expressive clustering formulation, which can have a significant impact on the overall clustering performance. In this work, we unify these two steps by learning both a self-expressive representation of the data and an affinity matrix that is well-normalized for spectral clustering. In our proposed models, we constrain the affinity matrix to be doubly stochastic, which results in a principled method for affinity matrix normalization while also exploiting known benefits of doubly stochastic normalization in spectral clustering. We develop a general framework and derive two models: one that jointly learns the self-expressive representation along with the doubly stochastic affinity, and one that sequentially solves for one then the other. Furthermore, we leverage sparsity in the problem to develop a fast active-set method for the sequential solver that enables efficient computation on large datasets. Experiments show that our method achieves state-of-the-art subspace clustering performance on many common datasets in computer vision.","url_abs":"https://arxiv.org/abs/2011.14859v2","url_pdf":"https://arxiv.org/pdf/2011.14859v2.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":"doubly-stochastic-subspace-clustering","repo_url":"https://github.com/cptq/SubspaceClusteringJulia","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"image-clustering","task_name":"Image Clustering"}],"methods":[{"method_slug":"spectral-clustering","method_name":"Spectral Clustering"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-clustering-on-extended-yale-b","task":"Image Clustering","dataset":"Extended Yale-B","model":"J-DSSC","rank_in_archive_order":4,"of":9,"metrics":{"Accuracy":"0.924","NMI":"0.952"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-extended-yale-b","task":"Image Clustering","dataset":"Extended Yale-B","model":"A-DSSC","rank_in_archive_order":5,"of":9,"metrics":{"Accuracy":"0.917","NMI":"0.947"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-umist","task":"Image Clustering","dataset":"UMist","model":"J-DSSC (Scattered)","rank_in_archive_order":1,"of":4,"metrics":{"NMI":"0.939"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-umist","task":"Image Clustering","dataset":"UMist","model":"A-DSSC (Scattered)","rank_in_archive_order":2,"of":4,"metrics":{"NMI":"0.935"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-coil-100","task":"Image Clustering","dataset":"coil-100","model":"A-DSSC (Scattered)","rank_in_archive_order":1,"of":10,"metrics":{"Accuracy":"0.984","NMI":"0.997"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-coil-100","task":"Image Clustering","dataset":"coil-100","model":"J-DSSC (Scattered)","rank_in_archive_order":2,"of":10,"metrics":{"Accuracy":"0.961","NMI":"0.992"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-coil-100","task":"Image Clustering","dataset":"coil-100","model":"A-DSSC","rank_in_archive_order":4,"of":10,"metrics":{"Accuracy":"0.824","NMI":"0.946"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-coil-100","task":"Image Clustering","dataset":"coil-100","model":"J-DSSC","rank_in_archive_order":5,"of":10,"metrics":{"Accuracy":"0.796","NMI":"0.943"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-coil-40","task":"Image Clustering","dataset":"coil-40","model":"A-DSSC (Scattered)","rank_in_archive_order":1,"of":3,"metrics":{"Accuracy":"1","NMI":"1"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-coil-40","task":"Image Clustering","dataset":"coil-40","model":"J-DSSC (Scattered)","rank_in_archive_order":2,"of":3,"metrics":{"Accuracy":"1","NMI":"1"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2011.14859","atlas_url":"https://app.syntology.ai/?focus=2011.14859","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":"2011.14859"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2011.14859\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2011.14859"},"call":"get_concepts_for_paper(arxiv_id=\"2011.14859\")"}],"by_repo":[{"repo":"cptq/SubspaceClusteringJulia","kind":"official","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":"ae6ab6f668007437a785d1af642dc66f96e4f95764204a9a13f51002faad23c5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}