MotifRole-Diff: Risk-Optimal Role-Aware Corruption for Masked Molecular Graph Diffusion

• URL: http://arxiv.org/abs/2607.21634v1
• Date: Mon, 20 Jul 2026 21:04:14 GMT
• Title: MotifRole-Diff: Risk-Optimal Role-Aware Corruption for Masked Molecular Graph Diffusion
• Abstract summary: We introduce a role-aware corruption process that allocates masking rates according to empirically measured denoising difficulty.<n>We formulate schedule selection as the risk-optimal allocation of a fixed masking budget across token roles.<n>Our theorem characterizes optimality for the modeled role-weighted residual risk, while downstream generation performance is evaluated.
• Score: 1.075515727254947
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Masked discrete diffusion for molecular graph generation typically applies a uniform corruption schedule to all tokens in a lossless graph-to-sequence representation, implicitly treating structurally heterogeneous molecular components as equally difficult and equally important to reconstruct. However, different molecular graph token roles exhibit substantial variation in denoising difficulty and their influence on the decoded molecule, motivating role-specific corruption strategies. We introduce MotifRole-Diff, a role-aware corruption process that allocates masking rates according to empirically measured denoising difficulty and graph-level perturbation impact while preserving the model architecture, clean sequence space, and lossless molecular-graph decoder. We formulate schedule selection as the risk-optimal allocation of a fixed masking budget across token roles. Our theorem characterizes optimality for the modeled role-weighted residual risk, while downstream generation performance is evaluated empirically. Under matched architecture, training budget, and sampling compute, MotifRole-Diff improves validity on QM9 from 0.905 to 0.944 while reducing FCD from 1.701 to 1.609, and on MOSES improves validity from 0.920 to 0.938 while reducing FCD from 2.125 to 1.850. Role-wise diagnostics further show improved reconstruction across molecular graph token categories. Together, these matched-compute results indicate that structurally informed corruption is a more effective masking strategy than uniform schedules for serialized molecular graph diffusion.

Related papers

• Destroy Me: Automatic Artifact Generation for Histopathology Images [0.0]
  "Destroy Me" is a framework for realistic artifact synthesis and robust data augmentation.<n>We show that models trained on "destroyed" patches consistently outperform baselines on independent real-world datasets.
  arXiv  Detail & Related papers  (2026-08-27T10:12:09Z)
• AnchorDiff: Topology-Aware Masked Diffusion with Confidence-based Rewriting for Radiology Report Generation [2.2748974006378933]
  Radiology report generation aims to automatically produce clinically accurate textual reports from medical images.<n>Existing methods rely on autoregressive (AR) language models, whose causal dependency structure restricts generation to a unidirectional left-to-right process.<n>We propose AnchorDiff, the first masked-diffusion framework for RRG that integrates knowledge-graph-derived clinical anchors into diffusion language modeling.
  arXiv  Detail & Related papers  (2026-05-16T16:42:43Z)
• Interpolating Discrete Diffusion Models with Controllable Resampling [49.771004594828405]
  Masked diffusion models suffer from irreversible errors due to early unmasking.<n>Uniform diffusion models, despite enabling self-correction, often yield low-quality samples.<n>We introduce Interpolating Discrete Diffusion Model, that improves diffusion by reducing dependence on intermediate latent states.
  arXiv  Detail & Related papers  (2026-04-19T07:55:57Z)
• Timestep-Aware Block Masking for Efficient Diffusion Model Inference [48.764748095994996]
  Diffusion Probabilistic Models (DPMs) have achieved great success in image generation but suffer from high inference latency.<n>We propose a novel framework to optimize the computational graph of pre-trained DPMs on a per-timestep basis.
  arXiv  Detail & Related papers  (2026-03-20T13:35:03Z)
• Learning Flexible Forward Trajectories for Masked Molecular Diffusion [35.326540193307345]
  Masked diffusion models (MDMs) have achieved notable progress in modeling discrete data, while their potential in molecular generation remains underexplored.<n>We introduce the surprising result that naively applying standards MDMs severely degrades the performance.<n>We propose Masked Element-wise Learnable Diffusion (MELD) that orchestrates per-element corruption trajectories to avoid collision between distinct molecular graphs.
  arXiv  Detail & Related papers  (2025-05-22T15:30:17Z)
• Res-MoCoDiff: Residual-guided diffusion models for motion artifact correction in brain MRI [4.893666625661374]
  Motion artifacts in brain MRI, mainly from rigid head motion, degrade image quality and hinder downstream applications.<n>This study introduces Res-MoCoDiff, an efficient denoising diffusion probabilistic model specifically designed for MRI motion artifact correction.<n>The proposed method demonstrated superior performance in removing motion artifacts across minor, moderate, and heavy distortion levels.
  arXiv  Detail & Related papers  (2025-05-06T13:02:40Z)
• Simple and Critical Iterative Denoising: A Recasting of Discrete Diffusion in Graph Generation [0.0]
  dependencies between intermediate noisy states lead to error accumulation and propagation during the reverse denoising process.<n>We propose a novel framework called Simple Iterative Denoising, which simplifies discrete diffusion and circumvents the issue.<n>Our empirical evaluations demonstrate that the proposed method significantly outperforms existing discrete diffusion baselines in graph generation tasks.
  arXiv  Detail & Related papers  (2025-03-27T15:08:58Z)
• Robust Graph Learning Against Adversarial Evasion Attacks via Prior-Free Diffusion-Based Structure Purification [12.965945661913759]
  Adrial evasion attacks pose significant threats to graph learning.<n>We propose a novel Diffusion-based Structure Purification framework named DiffSP.<n>We demonstrate the superior robustness of DiffSP against evasion attacks.
  arXiv  Detail & Related papers  (2025-02-07T15:21:47Z)
• Masked Autoencoders Are Effective Tokenizers for Diffusion Models [56.08109308294133]
  MAETok is an autoencoder that learns semantically rich latent space while maintaining reconstruction fidelity.<n>MaETok achieves significant practical improvements, enabling a gFID of 1.69 with 76x faster training and 31x higher inference throughput for 512x512 generation.
  arXiv  Detail & Related papers  (2025-02-05T18:42:04Z)
• Bi-level Contrastive Learning for Knowledge-Enhanced Molecule Representations [68.32093648671496]
  We introduce GODE, which accounts for the dual-level structure inherent in molecules.<n> Molecules possess an intrinsic graph structure and simultaneously function as nodes within a broader molecular knowledge graph.<n>By pre-training two GNNs on different graph structures, GODE effectively fuses molecular structures with their corresponding knowledge graph substructures.
  arXiv  Detail & Related papers  (2023-06-02T15:49:45Z)
• DiGress: Discrete Denoising diffusion for graph generation [79.13904438217592]
  DiGress is a discrete denoising diffusion model for generating graphs with categorical node and edge attributes. It achieves state-of-the-art performance on molecular and non-molecular datasets, with up to 3x validity improvement. It is also the first model to scale to the large GuacaMol dataset containing 1.3M drug-like molecules.
  arXiv  Detail & Related papers  (2022-09-29T12:55:03Z)
• Guided Diffusion Model for Adversarial Purification [103.4596751105955]
  Adversarial attacks disturb deep neural networks (DNNs) in various algorithms and frameworks. We propose a novel purification approach, referred to as guided diffusion model for purification (GDMP) On our comprehensive experiments across various datasets, the proposed GDMP is shown to reduce the perturbations raised by adversarial attacks to a shallow range.
  arXiv  Detail & Related papers  (2022-05-30T10:11:15Z)

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.