Equivariant Efficient Joint Discrete and Continuous MeanFlow for Molecular Graph Generation

• URL: http://arxiv.org/abs/2604.08189v1
• Date: Thu, 09 Apr 2026 12:42:01 GMT
• Title: Equivariant Efficient Joint Discrete and Continuous MeanFlow for Molecular Graph Generation
• Abstract summary: Graph-structured data jointly contain discrete topology and continuous geometry.<n>Existing flow-matching approaches for graph generation typically decouple structure from geometry.<n>We propose Equivariant MeanFlow (EQUIMF), a unified SE(3)-equivariant generative framework.
• Score: 10.729712481687628
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph-structured data jointly contain discrete topology and continuous geometry, which poses fundamental challenges for generative modeling due to heterogeneous distributions, incompatible noise dynamics, and the need for equivariant inductive biases. Existing flow-matching approaches for graph generation typically decouple structure from geometry, lack synchronized cross-domain dynamics, and rely on iterative sampling, often resulting in physically inconsistent molecular conformations and slow sampling. To address these limitations, we propose Equivariant MeanFlow (EQUIMF), a unified SE(3)-equivariant generative framework that jointly models discrete and continuous components through synchronized MeanFlow dynamics. EQUIMF introduces a unified time bridge and average-velocity updates with mutual conditioning between structure and geometry, enabling efficient few-step generation while preserving physical consistency. Moreover, we develop a novel discrete MeanFlow formulation with a simple yet effective parameterization to support efficient generation over discrete graph structures. Extensive experiments demonstrate that EQUIMF consistently outperforms prior diffusion and flow-matching methods in generation quality, physical validity, and sampling efficiency.

Related papers

• Fluid-DiT: Graph-Free Diffusion Transformers for Fluid Flow Simulations Learning [50.053186229257555]
  We propose a Graph-Free Diffusion Transformer that replaces graph message passing with attention-based denoising.<n>By leveraging the transformer's global receptive field, Fluid-DiT naturally captures both local flow structures and long-range correlations.<n>It consistently outperforms graph-based diffusion baselines in both sample quality and distributional accuracy.
  arXiv  Detail & Related papers  (2026-08-07T12:28:45Z)
• Simplifying Flow Matching Transformations with Low-Rank Mixture Models [58.797704398690165]
  We propose using mixtures of probabilistic principal component analyzers (MPPCA) as the latent density for normalizing flows.<n>We simplify the learned flow transformation by learning a latent distribution that more closely aligns with the data distribution in terms of KL divergence.<n>MPPCA models can be fit quickly and cheaply using the expectation-maximization algorithm, making them a practical choice for initializing latent distributions even in high-dimensional generative tasks.
  arXiv  Detail & Related papers  (2026-06-29T03:03:06Z)
• FluidFlow: a flow-matching generative model for fluid dynamics surrogates on unstructured meshes [2.7455202504794642]
  We introduce FluidFlow, a generative model based on conditional flow-matching.<n> FluidFlow is specifically designed to operate directly on CFD data defined on both structured and unstructured meshes.
  arXiv  Detail & Related papers  (2026-03-30T10:08:20Z)
• EFF-Grasp: Energy-Field Flow Matching for Physics-Aware Dexterous Grasp Generation [54.09734511705173]
  EFF-Grasp is a Flow-Matching synthesis-based framework for physics-aware dexterous grasp generation.<n>We reformulate grasp as a deterministic ordinary differential equation (ODE) process, which enables efficient and stable generation through smooth probability flows.<n> EFF-Grasp achieves superior performance in grasp quality and physical feasibility, while requiring substantially fewer sampling steps than diffusion-based baselines.
  arXiv  Detail & Related papers  (2026-03-17T06:11:56Z)
• Flow Matching is Adaptive to Manifold Structures [32.55405572762157]
  Flow matching is a simulation-based alternative to diffusion-based generative modeling.<n>We show how flow matching adapts to data geometry and circumvents the curse of dimensionality.
  arXiv  Detail & Related papers  (2026-02-25T23:52:32Z)
