arXiv:2606. 20283v1 Announce Type: cross Abstract: Graph neural networks (GNNs) excel at aggregating neighbor information for classification, yet their performance is hindered by graph structural entanglement, where spurious correlations from semantically irrelevant neighbors contaminate node embeddings.
arXiv:2606. 01560v1 Announce Type: cross Abstract: Graph Neural Networks (GNNs) are vulnerable to adversarial attacks, which inherently invert connectivity patterns by introducing disassortative edges in assortative graphs and assortative edges in disassortative graphs.
Graph Neural Networks (GNNs) are vulnerable to adversarial attacks, which inherently invert connectivity patterns by introducing disassortative edges in assortative graphs and assortative edges in disassortative graphs. This structural inversion creates structure-feature mismatches that disrupt neighborhood aggregation across different graph types.
arXiv:2605. 28209v2 Announce Type: replace Abstract: Graph clustering is essential in graph analysis for revealing structural patterns and node communities.
Message-passing Graph Neural Networks (GNNs) iteratively propagate and aggregate local neighborhood information followed by global readout to learn graph representations. However, their discriminative...
arXiv:2609.17061v1 Announce Type: cross Abstract: Message-passing Graph Neural Networks (GNNs) iteratively propagate and aggregate local neighborhood information followed by global readout to learn g...
arXiv:2608. 04381v1 Announce Type: cross Abstract: Self-supervised learning on graphs is largely shaped by contrastive methods that depend on carefully designed augmentations, and by generative methods that reconstruct node attributes in the input space.
DeltaGNN introduces an information flow control mechanism that uses a new connectivity measure, the information flow score, to mitigate over‑smoothing and over‑squashing in Graph Neural Networks. This approach enables linear computational and memory overhead while effectively capturing both short‑range and long‑range node interactions. Experiments on ten diverse real‑world datasets demonstrate superior performance with limited computational complexity.
arXiv:2603. 24304v2 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) deliver strong performance on graph tasks, but their accuracy drops significantly under out-of-distribution (OOD) scenarios.
arXiv:2608.29054v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) have emerged as a cornerstone for representing complex relational dependencies in diverse multimedia tasks, particularly i...
arXiv:2602. 09258v2 Announce Type: replace Abstract: Deployed graph neural networks (GNNs) are frozen at deployment yet must fit clean data, generalize under distribution shifts, and remain stable to perturbations.
arXiv:2609.08685v1 Announce Type: new Abstract: Standard open-set node classification methods rely on the homophily assumption, where connected nodes share labels. However, real-world graphs are ofte...
arXiv:2609.37057v1 Announce Type: new Abstract: Achieving strong performance with graph neural networks (GNNs) typically requires training and hyperparameter tuning for each dataset, incurring repeat...