REVIEW 4 cited by
Discrete-state Continuous-time Diffusion for Graph Generation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Graph is a prevalent discrete data structure, whose generation has wide applications such as drug discovery and circuit design. Diffusion generative models, as an emerging research focus, have been applied to graph generation tasks. Overall, according to the space of states and time steps, diffusion generative models can be categorized into discrete-/continuous-state discrete-/continuous-time fashions. In this paper, we formulate the graph diffusion generation in a discrete-state continuous-time setting, which has never been studied in previous graph diffusion models. The rationale of such a formulation is to preserve the discrete nature of graph-structured data and meanwhile provide flexible sampling trade-offs between sample quality and efficiency. Analysis shows that our training objective is closely related to generation quality, and our proposed generation framework enjoys ideal invariant/equivariant properties concerning the permutation of node ordering. Our proposed model shows competitive empirical performance against state-of-the-art graph generation solutions on various benchmarks and, at the same time, can flexibly trade off the generation quality and efficiency in the sampling phase.
Forward citations
Cited by 4 Pith papers
-
Is Noise Conditioning Necessary? A Unified Theory of Unconditional Graph Diffusion Models
Removing explicit noise-level conditioning from graph diffusion models is often harmless, and the paper gives concentration and error-propagation bounds explaining why, with supporting experiments on QM9 and soc-Epinions1.
-
Graph Generative Pre-trained Transformer
G2PT represents graphs as node-then-edge token sequences and learns them with GPT-style next-token prediction, matching or beating diffusion baselines on seven graph and molecule datasets.
-
Breaking Silos: Adaptive Model Fusion Unlocks Better Time Series Forecasting
A learnable fusor that reads meta-features of an input time series and weights 13 pre-trained forecasters per sample outperforms each individual model on most benchmark samples, including zero-shot settings.
-
Unveiling and Steering Connectome Organization with Interpretable Latent Variables
A VAE with SHAP-based interpretability learns low-dimensional codes for Drosophila connectome subgraphs, and the codes can be steered to generate graph subgraphs with targeted edge counts and other properties.
Discussion (0). Continue with ORCID to comment.