Forked Diffusion for Conditional Graph Generation
Giangiacomo Mercatali, Yogesh Verma, Andre Freitas, Vikas Garg
OpenReview ground truth
Abstract
We introduce a novel score-based diffusion framework that incorporates forking for conditional generation. In this framework, a single parent diffusion process is associated with a primary variable (e.g., structure), while multiple child diffusion processes are employed, each dedicated to a dependent variable (e.g., property). The parent process guides the co-evolution of its child processes towards segregated representation spaces. This approach allows our models to manage conditional information flow effectively, uncover intricate interactions and dependencies, and ultimately unlock new generative capabilities. Our experimental results demonstrate the significant superiority of our method over contemporary baselines in the context of conditional graph generation, highlighting the potential of forking diffusion for enhancing conditional generation tasks and inverse molecular design tasks.
Author context
Most prolific author: 7 submissions (credibility 1.00).
No mass-submission penalty for this paper (authors within normal submission volume).
Aggregate statistics only — no individual author rankings.
Ranking trajectory
Percentile by tournament round — convergence indicates rating stability.
Battle history — 40 comparisons
Ranked above opponent in 45% of matchups.
- ▼ lost to Visual Category Discovery via Linguistic A… ×6
- ▲ beat FusionShot: Boosting Few Shot Learners wit… ×6
- ▼ lost to Navigating the Design Space of Equivariant… ×4
- ▼ lost to AdjointDPM: Adjoint Sensitivity Method for… ×4
- ▼ lost to Computing high-dimensional optimal transpo… ×4
Judge assessments
Mean overall score 0.0 ± 0.0 (n = 40)