arXiv Machine Learning

Toward General Digraph Contrastive Learning: A Dual Spatial Perspective

arXiv:2510. 16311v3 Announce Type: replace Abstract: Graph Contrastive Learning (GCL) has emerged as a powerful tool for extracting consistent representations from graphs, independent of labeled information.

Hugging Face Trending Papers
Sep 8

Topology-induced Operators Reveal Complementary Graph Representations without Training

The paper demonstrates that high‑quality graph embeddings can be produced without complex models or training by propagating random features through topological structures derived from random walks and anonymous walks. These training‑free embeddings capture node proximity and structural roles, respectively, and perform competitively on node, edge, and graph tasks while often requiring less computation. Combining the two embedding types further improves inference quality for some tasks.

arXiv Machine Learning
Sep 4

When Vision Meets Graphs: A Survey on Graph Reasoning and Learning

The survey titled "When Vision Meets Graphs: A Survey on Graph Reasoning and Learning" reviews how visual depictions of graphs can be used as inputs for graph reasoning and learning. It highlights that while Graph Neural Networks dominate graph machine learning, most pipelines ignore the visual form of graphs, despite scientists routinely interpreting graphs visually. The paper organizes existing work into three threads—vision for graph reasoning, vision for graph learning, and scientific graphs—aiming to clarify current capabilities and chart a path toward foundation models that perceive and reason about graphs like scientists do.

By Xinjian Zhao, Wei Pang, Zhixuan Yu, Xiangru Jian, Xiaozhuang Song, Yaoyao Xu, Zhongkai Xue, Dingshuo Chen, Shu Wu, Philip Torr, Tianshu Yu
Hugging Face Trending Papers
Jun 29

PromptGNN-sim: Deep Fusion and Alignment of GNN and LLMs for Text-Attributed Graph Learning

Text-Attributed Graphs (TAGs) combine textual semantics with graph structure and are central to many graph learning tasks. However, existing fusion methods often treat text and structure as separate inputs in a shallow, one-way pipeline, which limits deep interaction between modalities and weakens performance under sparse connectivity or cross-graph generalisation.

arXiv Machine Learning
Aug 4

Nonlinear Laplacians Improve Signed-Directed Graph Learning

arXiv:2608. 00836v1 Announce Type: new Abstract: While signed-directed graphs have been studied using linear Laplacians in the design of graph neural networks, relatively little research has focused on developing non-linear Laplacian operators for such networks.

By Ali Parviz, Yuichi Yoshida