Deep Neural Sheaf Diffusion (DNSD) is a new graph neural network architecture that replaces the sheaf Laplacian with a sheaf adjacency operator to keep informative signals across many layers. It also uses normalization, odd nonlinearities, and gating, and replaces scalar attention with matrix-valued edge functions. Experiments show DNSD outperforms existing GNNs and Neural Sheaf Diffusion on both synthetic long‑range and real‑world graph benchmarks, achieving up to 30 percentage‑point gains in accuracy.
arXiv:2607. 05017v1 Announce Type: cross Abstract: The performance of deep learning models crucially depends on the settings of hyperparameters like learning rate, initialization scale, and weight decay.
arXiv:2608. 02558v1 Announce Type: new Abstract: Sheaf Neural Networks (SNNs) generalize message passing by replacing scalar edge weights of standard Graph Neural Networks (GNNs) with learnable, edge-dependent restriction maps between node stalks.
arXiv:2608. 02128v1 Announce Type: new Abstract: Training Graph Neural Networks on large graphs is challenged by the memory cost of storing all node representations across layers.
Graph-Dependent Pooling (GDPool) introduces a dynamic approach to hierarchical graph pooling, allowing each graph to determine its own pooling granularity rather than relying on fixed cluster numbers or ratios. The method employs self-attention to select graph-specific anchors and uses soft node assignment to build coarser graphs, addressing optimization conflicts identified through gradient alignment analysis. Experiments on metal‑organic framework and molecular graph datasets demonstrate that GDPool outperforms existing methods in predictive accuracy, modularity, and exhibits stable behavior across various hyperparameters.
Training Graph Neural Networks on large graphs is challenged by the memory cost of storing all node representations across layers. We show that several existing scalable approaches can be written as structured modifications of the GNN propagation matrix, providing a unified perspective that exposes their respective limitations.
The paper introduces SheafDEQ, a subhomogeneous deep-equilibrium architecture that uses adaptive neural-sheaf propagation to allow richer, edge-dependent transformations in implicit graph neural networks while guaranteeing a unique equilibrium. The authors prove that SheafDEQ’s equilibrium is globally reachable from any positive initialization and remains contractive even with bounded communication staleness. Experiments demonstrate that SheafDEQ outperforms fixed-propagation implicit baselines on tasks such as Sums, MNIST Terrain, Coordinates, and community detection, especially as graph connectivity becomes increasingly heterophilic.
arXiv:2607. 21885v1 Announce Type: new Abstract: Coarsening-based training for graph neural networks (GNNs), i.
arXiv:2601. 21207v4 Announce Type: replace-cross Abstract: Combinatorial and topological structures, such as graphs, simplicial complexes, and cell complexes, form the foundation of geometric and topological deep learning (GDL and TDL) architectures.
The paper introduces Topological Attention (Top‑A), a multi‑head attention mechanism that extends standard diagonal edge maps by allowing off‑diagonal, edge‑conditioned communication across attention heads. By isolating the transport primitive through quiver representations, the authors show that standard multi‑head attention only implements diagonal edge maps, whereas Top‑A learns additional cross‑head routes while preserving the original same‑head paths. Experiments on relational reasoning, heterogeneous graph learning, and algorithmic reasoning demonstrate that cross‑head transport is most beneficial when tasks require interaction‑dependent transformations, whereas heterophily alone does not provide a systematic advantage.
HyPE-GT introduces a framework that generates learnable hyperbolic positional encodings for Graph Transformers, enabling the capture of complex hierarchical relationships in graph-structured data. Unlike traditional Euclidean encodings, HyPE’s hyperbolic encodings can be selected to suit specific downstream tasks and help mitigate oversmoothing in deep Graph Neural Networks. Experiments on molecular benchmarks and large-scale Open Graph Benchmark datasets demonstrate improved performance, while additional tests on Coauthor and Copurchase networks confirm HyPE’s effectiveness in controlling oversmoothing.
arXiv:2509. 21489v4 Announce Type: replace Abstract: Graph foundation models face several fundamental challenges including transferability across diverse domains and data scarcity, which calls into question the very feasibility of creating such models.
arXiv:2606. 10071v1 Announce Type: cross Abstract: We introduce Temporal Sheaf Neural Networks (TSNN), a temporal link prediction framework that equips each node with a time-varying orthogonal frame and compares node states only after explicit transport between local coordinate systems.