Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchMachine learning

analiza aiqbench

This is an arXiv machine learning paper proposing Deep Neural Sheaf Diffusion, a modification of sheaf-based graph neural networks that swaps the sheaf Laplacian for a sheaf adjacency operator so deeper models keep useful signal. The paper is a workshop-level contribution, with gains reported on synthetic long-range benchmarks (up to 30 percentage points) and more modest, consistent improvements on real-world datasets. For ML readers, the useful takeaway is the framing of sheaf diffusion as a matrix-valued generalization of graph attention, though the claims about graph foundation models remain speculative until larger-scale evaluations appear.
Sursă care acoperăarXiv

Deep Neural Sheaf Diffusion

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2605.19021v3 Announce Type: replace Abstract: Deep Graph Neural Networks (GNNs) are essential for capturing complex dependencies in graph-structured data. However, scaling GNNs to depth remains challenging, as stacking layers leads to representation collapse and diminishing sensitivity due to repeated aggregation. While Neural Sheaf Diffusion (NSD) provides strong theoretical guarantees against such collapse, these guarantees do not translate to practice: as depth increases, the disagreement signal of the sheaf Laplacian vanishes, limiting the contribution of deeper layers. We identify mechanisms that hinder NSD effectiveness at depth and propose \emph{Deep Neural Sheaf Diffusion} (DNSD), which replaces the sheaf Laplacian with a sheaf adjacency operator to maintain informative signals across layers. This is complemented by normalization, odd nonlinearities, and gating. To provide a principled explanation of the expected performance improvement, we contrast sheaf diffusion to graph attention mechanisms, highlighting that DNSD replaces scalar attention scores with matrix-valued edge functions and normalizes node representations rather than attention scores. We demonstrate empirically that DNSD effectively utilizes deep aggregation in graph tasks, outperforming GNN and NSD baselines with up to 30pp accuracy on synthetic long-range datasets, and consistently outperforming them on real-world benchmarks. These results position sheaf-based architectures as a promising building block for graph foundation models by supporting effective deep architectures.

Abstract:Deep Graph Neural Networks (GNNs) are essential for capturing complex dependencies in graph-structured data. However, scaling GNNs to depth remains challenging, as stacking layers leads to representation collapse and diminishing sensitivity due to repeated aggregation. While Neural Sheaf Diffusion (NSD) provides strong theoretical guarantees against such collapse, these guarantees do not translate to practice: as depth increases, the disagreement signal of the sheaf Laplacian vanishes, limiting the contribution of deeper layers. We identify mechanisms that hinder NSD effectiveness at depth and propose \emph{Deep Neural Sheaf Diffusion} (DNSD), which replaces the sheaf Laplacian with a sheaf adjacency operator to maintain informative signals across layers. This is complemented by normalization, odd nonlinearities, and gating. To provide a principled explanation of the expected performance improvement, we contrast sheaf diffusion to graph attention mechanisms, highlighting that DNSD replaces scalar attention scores with matrix-valued edge functions and normalizes node representations rather than attention scores. We demonstrate empirically that DNSD effectively utilizes deep aggregation in graph tasks, outperforming GNN and NSD baselines with up to 30pp accuracy on synthetic long-range datasets, and consistently outperforming them on real-world benchmarks. These results position sheaf-based architectures as a promising building block for graph foundation models by supporting effective deep architectures.

Accepted at the ICML 2026 Workshop on Graph Foundation Models (GFM@ICML 2026). Code available at this https URL v3: Corrected typographical errors in Eqs. (3) and (12)

Machine Learning (cs.LG)

arXiv:2605.19021 [cs.LG]

(or arXiv:2605.19021v3 [cs.LG] for this version)

Text integral sub licența deschisă a publicației · 239 cuvinte

Subiecte conexe