{"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/graph-representation-learning-via-hard-and","title":"Graph Representation Learning via Hard and Channel-Wise Attention Networks","arxiv_id":"1907.04652","date":"2019-07-05","proceeding":null,"authors":["Hongyang Gao","Shuiwang Ji"],"abstract":"Attention operators have been widely applied in various fields, including computer vision, natural language processing, and network embedding learning. Attention operators on graph data enables learnable weights when aggregating information from neighboring nodes. However, graph attention operators (GAOs) consume excessive computational resources, preventing their applications on large graphs. In addition, GAOs belong to the family of soft attention, instead of hard attention, which has been shown to yield better performance. In this work, we propose novel hard graph attention operator (hGAO) and channel-wise graph attention operator (cGAO). hGAO uses the hard attention mechanism by attending to only important nodes. Compared to GAO, hGAO improves performance and saves computational cost by only attending to important nodes. To further reduce the requirements on computational resources, we propose the cGAO that performs attention operations along channels. cGAO avoids the dependency on the adjacency matrix, leading to dramatic reductions in computational resource requirements. Experimental results demonstrate that our proposed deep models with the new operators achieve consistently better performance. Comparison results also indicates that hGAO achieves significantly better performance than GAO on both node and graph embedding tasks. Efficiency comparison shows that our cGAO leads to dramatic savings in computational resources, making them applicable to large graphs.","url_abs":"https://arxiv.org/abs/1907.04652v1","url_pdf":"https://arxiv.org/pdf/1907.04652v1.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-representation-learning-via-hard-and","repo_url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/hardgat","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-attention","task_name":"Graph Attention"},{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"graph-embedding","task_name":"Graph Embedding"},{"task_slug":"graph-representation-learning","task_name":"Graph Representation Learning"},{"task_slug":"hard-attention","task_name":"Hard Attention"},{"task_slug":"network-embedding","task_name":"Network Embedding"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/graph-classification-on-collab","task":"Graph Classification","dataset":"COLLAB","model":"hGANet","rank_in_archive_order":23,"of":39,"metrics":{"Accuracy":"77.48%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-dd","task":"Graph Classification","dataset":"D&D","model":"hGANet","rank_in_archive_order":9,"of":53,"metrics":{"Accuracy":"81.71%"},"uses_additional_data":true},{"leaderboard":"/sota/graph-classification-on-imdb-m","task":"Graph Classification","dataset":"IMDb-M","model":"hGANet","rank_in_archive_order":29,"of":36,"metrics":{"Accuracy":"49.06%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-mutag","task":"Graph Classification","dataset":"MUTAG","model":"hGANet","rank_in_archive_order":24,"of":74,"metrics":{"Accuracy":"90.00%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-proteins","task":"Graph Classification","dataset":"PROTEINS","model":"hGANet","rank_in_archive_order":17,"of":103,"metrics":{"Accuracy":"78.65%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-proteins","task":"Graph Classification","dataset":"PROTEINS","model":"cGANet","rank_in_archive_order":20,"of":103,"metrics":{"Accuracy":"78.23%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-proteins","task":"Graph Classification","dataset":"PROTEINS","model":"GANet","rank_in_archive_order":22,"of":103,"metrics":{"Accuracy":"77.92%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-ptc","task":"Graph Classification","dataset":"PTC","model":"hGANet","rank_in_archive_order":23,"of":37,"metrics":{"Accuracy":"65.02%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-ptc","task":"Graph Classification","dataset":"PTC","model":"cGANet","rank_in_archive_order":25,"of":37,"metrics":{"Accuracy":"63.53%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-ptc","task":"Graph Classification","dataset":"PTC","model":"GANet","rank_in_archive_order":27,"of":37,"metrics":{"Accuracy":"62.94%"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1907.04652","atlas_url":"https://app.syntology.ai/?focus=1907.04652","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":"1907.04652"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1907.04652\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1907.04652"},"call":"get_concepts_for_paper(arxiv_id=\"1907.04652\")"}],"by_repo":[{"repo":"dmlc/dgl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":6,"harvested_for":["1607.00653","1612.00222","1802.04364","1806.01973","2006.05582","2010.16103"],"harvested_for_calls":[{"arxiv_id":"1607.00653","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1607.00653"},"call":"get_harvested_code_for_paper(arxiv_id=\"1607.00653\")"},{"arxiv_id":"1612.00222","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1612.00222"},"call":"get_harvested_code_for_paper(arxiv_id=\"1612.00222\")"},{"arxiv_id":"1802.04364","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.04364"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.04364\")"},{"arxiv_id":"1806.01973","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1806.01973"},"call":"get_harvested_code_for_paper(arxiv_id=\"1806.01973\")"},{"arxiv_id":"2006.05582","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.05582"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.05582\")"},{"arxiv_id":"2010.16103","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.16103"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.16103\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"879bd6af9acbca1be9dbb0aa90197c6320eea6a96bb58f3a976d71a1a57b6752","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}