• Variational Bayesian Flow Network for Graph Generation [54.94088904387278]
  We propose Variational Bayesian Flow Network (VBFN) for graph generation.<n>VBFN performs variational lifting to a tractable joint Gaussian variational belief family governed by structured precisions.<n>On synthetic and molecular graph datasets, VBFN improves fidelity and diversity, and surpasses baseline methods.
  arXiv  Detail & Related papers  (2026-01-30T03:59:38Z)
• TimeFlow: Towards Stochastic-Aware and Efficient Time Series Generation via Flow Matching Modeling [2.74279932215302]
  Time series data has emerged as a critical research topic due to its broad utility in supporting downstream time series mining tasks.<n>We propose TimeFlow, a novel flow matching framework that integrates a encoder-only architecture.<n>Our model consistently outperforms strong baselines in generation quality, diversity, and efficiency.
  arXiv  Detail & Related papers  (2025-11-11T08:28:26Z)
• Unfolding Generative Flows with Koopman Operators: Fast and Interpretable Sampling [25.420559502119485]
  Continuous Normalizing Flows (CNFs) enable elegant generative modeling but remain bottlenecked by slow sampling.<n>Recent approaches such as Rectified Flow and OT-CFM accelerate sampling by straightening trajectories, yet the learned dynamics remain nonlinear black boxes.<n>We propose globally linearizing flow dynamics via Koopman theory.
  arXiv  Detail & Related papers  (2025-06-27T15:16:16Z)
• On the Trajectory Regularity of ODE-based Diffusion Sampling [79.17334230868693]
  Diffusion-based generative models use differential equations to establish a smooth connection between a complex data distribution and a tractable prior distribution. In this paper, we identify several intriguing trajectory properties in the ODE-based sampling process of diffusion models.
  arXiv  Detail & Related papers  (2024-05-18T15:59:41Z)
• Generative Flows on Discrete State-Spaces: Enabling Multimodal Flows with Applications to Protein Co-Design [37.634098563033795]
  We present a new flow-based model of discrete data that provides the missing link in enabling flow-based generative models. Our key insight is that the discrete equivalent of continuous space flow matching can be realized using Continuous Time Markov Chains. We apply this capability to the task of protein co-design, wherein we learn a model for jointly generating protein structure and sequence.
  arXiv  Detail & Related papers  (2024-02-07T16:15:36Z)
• Equivariant Flow Matching with Hybrid Probability Transport [69.11915545210393]
  Diffusion Models (DMs) have demonstrated effectiveness in generating feature-rich geometries. DMs typically suffer from unstable probability dynamics with inefficient sampling speed. We introduce geometric flow matching, which enjoys the advantages of both equivariant modeling and stabilized probability dynamics.
  arXiv  Detail & Related papers  (2023-12-12T11:13:13Z)
• Equivariant flow matching [0.9208007322096533]
  We introduce equivariant flow matching, a new training objective for equivariant continuous normalizing flows (CNFs) Equivariant flow matching exploits the physical symmetries of the target energy for efficient, simulation-free training of equivariant CNFs. Our results show that the equivariant flow matching objective yields flows with shorter integration paths, improved sampling efficiency, and higher scalability compared to existing methods.
  arXiv  Detail & Related papers  (2023-06-26T19:40:10Z)
• A Geometric Perspective on Diffusion Models [57.27857591493788]
  We inspect the ODE-based sampling of a popular variance-exploding SDE. We establish a theoretical relationship between the optimal ODE-based sampling and the classic mean-shift (mode-seeking) algorithm.
  arXiv  Detail & Related papers  (2023-05-31T15:33:16Z)
• Moser Flow: Divergence-based Generative Modeling on Manifolds [49.04974733536027]
  Moser Flow (MF) is a new class of generative models within the family of continuous normalizing flows (CNF) MF does not require invoking or backpropagating through an ODE solver during training. We demonstrate for the first time the use of flow models for sampling from general curved surfaces.
  arXiv  Detail & Related papers  (2021-08-18T09:00: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.