Methods › Graphs › Graph Models › GCNII
GCNII
Introduced by Ming Chen et al. in Simple and Deep Graph Convolutional Networks
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
GCNII is an extension of a Graph Convolution Networks with two new techniques, initial residual and identify mapping, to tackle the problem of oversmoothing -- where stacking more layers and adding non-linearity tends to degrade performance. At each layer, initial residual constructs a skip connection from the input layer, while identity mapping adds an identity matrix to the weight matrix.
In Syntology repository known, no verified implementation (declared_code; repositories: 4 listed of 4 in the graph, strongest link: official). This answer is about arXiv:2007.02133, the paper the archive credits with this method.
Origin paper of this answer, arXiv:2007.02133 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 5 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result (of 7 harvested samples) · 4 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 7 · with a code link: 2 · where Syntology ran a sample: 2 (1 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (2 of 7 tagged: 1 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 7 of 7, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Understanding and Improving Deep Graph Neural Networks: A Probabilistic Graphical Model Perspective 25 Jan 2023 · 0 repositories · arXiv:2301.10536
-
Multi-duplicated Characterization of Graph Structures using Information Gain Ratio for Graph Neural Networks 24 Dec 2022 · 0 repositories · arXiv:2212.12691
-
Every Node Counts: Improving the Training of Graph Neural Networks on Node Classification 29 Nov 2022 · 0 repositories · arXiv:2211.16631
-
wsGAT: Weighted and Signed Graph Attention Networks for Link Prediction 21 Sep 2021 · 0 repositories · arXiv:2109.11519
-
Layer-wise Adaptive Graph Convolution Networks Using Generalized Pagerank 24 Aug 2021 · 0 repositories · arXiv:2108.10636
-
Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework 4 Mar 2021 · 1 repository · arXiv:2103.02885Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified (of 3 harvested samples) · 3 pointer-only (licence)
-
Simple and Deep Graph Convolutional Networks 4 Jul 2020 · 4 repositories · arXiv:2007.02133Syntology official (archive's flag): 2 ran · 5 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result (of 7 harvested samples) · 4 pointer-only (licence)
Tasks archive 2025-07-28
13 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections