REVIEW 26 cited by
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Residual Gated Graph ConvNets
read the original abstract
Graph-structured data such as social networks, functional brain networks, gene regulatory networks, communications networks have brought the interest in generalizing deep learning techniques to graph domains. In this paper, we are interested to design neural networks for graphs with variable length in order to solve learning problems such as vertex classification, graph classification, graph regression, and graph generative tasks. Most existing works have focused on recurrent neural networks (RNNs) to learn meaningful representations of graphs, and more recently new convolutional neural networks (ConvNets) have been introduced. In this work, we want to compare rigorously these two fundamental families of architectures to solve graph learning tasks. We review existing graph RNN and ConvNet architectures, and propose natural extension of LSTM and ConvNet to graphs with arbitrary size. Then, we design a set of analytically controlled experiments on two basic graph problems, i.e. subgraph matching and graph clustering, to test the different architectures. Numerical results show that the proposed graph ConvNets are 3-17% more accurate and 1.5-4x faster than graph RNNs. Graph ConvNets are also 36% more accurate than variational (non-learning) techniques. Finally, the most effective graph ConvNet architecture uses gated edges and residuality. Residuality plays an essential role to learn multi-layer architectures as they provide a 10% gain of performance.
Forward citations
Cited by 26 Pith papers
-
End-to-End Subgraph Detection with GraphDETR
GraphDETR treats subgraph detection as set prediction with a GNN-encoder and transformer decoder trained by bipartite matching, reporting detection of patterns up to 50 nodes in 1000-node graphs and AP100=91.2 on ChEM...
-
ALINC: Active Learning for Inductive Node Classification via Graph Sampling
ALINC aggregates node-level active learning utilities to graph-level selection criteria and benchmarks ten strategies across three aggregation methods on four datasets, identifying CoreSet, TypiClust, and BADGE as top...
-
Learn When and Where to Connect: Adaptive Virtual Nodes for Dynamic Message Passing on Graphs
MAVN adaptively selects and connects virtual nodes in MPNNs via learned dual-perspective preferences, proves it can realize any connectivity pattern, and reports up to 46.5% gains over backbones on nine datasets.
-
Learning Dynamic Stability Landscapes in Synchronization Networks
Introduces graph-to-image prediction of per-node dynamic stability landscapes in oscillator networks from topology, releases two 10k-graph datasets, and shows GNN-CNN models achieve good accuracy with cross-size gener...
-
Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them
k-WL is incomplete on simple spectrum graphs; PRiSM is the first provably complete canonicalization for their eigendecompositions.
-
Why Self-Inconsistency Arises in GNN Explanations and How to Exploit It
Self-inconsistency in SI-GNN explanations arises from re-explanation context perturbation; Self-Denoising post-processing calibrates explanations with one forward pass and improves quality.
-
Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks
A Max-Cut-specific graph neural network predicts primal- and dual-feasible SDP solutions in linearithmic time, cutting bounding costs in exact branch-and-bound by up to 10.6 times versus a commercial SDP solver while ...
-
Towards Metric-Faithful Neural Graph Matching
Bi-Lipschitz encoders in neural graph matching provide controlled GED surrogates and better alignment costs, leading to improved prediction and ranking on benchmarks.
-
A Multi-View Media Profiling Suite: Resources, Evaluation, and Analysis
Presents MBFC-2025 dataset and multi-view embeddings with fusion methods for media bias and factuality, reporting SOTA results on ACL-2020 and new benchmarks on MBFC-2025.
-
On the Expressive Power of GNNs to Solve Linear SDPs
Standard GNNs fail to recover linear SDP solutions, but a more expressive architecture emulates first-order solvers, achieves lower error on benchmarks, and yields up to 80% speedups when warm-starting solvers.
-
Learning Posterior Predictive Distributions for Node Classification from Synthetic Graph Priors
NodePFN pre-trains on synthetic graphs with controllable homophily and causal feature-label models to achieve 71.27 average accuracy on 23 node classification benchmarks without graph-specific training.
-
Neighbourhood Transformer: Switchable Attention for Monophily-Aware Graph Learning
Neighbourhood Transformers apply local self-attention for monophily-aware graph learning, guarantee expressiveness at least as strong as message-passing GNNs, and outperform prior methods on node classification across...
-
R2G: A Multi-View Circuit Graph Benchmark Suite from RTL to GDSII
R2G is a multi-view circuit graph benchmark showing that representation choice affects GNN accuracy more than model architecture, with node-centric views and deeper decoders performing best.
-
Enhancing LLMs for Graph Tasks via Graph-aware LoRA Generation
GaRA generates task-specific LoRA weight updates conditioned on graph structures to enable better whole-graph encoding in LLMs for zero-shot graph learning.
-
Contrastive Neural Algorithmic Reasoning for Graph Coloring
A contrastive GNN framework learns transferable node embeddings for approximate k-coloring that align same-color nodes and separate adjacent ones, with analysis showing line-prototype geometry at optima and experiment...
-
Understanding and Reducing Metadata-Driven Host Overheads in Sampling-Based GNN Training
ZEROGNN removes the host from the metadata-driven control loop in sampling-based GNN training, restoring CUDA Graph replayability and delivering up to 5.28x end-to-end speedup with near-100% GPU execution fraction.
-
COAgents: Multi-Agent Framework to Learn and Navigate Routing Problems Search Space
COAgents introduces a cooperative multi-agent system with a partial search graph to guide intensification and diversification in vehicle routing problems, achieving new state-of-the-art results among learning-based me...
-
Why Self-Inconsistency Arises in GNN Explanations and How to Exploit It
Re-explanation context perturbation causes self-inconsistency in SI-GNN explanations via latent signal assignment; Self-Denoising calibrates them with one extra forward pass and improves quality per experiments on sta...
-
No Triangulation Without Representation: Generalization in Topological Deep Learning
GNNs and HOMP models saturate an extended manifold triangulation benchmark when given appropriate representations but show no generalization beyond combinatorial structure, indicating a gap in topology-aware learning.
-
GCCM: Enhancing Generative Graph Prediction via Contrastive Consistency Model
GCCM prevents shortcut collapse in consistency models for graph prediction by using contrastive negative pairs and input feature perturbation, leading to better performance than deterministic baselines.
-
Capacity-Controlled Global Attention for Graph Transformers
SigGate-GT applies sigmoid gates to attention outputs in graph transformers to reduce over-smoothing, matching prior best on ZINC and setting new SOTA on ogbg-molhiv with gains over GraphGPS.
-
BiScale-GTR: Fragment-Aware Graph Transformers for Multi-Scale Molecular Representation Learning
BiScale-GTR achieves claimed state-of-the-art results on MoleculeNet, PharmaBench and LRGB by combining improved fragment tokenization with a parallel GNN-Transformer architecture that operates at both atom and fragme...
-
Learning from Historical Activations in Graph Neural Networks
HISTOGRAPH applies unified layer-wise attention followed by node-wise attention over historical GNN activations to improve graph classification, especially in deep models.
-
Adaptive Canonicalization with Application to Invariant Anisotropic Geometric Networks
Adaptive canonicalization selects input canonical forms by maximizing network predictive confidence to yield continuous symmetry-preserving models with universal approximation for equivariant geometric networks.
-
X-LogSMask: Expand Transformer for Graph-Structured Data
X-LogSMask injects per-head powers of the normalized adjacency matrix via a logarithmic transform into Transformer attention, achieving SOTA results on 13 of 20 graph benchmarks while remaining competitive in a one-la...
-
Extracting Money Laundering Transactions from Quasi-Temporal Graph Representation
ExSTraQt uses quasi-temporal graph representations and supervised learning to detect suspicious transactions, achieving F1 score uplifts of up to 1% on real data and over 8% on synthetic datasets compared to prior AML models.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.