Composable Score-based Graph Diffusion Model for Multi-Conditional Molecular Generation

• URL: http://arxiv.org/abs/2509.09451v2
• Date: Mon, 29 Sep 2025 01:50:08 GMT
• Title: Composable Score-based Graph Diffusion Model for Multi-Conditional Molecular Generation
• Abstract summary: We propose Composable Score-based Graph Diffusion model (CSGD), which extends score matching to discrete graphs via concrete scores.<n>We show that CSGD achieves state-of-the-art performance with a 15.3% average improvement in controllability over prior methods.<n>Our findings highlight the practical advantages of score-based modeling for discrete graph generation and its capacity for flexible, multi-property molecular design.
• Score: 85.58520120011269
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Controllable molecular graph generation is essential for material and drug discovery, where generated molecules must satisfy diverse property constraints. While recent advances in graph diffusion models have improved generation quality, their effectiveness in multi-conditional settings remains limited due to reliance on joint conditioning or continuous relaxations that compromise fidelity. To address these limitations, we propose Composable Score-based Graph Diffusion model (CSGD), the first model that extends score matching to discrete graphs via concrete scores, enabling flexible and principled manipulation of conditional guidance. Building on this foundation, we introduce two score-based techniques: Composable Guidance (CoG), which allows fine-grained control over arbitrary subsets of conditions during sampling, and Probability Calibration (PC), which adjusts estimated transition probabilities to mitigate train-test mismatches. Empirical results on four molecular datasets show that CSGD achieves state-of-the-art performance, with a 15.3% average improvement in controllability over prior methods, while maintaining high validity and distributional fidelity. Our findings highlight the practical advantages of score-based modeling for discrete graph generation and its capacity for flexible, multi-property molecular design.

Related papers

• Reinforcement Learning for Microcanonical Graph Ensemble with Assortativity Constraints [1.0896567381206717]
  How network structure determines function is a fundamental question, and it can be investigated by graph ensembles with precisely controlled structural properties.<n>Here we introduce the Deep Microcanonical Graph Generator (DMGG), a reinforcement learning framework that transforms any given graph through degree-preserving rewirings.
  arXiv  Detail & Related papers  (2026-05-22T06:57:41Z)
• Controllable Molecular Generative Foundation Models [36.63304478618632]
  We propose textbfControllable textbfMolecular Generative Foundation Models (CoMole)<n>By learning a motif-aware graph space, CoMole transfers pretrained structural priors into controllable generation.<n>We show that CoMole ranks first in controllability on all nine targets, reduces MAE by up to 48.2% relative to the strongest baselines, and maintains validity above 0.94 without rule-based correction or post-hoc filtering.
  arXiv  Detail & Related papers  (2026-05-14T19:27:01Z)
• Efficient Perplexity Bound and Ratio Matching in Discrete Diffusion Language Models [0.0]
  We introduce three new theorems concerning the KL divergence between the data and learned distribution.<n>We empirically show that ratio-matching performed by minimizing the denoising cross-entropy between the clean and corrupted data enables models to outperform those utilizing score-entropy.
  arXiv  Detail & Related papers  (2025-07-06T10:54:37Z)
• Graph Diffusion that can Insert and Delete [14.488714063757278]
  Generative models of graphs based on discrete Denoising Diffusion Probabilistic Models (DDPMs) offer a principled approach to molecular generation.<n>In this paper, we reformulate the noising and denoising processes to support monotonic insertion and deletion of nodes.<n>The resulting model, which we call GrIDDD, dynamically grows or shrinks the chemical graph during generation.
  arXiv  Detail & Related papers  (2025-06-06T19:45:45Z)
• Derivative-Free Diffusion Manifold-Constrained Gradient for Unified XAI [59.96044730204345]
  We introduce Derivative-Free Diffusion Manifold-Constrainted Gradients (FreeMCG)<n>FreeMCG serves as an improved basis for explainability of a given neural network.<n>We show that our method yields state-of-the-art results while preserving the essential properties expected of XAI tools.
  arXiv  Detail & Related papers  (2024-11-22T11:15:14Z)
• Scoreformer: A Surrogate Model For Large-Scale Prediction of Docking Scores [0.0]
  We present ScoreFormer, a novel graph transformer model designed to accurately predict molecular docking scores. ScoreFormer achieves competitive performance in docking score prediction and offers a substantial 1.65-fold reduction in inference time compared to existing models.
  arXiv  Detail & Related papers  (2024-06-13T17:31:02Z)
• Cometh: A continuous-time discrete-state graph diffusion model [8.444907767842228]
  We propose Cometh, a continuous-time discrete-state graph diffusion model, tailored to the specificities of graph data. In terms of VUN samples, Cometh obtains a near-perfect performance of 99.5% on the planar graph dataset and outperforms DiGress by 12.6% on the large GuacaMol dataset.
  arXiv  Detail & Related papers  (2024-06-10T16:39:39Z)
• Equivariant Denoisers Cannot Copy Graphs: Align Your Graph Diffusion Models [24.912841472542322]
  Graph diffusion models, dominant in graph generative modeling, remain underexplored for graph-to-graph translation tasks.<n>We show how alignment dramatically improves discrete diffusion model performance from 5% to a SOTA-matching 54.7% top-1 accuracy.
  arXiv  Detail & Related papers  (2024-05-27T20:57:19Z)
• DecompOpt: Controllable and Decomposed Diffusion Models for Structure-based Molecular Optimization [49.85944390503957]
  DecompOpt is a structure-based molecular optimization method based on a controllable and diffusion model. We show that DecompOpt can efficiently generate molecules with improved properties than strong de novo baselines.
  arXiv  Detail & Related papers  (2024-03-07T02:53:40Z)
• ChiroDiff: Modelling chirographic data with Diffusion Models [132.5223191478268]
  We introduce a powerful model-class namely "Denoising Diffusion Probabilistic Models" or DDPMs for chirographic data. Our model named "ChiroDiff", being non-autoregressive, learns to capture holistic concepts and therefore remains resilient to higher temporal sampling rate.
  arXiv  Detail & Related papers  (2023-04-07T15:17:48Z)
• Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations [57.15855198512551]
  We propose a novel score-based generative model for graphs with a continuous-time framework. We show that our method is able to generate molecules that lie close to the training distribution yet do not violate the chemical valency rule.
  arXiv  Detail & Related papers  (2022-02-05T08:21:04Z)
• Autoregressive Score Matching [113.4502004812927]
  We propose autoregressive conditional score models (AR-CSM) where we parameterize the joint distribution in terms of the derivatives of univariable log-conditionals (scores) For AR-CSM models, this divergence between data and model distributions can be computed and optimized efficiently, requiring no expensive sampling or adversarial training. We show with extensive experimental results that it can be applied to density estimation on synthetic data, image generation, image denoising, and training latent variable models with implicit encoders.
  arXiv  Detail & Related papers  (2020-10-24T07:01:24Z)

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.