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.
By Gage DeZoort, Boris Hanin
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.
By Stefano Fiorini, Edoardo Coppola, Pietro Li\`o
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.
By Antonin Joly, Nicolas Keriven, Aline Roumy
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.
By Bohan Yoon, Hyejin Jang
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.
By R\'emi Bourgerie, \v{S}ar\={u}nas Girdzijauskas, Viktoria Fodor