{"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/a-proposal-of-multi-layer-perceptron-with","title":"A Proposal of Multi-Layer Perceptron with Graph Gating Unit for Graph Representation Learning and its Application to Surrogate Model for FEM","arxiv_id":null,"date":"2022-07-11","proceeding":"JSAI 2022 7","authors":["Nakai Yu","Okuda Hiroshi"],"abstract":"GNNs are the neural networks for the representation learning of graph-structured data, most of which are\r\nconstructed by stacking graph convolutional layers. As stacking n-layers of ones is equivalent to propagating n-hop\r\nof neighbor nodes' information, GNNs require enough large number of layers to learn large graphs. However, it\r\ntends to degrade the model performance due to the problem called over-smoothing. In this paper, by presenting\r\na novel GNN model, based on stacking feedforward neural networks with gating structures using GCNs, I tried\r\nto solve the over-smoothing problem and thereby overcome the difficulty of GNNs learning large graphs. The\r\nexperimental results showed that the proposed method monotonically improved the prediction accuracy up to 20\r\nlayers without over-smoothing, whereas the conventional method caused it at 4 to 8 layers. In two experiments on\r\nlarge graphs, the PPI dataset, a benchmark for inductive node classification, and the application to the surrogate\r\nmodel for finite element methods, the proposed method achieved the highest accuracy of the existing methods\r\ncompared, especially with a state-of-the-art accuracy of 99.71% on the PPI dataset.","url_abs":"https://www.jstage.jst.go.jp/article/pjsai/JSAI2022/0/JSAI2022_1G4OS22a03/_article/-char/ja/","url_pdf":"https://www.jstage.jst.go.jp/article/pjsai/JSAI2022/0/JSAI2022_1G4OS22a03/_pdf/-char/ja","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":"a-proposal-of-multi-layer-perceptron-with","repo_url":"https://github.com/nnaakkaaii/g2-MLP","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-representation-learning","task_name":"Graph Representation Learning"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[{"method_slug":"layer-normalization","method_name":"Layer Normalization"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"spatial-gating-unit","method_name":"Spatial Gating Unit"},{"method_slug":"gmlp","method_name":"gMLP"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-ppi","task":"Node Classification","dataset":"PPI","model":"g2-MLP","rank_in_archive_order":1,"of":24,"metrics":{"F1":"99.71"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"nnaakkaaii/g2-MLP","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1609.02907","1710.10903"],"harvested_for_calls":[{"arxiv_id":"1609.02907","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1609.02907"},"call":"get_harvested_code_for_paper(arxiv_id=\"1609.02907\")"},{"arxiv_id":"1710.10903","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1710.10903"},"call":"get_harvested_code_for_paper(arxiv_id=\"1710.10903\")"}]}],"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":"f11f9e5267df6146e19dc1c5381dbb1b6d0c122879ad3c2200af62e4aa9f8f1f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}