{"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/the-hidden-convexity-of-spectral-clustering","title":"The Hidden Convexity of Spectral Clustering","arxiv_id":"1403.0667","date":"2014-03-04","proceeding":null,"authors":["James Voss","Mikhail Belkin","Luis Rademacher"],"abstract":"In recent years, spectral clustering has become a standard method for data\nanalysis used in a broad range of applications. In this paper we propose a new\nclass of algorithms for multiway spectral clustering based on optimization of a\ncertain \"contrast function\" over the unit sphere. These algorithms, partly\ninspired by certain Independent Component Analysis techniques, are simple, easy\nto implement and efficient.\n  Geometrically, the proposed algorithms can be interpreted as hidden basis\nrecovery by means of function optimization. We give a complete characterization\nof the contrast functions admissible for provable basis recovery. We show how\nthese conditions can be interpreted as a \"hidden convexity\" of our optimization\nproblem on the sphere; interestingly, we use efficient convex maximization\nrather than the more common convex minimization. We also show encouraging\nexperimental results on real and simulated data.","url_abs":"http://arxiv.org/abs/1403.0667v3","url_pdf":"http://arxiv.org/pdf/1403.0667v3.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":"the-hidden-convexity-of-spectral-clustering","repo_url":"https://github.com/vossj/HBR-Spectral-Clustering","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"methods":[{"method_slug":"spectral-clustering","method_name":"Spectral Clustering"}],"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":"vossj/HBR-Spectral-Clustering","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":"49445be6ae73d7168a09c56ff9d9fba61245ef94ec43c041c2969f366c3ead5f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}