arXiv Machine Learning July 7, 2026 By Yaniv Shulman, Shaghayegh Akbarpour, Jack B. Muir

MABLE: Masked Autoencoding with Bi-Lipschitz Decoding for Embeddings and Graph Metric Learning

Read the original on arXiv Machine Learning →

arXiv:2607. 02990v1 Announce Type: new Abstract: We propose MABLE (Masked Autoencoding with Bi-Lipschitz Decoding for Embeddings and Graph Metric Learning), a self-supervised framework for learning node and graph embeddings from large, heterogeneous graphs, demonstrated here on geospatial mineral-exploration data.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jul 28

Unsupervised Graph Representation Learning with Complementary View Alignment

arXiv:2607. 24338v1 Announce Type: new Abstract: Unsupervised graph representation learning aims to derive meaningful node embeddings by capturing both structural and attribute information without relying on labeled data.

By Zengyi Wo, Shiyu Zhang, Qiyao Peng, Tianpeng Li, Xuan Guo

rag benchmarks safety

arXiv AI

Jul 2

AGE: Adaptive-masking for Graph Embedding in Graph Retrieval-Augmented Generation

arXiv:2607. 00052v1 Announce Type: cross Abstract: GraphRAG is an extension of retrieval-augmented generation (RAG) that supports large language models (LLMs) by referring to graph-structured data as external knowledge.

By Bao Long Nguyen Huu, Atsushi Hashimoto

llms 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

arXiv AI

Jun 2

Graph is a Natural Regularization: Revisiting Vector Quantization for Graph Representation Learning

arXiv:2508. 06588v3 Announce Type: replace-cross Abstract: Vector Quantization (VQ) has recently emerged as a promising approach for learning compressed and discrete representations for graph-structured data.

By Zian Zhai, Fan Li, Xingyu Tan, Xiaoyang Wang, Wenjie Zhang

efficiency benchmarks

arXiv Machine Learning

Jul 7

Graph Classification via Network Usable Information: From Representation Evaluation to Structure Selection

arXiv:2607. 03587v1 Announce Type: new Abstract: We propose NetinfoGC, a framework for graph classification that extends the Network Usable Information (NUI) paradigm to graph-level learning.

By Abdullah Shaik, Anwar Said

rag benchmarks

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

Related stories

Unsupervised Graph Representation Learning with Complementary View Alignment

AGE: Adaptive-masking for Graph Embedding in Graph Retrieval-Augmented Generation

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

Graph is a Natural Regularization: Revisiting Vector Quantization for Graph Representation Learning

Graph Classification via Network Usable Information: From Representation Evaluation to Structure Selection

Prior-Informed Flow Matching for Graph Reconstruction