Methods › Graphs › Graph Models › GGS-NNs
Gated Graph Sequence Neural Networks
GGS-NNs
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Gated Graph Sequence Neural Networks (GGS-NNs) is a novel graph-based neural network model. GGS-NNs modifies Graph Neural Networks (Scarselli et al., 2009) to use gated recurrent units and modern optimization techniques and then extend to output sequences.
Source: Li et al.
Image source: Li et al.
In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.
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: 9 · with a code link: 8 · where Syntology ran a sample: 5 (5 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (5 of 9 tagged: 5 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 9 of 9, 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.
-
Parameter Prediction for Unseen Deep Architectures 25 Oct 2021 · 1 repository · arXiv:2110.13100Syntology official: harvested, nothing ran · 6 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified (of 7 harvested samples) · 2 pointer-only (licence)
-
Dynamic Planning of Bicycle Stations in Dockless Public Bicycle-sharing System Using Gated Graph Neural Network 19 Jan 2021 · 0 repositories · arXiv:2101.07425
-
On the Generalizability of Neural Program Models with respect to Semantic-Preserving Program Transformations 31 Jul 2020 · 1 repository · arXiv:2008.01566
-
On the Bottleneck of Graph Neural Networks and its Practical Implications 9 Jun 2020 · 3 repositories · arXiv:2006.05205Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample)
-
Semantic Graphs for Generating Deep Questions 27 Apr 2020 · 1 repository · arXiv:2004.12704Syntology official (archive's flag): 3 ran · 3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 3 samples that ran constructed an object rather than computing a result (of 4 harvested samples)
-
Visual Relationship Detection with Relative Location Mining 2 Nov 2019 · 1 repository · arXiv:1911.00713
-
Adversarial Examples for Models of Code 15 Oct 2019 · 4 repositories · arXiv:1910.07517Syntology official (archive's flag): 4 ran · 10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified (of 10 harvested samples) · 4 pointer-only (licence)
-
Learning to Represent Programs with Graphs 1 Nov 2017 · 2 repositories · arXiv:1711.00740
-
Gated Graph Sequence Neural Networks 17 Nov 2015 · 13 repositories · arXiv:1511.05493Syntology 9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified (of 12 harvested samples)
Tasks archive 2025-07-28
16 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