arXiv AI June 19, 2026 By Jiaqing Chen, Zidu Yin, Yichao Cai, Yuhang Liu, Zhen Zhang, Dong Gong, Javen Qinfeng Shi

Boundary Embedding Shaping with Adaptive Contrastive Learning for Graph Structural Disentanglement

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI

Jun 2

GJDNet: Robust Graph Neural Networks via Joint Disentangled Learning Against Adversarial Attacks

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.

By Canyixing Cui, Tao Wu, Xingping Xian, Xiao-Ke Xu, Mao Wang, Weina Niu

rag safety

Hugging Face Trending Papers

Jun 1

GJDNet: Robust Graph Neural Networks via Joint Disentangled Learning Against Adversarial Attacks

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.

rag safety

arXiv Machine Learning

Jun 2

Robust Contrastive Graph Clustering with Adaptive Local-Global Integration

arXiv:2605. 28209v2 Announce Type: replace Abstract: Graph clustering is essential in graph analysis for revealing structural patterns and node communities.

By Lei Zhang, Fubo Sun, Haipeng Yang, Zhong Guan, Likang Wu

Hugging Face Trending Papers

Sep 15

Repurposing Unified Topological Signatures for Graph Representation Learning

Message-passing Graph Neural Networks (GNNs) iteratively propagate and aggregate local neighborhood information followed by global readout to learn graph representations. However, their discriminative...

rag benchmarks

arXiv AI

Sep 16

Repurposing Unified Topological Signatures for Graph Representation Learning

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...

By Sanyam Sanjay Jain, Anshika Krishnatray, Aditya Sharma, Vinti Agarwal

rag benchmarks

arXiv AI

Aug 6

NodeJEPA: Structure-Conditioned Latent Prediction for Node-Level Graph Self-Supervised Learning

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.

By Tinghe Zhang, Jian Xu, Jiaheng Chen, Jiaxing Li, Yucheng Xiao, Qiang Wang

rag diffusion fine-tuning benchmarks

One email a morning, machine-written

Related stories

GJDNet: Robust Graph Neural Networks via Joint Disentangled Learning Against Adversarial Attacks

GJDNet: Robust Graph Neural Networks via Joint Disentangled Learning Against Adversarial Attacks

Robust Contrastive Graph Clustering with Adaptive Local-Global Integration

Repurposing Unified Topological Signatures for Graph Representation Learning

Repurposing Unified Topological Signatures for Graph Representation Learning

NodeJEPA: Structure-Conditioned Latent Prediction for Node-Level Graph Self-Supervised Learning