REVIEW 24 cited by
SIGN: Scalable Inception Graph Neural Networks
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
Signed reviews
read the original abstract
Graph representation learning has recently been applied to a broad spectrum of problems ranging from computer graphics and chemistry to high energy physics and social media. The popularity of graph neural networks has sparked interest, both in academia and in industry, in developing methods that scale to very large graphs such as Facebook or Twitter social networks. In most of these approaches, the computational cost is alleviated by a sampling strategy retaining a subset of node neighbors or subgraphs at training time. In this paper we propose a new, efficient and scalable graph deep learning architecture which sidesteps the need for graph sampling by using graph convolutional filters of different size that are amenable to efficient precomputation, allowing extremely fast training and inference. Our architecture allows using different local graph operators (e.g. motif-induced adjacency matrices or Personalized Page Rank diffusion matrix) to best suit the task at hand. We conduct extensive experimental evaluation on various open benchmarks and show that our approach is competitive with other state-of-the-art architectures, while requiring a fraction of the training and inference time. Moreover, we obtain state-of-the-art results on ogbn-papers100M, the largest public graph dataset, with over 110 million nodes and 1.5 billion edges.
Forward citations
Cited by 24 Pith papers
-
When does distribution shift break graph neural networks calibration?
GNN calibration under distribution shift is governed by a single closed-form slope κ(hs, ht, ρ) that sets the optimal global temperature T⋆=1/κ and explains when node-wise recalibration cannot help.
-
OpenGU: A Comprehensive Benchmark for Graph Unlearning
OpenGU is claimed as the first comprehensive benchmark for graph unlearning, integrating 16 methods, 37 datasets, and a 3x3 grid of tasks and unlearning requests, with empirical findings on effectiveness, efficiency, ...
-
HOPPER: Learnable Hop Extraction for Linearized Graph Sequence Models
HOPPER learns graph- and hop-adaptive sequence extraction for linearized graph sequence models, recovering fixed LGSM extractors as special cases and achieving the best reported scores on eccentricity and shortest-pat...
-
MiGHT-EHR: A Multi-task Graph Transformer for Heterogeneous Temporal Electronic Health Records
A heterogeneous graph transformer with temporal attention and balanced multi-task training reports state-of-the-art average performance on four EHR prediction tasks on MIMIC-III and MIMIC-IV, but the evaluation may le...
-
No Need to Train Your RDB Foundation Model
Column-wise, parameter-free JUICE encodings let single-table ICL models solve multi-table RDB prediction tasks with no training or fine-tuning.
-
FedSA-GCL: A Semi-Asynchronous Federated Graph Learning Framework with Personalized Aggregation and Cluster-Aware Broadcasting
A semi-asynchronous federated graph learning framework with soft-label clustering, staleness-weighted aggregation, and cluster broadcasting reports higher accuracy and faster convergence than ten baselines.
-
HOPSE: Scalable Higher-Order Positional and Structural Encoder for Combinatorial Representations
HOPSE encodes higher-order topological data by applying graph positional and structural encoders to Hasse graph decompositions, matching or exceeding message-passing models on benchmarks with up to 7x faster training.
-
Graph Learning at Scale: Characterizing and Optimizing Pre-Propagation GNNs
Pre-propagation GNNs, whose training is bottlenecked by data loading, can be sped up roughly 15x with custom loaders, GPU double buffering, chunk reshuffling, and direct storage access, beating sampling-based GNNs by ...
-
Even Sparser Graph Transformers
Spexphormer trains a narrow graph transformer to identify important attention edges, then trains a wider model on the sparsified graph, achieving competitive accuracy with far less memory.
-
Personalized One-shot Federated Graph Learning for Heterogeneous Clients
O-pFGL achieves one-shot personalized federated graph learning by aggregating class-wise feature statistics into a surrogate graph and combining global distillation with local fine-tuning, outperforming baselines on 1...
-
IMPaCT GNN: Imposing invariance with Message Passing in Chronological split Temporal Graphs
IMPaCT reweights graph message passing to align first and second moments across chronological train/test splits, reporting accuracy gains on ogbn-mag and a theoretical W1 bound.
-
Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning
AutoBRANE learns tree-structured branching networks for multitask algorithmic reasoning via gradient-based task affinities and convex relaxation.
-
HIAL: A New Paradigm for Hypergraph Active Learning via Influence Maximization
HIAL selects labels for hypergraph neural networks by maximizing a dual feature-and-topology influence function, and reports improved accuracy on seven datasets.
-
Uncertainty-Aware Graph Neural Networks: A Multi-Hop Evidence Fusion Approach
EFGNN fuses per-depth evidential opinions from a multi-hop GNN into one final Dirichlet-based prediction whose uncertainty is lower than that of any single propagation depth.
-
Transaction Categorization with Relational Deep Learning in QuickBooks
Rel-Cat predicts transaction categories by converting the QuickBooks relational database into a heterogeneous graph and treating categorization as link prediction, beating production baselines on a private dataset.
-
A Generative Graph Contrastive Learning Model with Global Signal
A graph contrastive learning framework that uses a low-rank SVD-smoothed adjacency matrix as the augmented view and adaptively reweights hard and easy contrastive pairs to improve node classification.
-
ScaDyG:A New Paradigm for Large-scale Dynamic Graph Learning
ScaDyG proposes a decoupled, step-wise exponential time encoding with hypernetwork aggregation for scalable dynamic graph learning, but the key proof of equivalence with composite exponential message passing is invali...
-
Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach
The paper's NIM+SGU pipeline improves forgetting and preserves accuracy in graph unlearning by selecting high-influence nodes via propagation-based influence scores and fine-tuning on entity-specific losses.
-
Toward Effective Digraph Representation Learning: A Magnetic Adaptive Propagation based Approach
Replacing the hand-tuned global q of magnetic digraph GNNs with an automatically computed per-edge q improves accuracy on 12 directed-graph benchmarks, with a trainable variant reaching reported SOTA.
-
Large-Scale Spectral Graph Neural Networks via Laplacian Sparsification: Technical Report
SGNN-LS approximates dense multi-hop spectral filters with sparse random-walk graphs, enabling end-to-end training on 111M-node graphs, but the theory for negative filter coefficients has a gap.
-
Towards Scalable and Deep Graph Neural Networks via Noise Masking
RMask uses random walks and a distance-based mask to extract exact-hop graph information, improving the accuracy and speed of model-simplification GNNs.
-
SCFCRC: Simultaneously Counteract Feature Camouflage and Relation Camouflage for Fraud Detection
SCFCRC combines a feature filter trained with propagated pseudo-labels and a mixture-of-experts refiner with masking regularization to improve fraud detection on YelpChi and Amazon.
-
Towards Data-centric Machine Learning on Directed Graphs: a Survey
A survey taxonomizing directed graph neural networks into message-passing, eigenpolynomial, and sequence-based frameworks and re-reading them from a data-centric perspective.
-
Topological Signal Processing and Learning: Recent Advances and Future Challenges
A survey of topological signal processing and learning that uses Hodge theory to unify recent advances in processing signals on simplicial and cell complexes.
Discussion (0). Continue with ORCID to comment.