arXiv Machine Learning

From Moments to Models: Graphon-Mixture Learning for Mixup and Contrastive Learning

arXiv:2510. 03690v4 Announce Type: replace Abstract: Real-world graph datasets often arise from mixtures of populations, where graphs are generated by multiple distinct underlying distributions.

arXiv Machine Learning

Jun 10

Revisiting Positive Samples in Graph Contrastive Learning: From the Perspective of Message Passing

arXiv:2606. 10284v1 Announce Type: new Abstract: Graph Contrastive Learning (GCL), which trains graph encoders by maximizing similarity between positive samples and minimizing it between negative ones, has emerged as a mainstream graph pre-training paradigm.

By Lianze Shan, Ningchong Wang, Jitao Zhao, Di Jin, Dongxiao He

arXiv Machine Learning

Jun 19

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.

By Zhengyu Wu, Daohan Su, Yang Zhang, Xunkai Li, Rong-Hua Li, Guoren Wang

benchmarks

arXiv Machine Learning

Sep 11

SynCo: Synthetic Community-Aware Attributed Graph Generator for Graph Neural Network Benchmarking

SynCo is a synthetic graph generator that lets users control node degree distributions and sub‑community structures, addressing limitations of existing generators that rely on power‑law distributions and lack flexibility. It is evaluated on graph mimicking, hyperparameter tuning, and node clustering, outperforming state‑of‑the‑art methods while preserving original data distributions. SynCo can generate large graphs with up to 2.1 million nodes.

By Guilherme Henrique Messias, Mariana Caravanti de Souza, Sylvia Iasulaitis, Alan Dem\'etrius Baria Valejo

benchmarks

arXiv AI

Jul 8

Breaking Structural Isolation: Scalable Graph Clustering via Community-Aware Sampling and Structural Entropy

arXiv:2607. 05469v1 Announce Type: cross Abstract: Unsupervised graph clustering is a fundamental technique for uncovering underlying semantic patterns in large-scale networks.

By Jingyun Zhang, Hao Peng, Jianxin Li, Angsheng Li, Philip S. Yu

benchmarks

arXiv AI

Jun 11

From Uniform to Learned Graph Priors: Diffusion for Structure Discovery

arXiv:2606. 11831v1 Announce Type: cross Abstract: Neural relational inference (NRI) methods discover interaction graphs from trajectories through variational reasoning on discrete potential edges.

By Qi Shao, Hao Guo, Jiawen Chen, Duxin Chen, Wenwu Yu

diffusion benchmarks

arXiv Machine Learning

Jun 17

SMGFM: Spectral Multimodal Graph Pretraining for Multimodal-Attributed Graphs

arXiv:2606. 12867v2 Announce Type: replace Abstract: Multimodal-attributed graphs (MAGs) couple graph topology with node semantics from text, images, and other modalities.

By Zhengyu Wu, Xu Wang, Hongchao Qin, Xunkai Li, Guang Zeng, Rong-Hua Li, Guoren Wang

multimodal benchmarks safety

arXiv Machine Learning

Jul 22

One Model, Many Graphs: Learning over Attributed Graphs across Heterogeneous Modalities with Vision-Language Models

arXiv:2607. 19128v1 Announce Type: new Abstract: Vision-language models (VLMs) provide a unified representation space for textual and visual information, yet their potential as general-purpose backbones for graph-structured data remains largely unexplored.

By Jiayi Yang, Yifang Chen, Yuanfu Sun, Jiajin Liu, Qiaoyu Tan

llms rag multimodal benchmarks

arXiv Machine Learning

Sep 15

Consistency of augmentation graph and network approximability in contrastive learning

arXiv:2502.04312v3 Announce Type: replace Abstract: Contrastive learning leverages data augmentation to develop feature representation without relying on large labeled datasets. However, despite its...

By Chenghui Li, A. Martina Neuman

arXiv AI

Jun 17

Handling Feature Heterogeneity with Learnable Graph Patches

arXiv:2606. 17667v1 Announce Type: cross Abstract: In recent years, the rapid development of foundation models and graph pre-training technologies has spurred increasing interest in constructing a universal pre-trained graph model or Graph Foundation Model (GFM).

By Yifei Sun, Yang Yang, Xiao Feng, Zijun Wang, Haoyang Zhong, Chunping Wang, Lei Chen

rag

arXiv Machine Learning

Jul 20

Toward Federated Multimodal Graph Foundation Models: A Topology-Aware Multimodal Alignment Framework

arXiv:2607. 15687v1 Announce Type: new Abstract: Multimodal-attributed graphs (MAGs), whose nodes carry modalities such as images and text alongside topological structure, now pervade applications including social platforms, e-commerce, and biomedical networks, offering richer semantic signals than single-modality graphs.

By Xunkai Li, Guohao Fu, Yuming Ai, Zhengyu Wu, Hongchao Qin, Rong-Hua Li, Guoren Wang

fine-tuning multimodal safety

arXiv Machine Learning

Jun 19

Prior-Informed Flow Matching for Graph Reconstruction

arXiv:2601. 22107v2 Announce Type: replace Abstract: We introduce \textit{Prior-Informed Flow Matching (PIFM)}, a conditional flow model for graph reconstruction.

By Harvey Chen, Nicolas Zilberstein, Santiago Segarra

rag diffusion benchmarks

arXiv Machine Learning

Aug 21

GraphPFN: A Prior-Data Fitted Graph Foundation Model

arXiv:2509. 21489v4 Announce Type: replace Abstract: Graph foundation models face several fundamental challenges including transferability across diverse domains and data scarcity, which calls into question the very feasibility of creating such models.

By Dmitry Eremeev, Oleg Platonov, Gleb Bazhenov, Artem Babenko, Liudmila Prokhorenkova

llms fine-tuning benchmarks

Related stories