{"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/set2graph-learning-graphs-from-sets","title":"Set2Graph: Learning Graphs From Sets","arxiv_id":"2002.08772","date":"2020-02-20","proceeding":"NeurIPS 2020 12","authors":["Hadar Serviansky","Nimrod Segol","Jonathan Shlomi","Kyle Cranmer","Eilam Gross","Haggai Maron","Yaron Lipman"],"abstract":"Many problems in machine learning can be cast as learning functions from sets to graphs, or more generally to hypergraphs; in short, Set2Graph functions. Examples include clustering, learning vertex and edge features on graphs, and learning features on triplets in a collection. A natural approach for building Set2Graph models is to characterize all linear equivariant set-to-hypergraph layers and stack them with non-linear activations. This poses two challenges: (i) the expressive power of these networks is not well understood; and (ii) these models would suffer from high, often intractable computational and memory complexity, as their dimension grows exponentially. This paper advocates a family of neural network models for learning Set2Graph functions that is both practical and of maximal expressive power (universal), that is, can approximate arbitrary continuous Set2Graph functions over compact sets. Testing these models on different machine learning tasks, mainly an application to particle physics, we find them favorable to existing baselines.","url_abs":"https://arxiv.org/abs/2002.08772v3","url_pdf":"https://arxiv.org/pdf/2002.08772v3.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":"set2graph-learning-graphs-from-sets","repo_url":"https://github.com/hadarser/SetToGraphPaper","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"clustering","task_name":"Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2002.08772","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08772"}},"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/hadarser/SetToGraphPaper","reach":null}],"summary":{"ran_draft_wrong":1,"ran_fixture":1,"unverified":1},"by_repo_kind":{"official":{"samples":3,"ran":2,"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":"3979bb6a4cc7dc13","entry":"calc_metrics","repo":"hadarser/SetToGraphPaper","repo_kind":"official","path":"main_scripts/main_jets.py","file_url":"https://github.com/hadarser/SetToGraphPaper/blob/HEAD/main_scripts/main_jets.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"3979bb6a4cc7dc13"}},{"code_sha256_prefix":"8ff242b3439b14da","entry":"infer_clusters","repo":"hadarser/SetToGraphPaper","repo_kind":"official","path":"main_scripts/main_jets.py","file_url":"https://github.com/hadarser/SetToGraphPaper/blob/HEAD/main_scripts/main_jets.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"8ff242b3439b14da"}},{"code_sha256_prefix":"72a3836ecf2d6aee","entry":"get_loss","repo":"hadarser/SetToGraphPaper","repo_kind":"official","path":"main_scripts/main_jets.py","file_url":"https://github.com/hadarser/SetToGraphPaper/blob/HEAD/main_scripts/main_jets.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"72a3836ecf2d6aee"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}