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
arXiv:2606. 28134v1 Announce Type: cross Abstract: Graph-based fraud detection is essential for safeguarding large-scale transaction systems, where undetected anomalies may lead to substantial financial losses and security risks.
By Liming Liu, Chao Hu, Mingfei Lu, Yiwei Ge, Xingle Li, Heyuan Shi
arXiv:2608. 00491v1 Announce Type: new Abstract: Graph self-supervised learning aims to learn transferable representations from large-scale unlabeled graph data.
By Ruichen Xu, Jingxiang Qu, Wenhan Gao, Jiaxing Zhang, Linsey Pang, Ravid Shwartz-Ziv, Yann LeCun, Yuefan Deng
arXiv:2607. 17272v1 Announce Type: new Abstract: Node representation learning has advanced rapidly, yet most existing methods rely on per-dataset training and hyperparameter tuning.
By Dooho Lee, Jaemin Yoo
The paper introduces RGC‑Net, a Reservoir‑Based Graph Convolutional Network that combines fixed‑random reservoir dynamics with a structured convolutional framework for graph learning. It addresses limitations of existing reservoir‑based GNNs by adding a leaky integrator for better feature retention and a robust, adaptable architecture for graph classification and generation. Experiments demonstrate state‑of‑the‑art performance on classification and generative tasks, including dynamic brain connectivity, with faster convergence and reduced over‑smoothing.
By Mayssa Soussia, Gita Ayu Salsabila, Mohamed Ali Mahjoub, Islem Rekik
CacheDyG introduces a cache‑refine framework that decouples temporal propagation from parameter updates in dynamic graph neural networks. By storing graph‑aware node‑time representations in non‑trainable buffers and updating only a lightweight refiner, residual gate, and link predictor during training, it reduces repeated recomputation of historical structures. Experiments on five benchmarks show that CacheDyG uses fewer trainable parameters, runs faster, and achieves competitive or better predictive performance compared to existing baselines.
By PinHeng Zong, Ye Yuan