Graph Diffusion Policy Optimization
- URL: http://arxiv.org/abs/2402.16302v1
- Date: Mon, 26 Feb 2024 04:58:42 GMT
- Title: Graph Diffusion Policy Optimization
- Authors: Yijing Liu, Chao Du, Tianyu Pang, Chongxuan Li, Wei Chen, Min Lin
- Abstract summary: Graph diffusion policy optimization (GDPO) is a novel approach to optimize graph diffusion models for arbitrary (e.g., non-differentiable) objectives using reinforcement learning.
GDPO is based on an eager policy gradient tailored for graph diffusion models, developed through meticulous analysis and promising improved performance.
- Score: 48.80961582732603
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Recent research has made significant progress in optimizing diffusion models
for specific downstream objectives, which is an important pursuit in fields
such as graph generation for drug design. However, directly applying these
models to graph diffusion presents challenges, resulting in suboptimal
performance. This paper introduces graph diffusion policy optimization (GDPO),
a novel approach to optimize graph diffusion models for arbitrary (e.g.,
non-differentiable) objectives using reinforcement learning. GDPO is based on
an eager policy gradient tailored for graph diffusion models, developed through
meticulous analysis and promising improved performance. Experimental results
show that GDPO achieves state-of-the-art performance in various graph
generation tasks with complex and diverse objectives. Code is available at
https://github.com/sail-sg/GDPO.
Related papers
- Advancing Graph Generation through Beta Diffusion [49.49740940068255]
Graph Beta Diffusion (GBD) is a diffusion-based generative model adept at capturing diverse graph structures.
We have developed a modulation technique that enhances the realism of the generated graphs by stabilizing the generation of critical graph structures.
arXiv Detail & Related papers (2024-06-13T17:42:57Z) - Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis [50.972595036856035]
We present a code that successfully replicates results from six popular and recent graph recommendation models.
We compare these graph models with traditional collaborative filtering models that historically performed well in offline evaluations.
By investigating the information flow from users' neighborhoods, we aim to identify which models are influenced by intrinsic features in the dataset structure.
arXiv Detail & Related papers (2023-08-01T09:31:44Z) - Generative Diffusion Models on Graphs: Methods and Applications [50.44334458963234]
Diffusion models, as a novel generative paradigm, have achieved remarkable success in various image generation tasks.
Graph generation is a crucial computational task on graphs with numerous real-world applications.
arXiv Detail & Related papers (2023-02-06T06:58:17Z) - Fast Graph Generative Model via Spectral Diffusion [38.31052833073743]
We argue that running full-rank diffusion SDEs on the whole space hinders diffusion models from learning graph topology generation.
We propose an efficient yet effective Graph Spectral Diffusion Model (GSDM), which is driven by low-rank diffusion SDEs on the graph spectrum space.
arXiv Detail & Related papers (2022-11-16T12:56:32Z) - Robust Causal Graph Representation Learning against Confounding Effects [21.380907101361643]
We propose Robust Causal Graph Representation Learning (RCGRL) to learn robust graph representations against confounding effects.
RCGRL introduces an active approach to generate instrumental variables under unconditional moment restrictions, which empowers the graph representation learning model to eliminate confounders.
arXiv Detail & Related papers (2022-08-18T01:31:25Z) - Optimal Propagation for Graph Neural Networks [51.08426265813481]
We propose a bi-level optimization approach for learning the optimal graph structure.
We also explore a low-rank approximation model for further reducing the time complexity.
arXiv Detail & Related papers (2022-05-06T03:37:00Z) - Robust Optimization as Data Augmentation for Large-scale Graphs [117.2376815614148]
We propose FLAG (Free Large-scale Adversarial Augmentation on Graphs), which iteratively augments node features with gradient-based adversarial perturbations during training.
FLAG is a general-purpose approach for graph data, which universally works in node classification, link prediction, and graph classification tasks.
arXiv Detail & Related papers (2020-10-19T21:51:47Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.