{"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/enhancing-unsupervised-graph-few-shot","title":"Enhancing Unsupervised Graph Few-shot Learning via Set Functions and Optimal Transport","arxiv_id":"2501.05635","date":"2025-01-10","proceeding":null,"authors":["Yonghao Liu","Fausto Giunchiglia","Ximing Li","Lan Huang","Xiaoyue Feng","Renchu Guan"],"abstract":"Graph few-shot learning has garnered significant attention for its ability to rapidly adapt to downstream tasks with limited labeled data, sparking considerable interest among researchers. Recent advancements in graph few-shot learning models have exhibited superior performance across diverse applications. Despite their successes, several limitations still exist. First, existing models in the meta-training phase predominantly focus on instance-level features within tasks, neglecting crucial set-level features essential for distinguishing between different categories. Second, these models often utilize query sets directly on classifiers trained with support sets containing only a few labeled examples, overlooking potential distribution shifts between these sets and leading to suboptimal performance. Finally, previous models typically require necessitate abundant labeled data from base classes to extract transferable knowledge, which is typically infeasible in real-world scenarios. To address these issues, we propose a novel model named STAR, which leverages Set funcTions and optimAl tRansport for enhancing unsupervised graph few-shot learning. Specifically, STAR utilizes expressive set functions to obtain set-level features in an unsupervised manner and employs optimal transport principles to align the distributions of support and query sets, thereby mitigating distribution shift effects. Theoretical analysis demonstrates that STAR can capture more task-relevant information and enhance generalization capabilities. Empirically, extensive experiments across multiple datasets validate the effectiveness of STAR. Our code can be found here.","url_abs":"https://arxiv.org/abs/2501.05635v1","url_pdf":"https://arxiv.org/pdf/2501.05635v1.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":"enhancing-unsupervised-graph-few-shot","repo_url":"https://github.com/keaml-jlu/star","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"few-shot-learning","task_name":"Few-Shot Learning"}],"methods":[{"method_slug":"align","method_name":"ALIGN"},{"method_slug":"attention","method_name":"Attention"},{"method_slug":"base","method_name":"BASE"},{"method_slug":"focus","method_name":"Focus"},{"method_slug":"set","method_name":"SET"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2501.05635","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.05635"}},"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/keaml-jlu/star","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":6},"by_repo_kind":{"official":{"samples":6,"ran":0,"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":"cee9e18e24135649","entry":"accuracy","repo":"keaml-jlu/star","repo_kind":"official","path":"validation_concatenation.py","file_url":"https://github.com/keaml-jlu/star/blob/HEAD/validation_concatenation.py","link_basis":"harvester_set","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":"cee9e18e24135649"}},{"code_sha256_prefix":"9ad49972980faced","entry":"distributed_sinkhorn","repo":"keaml-jlu/star","repo_kind":"official","path":"data_split.py","file_url":"https://github.com/keaml-jlu/star/blob/HEAD/data_split.py","link_basis":"harvester_set","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":"9ad49972980faced"}},{"code_sha256_prefix":"7a2650bf070523dd","entry":"distributed_sinkhorn","repo":"keaml-jlu/star","repo_kind":"official","path":"validation_concatenation.py","file_url":"https://github.com/keaml-jlu/star/blob/HEAD/validation_concatenation.py","link_basis":"harvester_set","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":"7a2650bf070523dd"}},{"code_sha256_prefix":"e6b8d0989a823d58","entry":"euclidean_dist","repo":"keaml-jlu/star","repo_kind":"official","path":"validation_concatenation.py","file_url":"https://github.com/keaml-jlu/star/blob/HEAD/validation_concatenation.py","link_basis":"harvester_set","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":"e6b8d0989a823d58"}},{"code_sha256_prefix":"8e091b11e053d9ba","entry":"get_set_model","repo":"keaml-jlu/star","repo_kind":"official","path":"set_model.py","file_url":"https://github.com/keaml-jlu/star/blob/HEAD/set_model.py","link_basis":"harvester_set","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":"8e091b11e053d9ba"}},{"code_sha256_prefix":"fb76daacc36232bb","entry":"test_task_generator","repo":"keaml-jlu/star","repo_kind":"official","path":"data_split.py","file_url":"https://github.com/keaml-jlu/star/blob/HEAD/data_split.py","link_basis":"harvester_set","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":"fb76daacc36232bb"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}