GLAD: Bidirectional Structure-Attribute Alignment via Latent Graph Diffusion Models
Jiankai Zuo, Yu Zhang, Yang Zhang, Zihao Yao, YAYING ZHANG
Abstract
Learning on graphs with missing node attributes is a prevalent yet challenging problem in real-world scenarios, as graph neural networks (GNNs) typically rely on complete attribute information. Existing solutions often employ adversarial learning in a shared latent space to align graph structure and attributes. However, these methods frequently suffer from training instability and mode collapse, failing to fully capture the complex, multi-modal joint distribution of topology and features. To address these limitations, we present GLAD, a novel generative framework for robust node attribute completion. GLAD leverages the strong generative capabilities of diffusion models to learn the conditional distribution of attributes given the graph structure within a decoupled latent space. Unlike previous unidirectional approaches, GLAD introduces a robust bidirectional alignment mechanism. Specifically, we incorporate a structure reconstruction constraint during training and structure-aware classifier-free guidance during sampling, ensuring that generated attributes are not only plausible but also maintain strict topological consistency with the underlying graph. Theoretically, we show that GLAD maximizes a tighter variational lower bound on the joint log-likelihood compared to GAN-based predecessors, leading to superior mode coverage. Extensive experiments on large-scale benchmarks demonstrate that GLAD significantly outperforms state-of-the-art baselines in both attribute recovery quality and downstream task performance.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext e0816a2e-ecd7-4fc5-9b3c-c44e913d0c93Builds on11
- Denoising Diffusion Probabilistic ModelsJonathan Ho, Ajay Jain, Pieter AbbeelNeurIPS 2020 · 35,902 citations
- Directly Denoising Diffusion ModelsDan Zhang, Jingjing Wang, Feng LuoICML 2024 · 11,724 citations
- Score-Based Generative Modeling through Stochastic Differential EquationsYang Song, Jascha Sohl-Dickstein, Diederik P. Kingma, Abhishek Kumar et al.ICLR 2021 · 1,270 citations
- GraphMAE: Self-Supervised Masked Graph AutoencodersZhenyu Hou, Xiao Liu, Yukuo Cen, Yuxiao Dong et al.KDD 2022 · 533 citations
- Score-based Generative Modeling of Graphs via the System of Stochastic Differential EquationsJaehyeong Jo, Seul Lee, Sung Ju HwangICML 2022 · 327 citations
Related papers
- MIGDiff: Multi-attributes Imputations for Attribute-missing Graphs via Graph Denoising Diffusion ModelYe Liu, Yang Chen, Hongmin CaiAAAI 2026
- Heterogeneous Graph Neural Network via Attribute CompletionDi Jin, Cuiying Huo, Chundong Liang, Liang YangWWW 2021 · 220 citations
- GLAD: Improving Latent Graph Generative Modeling with Simple QuantizationVan Khoa Nguyen, Yoann Boget, Frantzeska Lavda, Alexandros KalousisAAAI 2025 · 8 citations
- Flexible Graph Neural Diffusion with Latent Class Representation LearningLiangtian Wan, Huijin Han, Lu Sun, Zixun Zhang et al.KDD 2024 · 2 citations
- Unifying Generation and Prediction on Graphs with Latent Graph DiffusionCai Zhou, Xiyuan Wang, Muhan ZhangNeurIPS 2024 · 37 citations
