{"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/graph-star-net-for-generalized-multi-task-1","title":"Graph Star Net for Generalized Multi-Task Learning","arxiv_id":"1906.12330","date":"2019-06-21","proceeding":null,"authors":["Lu Haonan","Seth H. Huang","Tian Ye","Guo Xiuyan"],"abstract":"In this work, we present graph star net (GraphStar), a novel and unified graph neural net architecture which utilizes message-passing relay and attention mechanism for multiple prediction tasks - node classification, graph classification and link prediction. GraphStar addresses many earlier challenges facing graph neural nets and achieves non-local representation without increasing the model depth or bearing heavy computational costs. We also propose a new method to tackle topic-specific sentiment analysis based on node classification and text classification as graph classification. Our work shows that 'star nodes' can learn effective graph-data representation and improve on current methods for the three tasks. Specifically, for graph classification and link prediction, GraphStar outperforms the current state-of-the-art models by 2-5% on several key benchmarks.","url_abs":"https://arxiv.org/abs/1906.12330v1","url_pdf":"https://arxiv.org/pdf/1906.12330v1.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":"graph-star-net-for-generalized-multi-task-1","repo_url":"https://github.com/graph-star-team/graph_star","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"multi-task-learning","task_name":"Multi-Task Learning"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"sentiment-analysis","task_name":"Sentiment Analysis"},{"task_slug":"text-classification","task_name":"Text Classification"},{"task_slug":"text-classification-1","task_name":"text-classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/graph-classification-on-dd","task":"Graph Classification","dataset":"D&D","model":"GraphStar","rank_in_archive_order":17,"of":53,"metrics":{"Accuracy":"79.60%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-enzymes","task":"Graph Classification","dataset":"ENZYMES","model":"GraphStar","rank_in_archive_order":20,"of":54,"metrics":{"Accuracy":"67.1%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-mutag","task":"Graph Classification","dataset":"MUTAG","model":"GraphStar","rank_in_archive_order":15,"of":74,"metrics":{"Accuracy":"91.2%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-proteins","task":"Graph Classification","dataset":"PROTEINS","model":"GraphStar","rank_in_archive_order":23,"of":103,"metrics":{"Accuracy":"77.90%"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-citeseer-biased-evaluation","task":"Link Prediction","dataset":"Citeseer (biased evaluation)","model":"GraphStar (double weight on positive examples)","rank_in_archive_order":1,"of":2,"metrics":{"AP":"97.93","AUC":"97.47","Accuracy":"97.7"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-cora-biased-evaluation","task":"Link Prediction","dataset":"Cora (biased evaluation)","model":"GraphStar (double weight on positive examples)","rank_in_archive_order":1,"of":2,"metrics":{"AP":"96.15","AUC":"95.65","Accuracy":"95.9"},"uses_additional_data":false},{"leaderboard":"/sota/link-prediction-on-pubmed-biased-evaluation","task":"Link Prediction","dataset":"Pubmed (biased evaluation)","model":"GraphStar (double weight on positive examples)","rank_in_archive_order":1,"of":2,"metrics":{"AP":"98.64","AUC":"97.67","Accuracy":"98.16"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-citeseer","task":"Node Classification","dataset":"Citeseer","model":"GraphStar","rank_in_archive_order":56,"of":71,"metrics":{"Accuracy":"71.0"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-cora","task":"Node Classification","dataset":"Cora","model":"GraphStar","rank_in_archive_order":56,"of":73,"metrics":{"Accuracy":"82.1%"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-ppi","task":"Node Classification","dataset":"PPI","model":"GraphStar","rank_in_archive_order":7,"of":24,"metrics":{"F1":"99.4"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-pubmed","task":"Node Classification","dataset":"Pubmed","model":"GraphStar","rank_in_archive_order":60,"of":70,"metrics":{"Accuracy":"77.2%"},"uses_additional_data":false},{"leaderboard":"/sota/sentiment-analysis-on-imdb","task":"Sentiment Analysis","dataset":"IMDb","model":"GraphStar","rank_in_archive_order":6,"of":49,"metrics":{"Accuracy":"96.0"},"uses_additional_data":false},{"leaderboard":"/sota/sentiment-analysis-on-mr","task":"Sentiment Analysis","dataset":"MR","model":"GraphStar","rank_in_archive_order":15,"of":19,"metrics":{"Accuracy":"76.6"},"uses_additional_data":false},{"leaderboard":"/sota/text-classification-on-20news","task":"Text Classification","dataset":"20NEWS","model":"GraphStar","rank_in_archive_order":8,"of":16,"metrics":{"Accuracy":"86.9"},"uses_additional_data":false},{"leaderboard":"/sota/text-classification-on-ohsumed","task":"Text Classification","dataset":"Ohsumed","model":"GraphStar","rank_in_archive_order":7,"of":10,"metrics":{"Accuracy":"64.2"},"uses_additional_data":false},{"leaderboard":"/sota/text-classification-on-r52","task":"Text Classification","dataset":"R52","model":"GraphStar","rank_in_archive_order":2,"of":8,"metrics":{"Accuracy":"95.00"},"uses_additional_data":false},{"leaderboard":"/sota/text-classification-on-r8","task":"Text Classification","dataset":"R8","model":"GraphStar","rank_in_archive_order":12,"of":21,"metrics":{"Accuracy":"97.4"},"uses_additional_data":false}],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"}},"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/graph-star-team/graph_star","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_draft_wrong":1,"unverified":5},"by_repo_kind":{"named_in_paper":{"samples":6,"ran":1,"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":"efe1a86fd9a2468e","entry":"clean_str","repo":"graph-star-team/graph_star","repo_kind":"named_in_paper","path":"utils/create_text_graph.py","file_url":"https://github.com/graph-star-team/graph_star/blob/HEAD/utils/create_text_graph.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"efe1a86fd9a2468e"}},{"code_sha256_prefix":"4697b9faaabb18e9","entry":"loadWord2Vec","repo":"graph-star-team/graph_star","repo_kind":"named_in_paper","path":"utils/create_text_graph.py","file_url":"https://github.com/graph-star-team/graph_star/blob/HEAD/utils/create_text_graph.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":"4697b9faaabb18e9"}},{"code_sha256_prefix":"c57e3273b8a890ec","entry":"load_data","repo":"graph-star-team/graph_star","repo_kind":"named_in_paper","path":"run_gc.py","file_url":"https://github.com/graph-star-team/graph_star/blob/HEAD/run_gc.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":"c57e3273b8a890ec"}},{"code_sha256_prefix":"a751153e928ee971","entry":"load_data","repo":"graph-star-team/graph_star","repo_kind":"named_in_paper","path":"run_imdb.py","file_url":"https://github.com/graph-star-team/graph_star/blob/HEAD/run_imdb.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":"a751153e928ee971"}},{"code_sha256_prefix":"4add35936b25f263","entry":"load_data","repo":"graph-star-team/graph_star","repo_kind":"named_in_paper","path":"run_lp.py","file_url":"https://github.com/graph-star-team/graph_star/blob/HEAD/run_lp.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":"4add35936b25f263"}},{"code_sha256_prefix":"378ae7e2907239c5","entry":"split_train_test","repo":"graph-star-team/graph_star","repo_kind":"named_in_paper","path":"utils/create_text_graph.py","file_url":"https://github.com/graph-star-team/graph_star/blob/HEAD/utils/create_text_graph.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":"378ae7e2907239c5"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}