{"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/spectralnet-spectral-clustering-using-deep","title":"SpectralNet: Spectral Clustering using Deep Neural Networks","arxiv_id":"1801.01587","date":"2018-01-04","proceeding":"ICLR 2018 1","authors":["Uri Shaham","Kelly Stanton","Henry Li","Boaz Nadler","Ronen Basri","Yuval Kluger"],"abstract":"Spectral clustering is a leading and popular technique in unsupervised data\nanalysis. Two of its major limitations are scalability and generalization of\nthe spectral embedding (i.e., out-of-sample-extension). In this paper we\nintroduce a deep learning approach to spectral clustering that overcomes the\nabove shortcomings. Our network, which we call SpectralNet, learns a map that\nembeds input data points into the eigenspace of their associated graph\nLaplacian matrix and subsequently clusters them. We train SpectralNet using a\nprocedure that involves constrained stochastic optimization. Stochastic\noptimization allows it to scale to large datasets, while the constraints, which\nare implemented using a special-purpose output layer, allow us to keep the\nnetwork output orthogonal. Moreover, the map learned by SpectralNet naturally\ngeneralizes the spectral embedding to unseen data points. To further improve\nthe quality of the clustering, we replace the standard pairwise Gaussian\naffinities with affinities leaned from unlabeled data using a Siamese network.\nAdditional improvement can be achieved by applying the network to code\nrepresentations produced, e.g., by standard autoencoders. Our end-to-end\nlearning procedure is fully unsupervised. In addition, we apply VC dimension\ntheory to derive a lower bound on the size of SpectralNet. State-of-the-art\nclustering results are reported on the Reuters dataset. Our implementation is\npublicly available at https://github.com/kstant0725/SpectralNet .","url_abs":"http://arxiv.org/abs/1801.01587v6","url_pdf":"http://arxiv.org/pdf/1801.01587v6.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":"spectralnet-spectral-clustering-using-deep","repo_url":"https://github.com/kstant0725/SpectralNet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"spectralnet-spectral-clustering-using-deep","repo_url":"https://github.com/yuhanghe01/OpenClustering","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"spectralnet-spectral-clustering-using-deep","repo_url":"https://github.com/shaham-lab/SpectralNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"stochastic-optimization","task_name":"Stochastic Optimization"}],"methods":[{"method_slug":"spectral-clustering","method_name":"Spectral Clustering"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1801.01587","atlas_url":"https://app.syntology.ai/?focus=1801.01587","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":"1801.01587"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1801.01587\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1801.01587"},"call":"get_concepts_for_paper(arxiv_id=\"1801.01587\")"}],"by_repo":[{"repo":"kstant0725/SpectralNet","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"yuhanghe01/OpenClustering","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"shaham-lab/SpectralNet","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":"fb9f3579b7b400757734ee33d6f847a6df63067853864e1f0b5d656deadc1e70","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}