REVIEW 5 cited by
Sparse Training of Discrete Diffusion Models 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
read the original abstract
Generative graph models struggle to scale due to the need to predict the existence or type of edges between all node pairs. To address the resulting quadratic complexity, existing scalable models often impose restrictive assumptions such as a cluster structure within graphs, thus limiting their applicability. To address this, we introduce SparseDiff, a novel diffusion model based on the observation that almost all large graphs are sparse. By selecting a subset of edges, SparseDiff effectively leverages sparse graph representations both during the noising process and within the denoising network, which ensures that space complexity scales linearly with the number of chosen edges. During inference, SparseDiff progressively fills the adjacency matrix with the selected subsets of edges, mirroring the training process. Our model demonstrates state-of-the-art performance across multiple metrics on both small and large datasets, confirming its effectiveness and robustness across varying graph sizes. It also ensures faster convergence, particularly on larger graphs, achieving a fourfold speedup on the large Ego dataset compared to dense models, thereby paving the way for broader applications.
Forward citations
Cited by 5 Pith papers
-
A collaborative constrained graph diffusion model for the generation of realistic synthetic molecules
A valence-preserving double edge-swap diffusion model with a learned time estimator generates chemically valid molecules with property distributions closer to real molecules than JTVAE and DiGress on the GuacaMol benchmark.
-
SynCircuit: Automated Generation of New Synthetic RTL Circuits Can Enable Big Data in Circuits
SynCircuit generates new, structurally valid RTL circuits with a directed-cyclic-graph diffusion model plus post-processing and MCTS, and shows they improve ML-based PPA prediction when added to training data.
-
FreeScene: Mixed Graph Diffusion for 3D Scene Synthesis from Free Prompts
FreeScene parses free-form text and image prompts into scene graphs via a VLM-based Graph Designer, then generates 3D indoor layouts with a mixed graph diffusion transformer, reporting improved quality and controllabi...
-
Discrete State Diffusion Models: A Sample Complexity Perspective
Claims the first Õ(ε⁻²) sample-complexity bound for discrete-state diffusion, but the zero-approximation-error, optimization-error, and hardness lemmas carrying the proof are internally broken.
-
Discrete Diffusion Models: A Unified Framework from Tokenization to Generation
Discrete diffusion models are re-framed as instances of a tokenization-centric, four-component design space (corruption, denoiser, objective, sampler) in a broad survey with no new experimental or theoretical results.
Discussion (0). Continue with ORCID to comment.