A geometry-aware multi-support heterogeneous GNN fuses point, line, and grid rainfall observations via cross-support message passing to reconstruct fields at arbitrary resolutions, reducing RMSE by 23.2% over baselines on Singapore data.
hub Mixed citations
Fast Graph Representation Learning with PyTorch Geometric
Mixed citation behavior. Most common role is background (40%).
abstract
We introduce PyTorch Geometric, a library for deep learning on irregularly structured input data such as graphs, point clouds and manifolds, built upon PyTorch. In addition to general graph data structures and processing methods, it contains a variety of recently published methods from the domains of relational learning and 3D data processing. PyTorch Geometric achieves high data throughput by leveraging sparse GPU acceleration, by providing dedicated CUDA kernels and by introducing efficient mini-batch handling for input examples of different size. In this work, we present the library in detail and perform a comprehensive comparative study of the implemented methods in homogeneous evaluation scenarios.
hub tools
citation-role summary
citation-polarity summary
representative citing papers
Cellina uses supervised disentanglement to separate cell intrinsic states from spatial contexts for counterfactual predictions on tissue graphs, outperforming baselines on 2.5M+ cells from cancer and brain data.
EpiFormer improves epitope prediction F1 score by over 40% via early-fusion cross-attention in GNN layers and sparsity-aware objectives, while recovering known biology as emergent behavior.
Operator-level factorial benchmark of 84 MPNN configurations finds message-seed initialization and node-edge fusion drive performance on MoleculeNet tasks more than node updates.
SiST-GNN performs simultaneous spatial-temporal message passing on a temporally augmented graph and reports 109-277% gains in fixed-split dynamic link prediction over prior methods.
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 generalization.
FROG makes full-resolution graph structure learnable in relational deep learning by modeling table roles as optimizable components in message passing, regularized by functional dependency constraints.
Contrastive Message Passing lets GNNs apply similarity-preserving transforms to positive edges and dissimilarity-inducing transforms to negative edges via soft positive semidefinite constraints on weights, yielding gains in low-label high-homophily regimes.
OgBench is the first benchmark platform for GNN graph-level prediction in the n << p omics regime and finds that common GNNs often underperform MLPs and classical baselines.
NeurPRISE trains a GNN-Transformer via imitation learning to mimic a lookahead heuristic for scenario reduction in 2RO, delivering 7-200x speedups with competitive regret on three test problems and zero-shot generalization.
Vibrational mode graphs from molecular dynamics enable sequence-free protein function prediction via graph neural networks, with entrainment improving signals for collective dynamics.
ATLAS achieves 12-30x faster out-of-core full-graph GNN inference on graphs up to 4B edges by switching to broadcast-based layer-wise execution with graph reordering, minimum-pending-message eviction, and GPU-accelerated tiered memory-disk hierarchy.
PiGGO integrates a learned graph neural ODE as the continuous-time dynamics model within an extended Kalman filter to enable online virtual sensing and uncertainty-aware state estimation for nonlinear dynamic systems with unknown model form and sparse sensing.
HopRank is a self-supervised LLM-tuning method that turns node classification into link prediction via hierarchical hop-based preference sampling, matching supervised GNN performance with zero labeled data on text-attributed graphs.
HND models hypergraph feature propagation as an anisotropic diffusion process governed by a continuous-time PDE, discretized into stable neural layers with energy dissipation and boundedness guarantees.
LOGGIA is a delay-aware graph neural routing algorithm using pre-training and RL that outperforms shortest-path and other neural methods in realistic network simulations.
NEAT achieves state-of-the-art 3D molecular generation on QM9 and GEOM-Drugs via a neighborhood-guided autoregressive set transformer that ensures atom-level permutation invariance and offers a significant speed advantage.
GRDM jointly generates relational database tables via graph-conditional diffusion without table ordering, outperforming autoregressive baselines on multi-hop correlations and single-table fidelity across six real RDBs.
A systematic method leveraging Weisfeiler-Leman coloring to mine class-discriminating motifs as proxy explanations, enabling the creation of the OpenGraphXAI benchmark suite from real-world datasets.
Oblivious MPGNNs cannot simulate WL color refinement with shallow depth and small messages without randomness; bounded-error randomness enables logarithmic resources for large color sets, while small color sets force layer-message trade-offs.
HetSheaf applies cellular sheaves and type-conditioned restriction maps to heterogeneous graphs, plus SheafPool for basis-invariant graph-level representations, delivering competitive accuracy with substantially reduced parameter counts.
Graph Transformers are shown to be vulnerable to adaptive structure-perturbation attacks, which can also be used for effective adversarial training to improve robustness.
ElemeNet is a unified ML software package for molecular property prediction across elements 1-100 with built-in uncertainty quantification and competitive benchmarks on diverse chemistry datasets.
TOPOS creates high-fidelity 3D heads with fixed industry topology from single images via a specialized VAE with Perceiver Resampler and a rectified flow transformer.
citing papers explorer
No citing papers match the current filters.