REVIEW 8 cited by
DeFoG: Discrete Flow Matching 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
DeFoG: Discrete Flow Matching for Graph Generation
read the original abstract
Graph generative models are essential across diverse scientific domains by capturing complex distributions over relational data. Among them, graph diffusion models achieve superior performance but face inefficient sampling and limited flexibility due to the tight coupling between training and sampling stages. We introduce DeFoG, a novel graph generative framework that disentangles sampling from training, enabling a broader design space for more effective and efficient model optimization. DeFoG employs a discrete flow-matching formulation that respects the inherent symmetries of graphs. We theoretically ground this disentangled formulation by explicitly relating the training loss to the sampling algorithm and showing that DeFoG faithfully replicates the ground truth graph distribution. Building on these foundations, we thoroughly investigate DeFoG's design space and propose novel sampling methods that significantly enhance performance and reduce the required number of refinement steps. Extensive experiments demonstrate state-of-the-art performance across synthetic, molecular, and digital pathology datasets, covering both unconditional and conditional generation settings. It also outperforms most diffusion-based models with just 5-10% of their sampling steps.
Forward citations
Cited by 8 Pith papers
-
Variational Learning for Insertion-based Generation
Introduces the Insertion Process model for variable-length non-monotonic sequence generation via a bijective permutation mapping and permutation-based variational inference.
-
Graph Convolutional Attention: A Spectral Perspective on Graph Denoising and Diffusion
Under a denoising objective, linear attention is suboptimal; Graph Convolutional Attention matches idealized spectral attention on SBMs and improves graph denoising and diffusion in proportion to spectral diversity.
-
Flowing with Confidence
FMwC computes per-sample confidence scores for flow matching models via closed-form propagation of input-dependent multiplicative noise variance along the sampling ODE, supporting filtering, editing, and adaptive stepping.
-
FlashMol: High-Quality Molecule Generation in as Few as Four Steps
FlashMol produces chemically valid 3D molecules in 4 steps via distribution matching distillation with respaced timesteps and Jensen-Shannon regularization, matching or exceeding 1000-step teacher performance on QM9 a...
-
Interpolating Discrete Diffusion Models with Controllable Resampling
IDDM interpolates diffusion transitions with a resampling mechanism to lessen dependence on intermediate latents and improve sample quality over masked and uniform discrete diffusion models.
-
Discrete Bayesian Sample Inference for Graph Generation
GraphBSI uses Bayesian Sample Inference as noise-controlled SDEs to generate discrete graphs in one shot, achieving state-of-the-art results on molecular benchmarks Moses and GuacaMol.
-
Controllable Molecular Generative Foundation Models
CoMole combines motif-aware graph diffusion with RL policy optimization to deliver controllable molecular generation that outperforms baselines on nine targets across materials and drug benchmarks while keeping high validity.
-
Controllable Molecular Generative Foundation Models
CoMole uses a motif-aware graph diffusion pipeline with RL to rank first in controllability on nine targets across materials and drug benchmarks while keeping validity above 0.94 without post-processing.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.