{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/sce-scalable-network-embedding-from-sparsest","title":"SCE: Scalable Network Embedding from Sparsest Cut","arxiv_id":"2006.16499","date":"2020-06-30","proceeding":null,"authors":["Shengzhong Zhang","Zengfeng Huang","Haicang Zhou","Ziang Zhou"],"abstract":"Large-scale network embedding is to learn a latent representation for each node in an unsupervised manner, which captures inherent properties and structural information of the underlying graph. In this field, many popular approaches are influenced by the skip-gram model from natural language processing. Most of them use a contrastive objective to train an encoder which forces the embeddings of similar pairs to be close and embeddings of negative samples to be far. A key of success to such contrastive learning methods is how to draw positive and negative samples. While negative samples that are generated by straightforward random sampling are often satisfying, methods for drawing positive examples remains a hot topic. In this paper, we propose SCE for unsupervised network embedding only using negative samples for training. Our method is based on a new contrastive objective inspired by the well-known sparsest cut problem. To solve the underlying optimization problem, we introduce a Laplacian smoothing trick, which uses graph convolutional operators as low-pass filters for smoothing node representations. The resulting model consists of a GCN-type structure as the encoder and a simple loss function. Notably, our model does not use positive samples but only negative samples for training, which not only makes the implementation and tuning much easier, but also reduces the training time significantly. Finally, extensive experimental studies on real world data sets are conducted. The results clearly demonstrate the advantages of our new model in both accuracy and scalability compared to strong baselines such as GraphSAGE, G2G and DGI.","url_abs":"https://arxiv.org/abs/2006.16499v4","url_pdf":"https://arxiv.org/pdf/2006.16499v4.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":"sce-scalable-network-embedding-from-sparsest","repo_url":"https://github.com/szzhang17/Sparsest-Cut-Network-Embedding","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"contrastive-learning","task_name":"Contrastive Learning"},{"task_slug":"network-embedding","task_name":"Network Embedding"}],"methods":[{"method_slug":"dgi","method_name":"DGI"},{"method_slug":"graphsage","method_name":"GraphSAGE"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2006.16499","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16499"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/szzhang17/Sparsest-Cut-Network-Embedding","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_honours":1,"ran_draft_wrong":2,"unverified":4},"by_repo_kind":{"official":{"samples":7,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"5c3fa9402a9405bc","entry":"parse_index_file","repo":"szzhang17/Sparsest-Cut-Network-Embedding","repo_kind":"official","path":"utils.py","file_url":"https://github.com/szzhang17/Sparsest-Cut-Network-Embedding/blob/HEAD/utils.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"code_sha256_prefix":"38d684548e6488e8","entry":"renormalize_adj","repo":"szzhang17/Sparsest-Cut-Network-Embedding","repo_kind":"official","path":"preprocess.py","file_url":"https://github.com/szzhang17/Sparsest-Cut-Network-Embedding/blob/HEAD/preprocess.py","link_basis":"plan_row","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"38d684548e6488e8"}},{"code_sha256_prefix":"c1b14a7851940dca","entry":"to_binary_bag_of_words","repo":"szzhang17/Sparsest-Cut-Network-Embedding","repo_kind":"official","path":"preprocess.py","file_url":"https://github.com/szzhang17/Sparsest-Cut-Network-Embedding/blob/HEAD/preprocess.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c1b14a7851940dca"}},{"code_sha256_prefix":"17a2ef0bd1d83cbb","entry":"load_adj_neg","repo":"szzhang17/Sparsest-Cut-Network-Embedding","repo_kind":"official","path":"utils.py","file_url":"https://github.com/szzhang17/Sparsest-Cut-Network-Embedding/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"17a2ef0bd1d83cbb"}},{"code_sha256_prefix":"3fdc9f593c684be4","entry":"normalize_adj","repo":"szzhang17/Sparsest-Cut-Network-Embedding","repo_kind":"official","path":"preprocess.py","file_url":"https://github.com/szzhang17/Sparsest-Cut-Network-Embedding/blob/HEAD/preprocess.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3fdc9f593c684be4"}},{"code_sha256_prefix":"ef3bae1c388522c4","entry":"normalize_adj","repo":"szzhang17/Sparsest-Cut-Network-Embedding","repo_kind":"official","path":"utils.py","file_url":"https://github.com/szzhang17/Sparsest-Cut-Network-Embedding/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ef3bae1c388522c4"}},{"code_sha256_prefix":"8d37490c7f55492d","entry":"run_regression","repo":"szzhang17/Sparsest-Cut-Network-Embedding","repo_kind":"official","path":"classification.py","file_url":"https://github.com/szzhang17/Sparsest-Cut-Network-Embedding/blob/HEAD/classification.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8d37490c7f55492d"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}