Generative Pseudo-Force Fields for Molecular Generation

Stefaan Simon Pierre Hessmann, Khaled Kahouli, Stefan Gugler, Michael Plainer, Frank Noé, Klaus-Robert Müller, Niklas Wolf Andreas GebauerarXiv 2026 · arXiv

TL;DR

Generative Pseudo-Force Fields (GPFFs) unify machine learning force fields and diffusion models for 3D molecular generation. By training on a mathematically defined, cheap-to-compute "pseudo-potential energy surface," GPFFs eliminate the need for expensive quantum-mechanical data while remaining completely time-step-agnostic. This unlocks ultra-fast sampling, dynamic step-size adjustment, and real-time geometric constraints for targeted molecular design.

What Problem Does This Paper Address?

Generating stable 3D molecular structures usually forces researchers to choose between two distinct paradigms, each with its own bottleneck:

  1. Machine Learning Force Fields (MLFFs): These models simulate physical relaxation to find stable structures by following interatomic forces. However, they require massive, computationally expensive ab-initio datasets (like Density Functional Theory calculations) of non-equilibrium geometries for training.
  2. Diffusion Models (DMs): These data-driven models learn directly from easily available equilibrium data by reversing a synthetic noise process. However, they are rigidly bound to fixed noise schedules and explicit time-step conditioning, meaning you cannot easily modify the structure mid-generation or change step sizes dynamically.

The authors bridge this gap, creating a model that inherits the training efficiency of diffusion models (requiring no expensive quantum chemistry labels) and the flexible, relaxation-style sampling of force fields.

Methods

The core innovation is the Generative Pseudo-Force Field (GPFF). Instead of learning real physical forces, a standard MLFF architecture (PaiNN) is trained on a synthetic, quadratic pseudo-potential energy surface (pseudo-PES) centered on reference equilibrium structures. Non-equilibrium training data is generated cheaply on the fly by corrupting equilibrium coordinates with Gaussian noise.

Overview of GPFF training, sampling, and geometric constraints

Crucially, because the magnitude of the learned pseudo-forces directly scales with the noise level, the model implicitly encodes its own position in the denoising process. This makes GPFF entirely time-step-agnostic. The authors exploit this flexibility to introduce three novel sampling strategies:

  • Direct Denoising (DD): An MLFF-style relaxation that takes large gradient steps directly toward the predicted equilibrium, bypassing rigid diffusion schedules.
  • Adaptive Sampling (AS): A method where the sampler reads the true noise level directly from the predicted force magnitudes and dynamically rescales step sizes to correct discretization errors.
  • Geometric Constraints: Modifying intermediate structures to enforce specific macroscopic shapes (rod, disc, sphere) or lock a molecular scaffold in place.

Datasets

The model was trained and evaluated on the QM9 dataset, a standard benchmark containing roughly 134,000 small organic molecules (up to 9 heavy atoms) in their equilibrium states.

Key Insights and Ideas

  • The Magnitude is the Message: Standard diffusion models predict normalized noise directions, stripping away scale information and forcing the network to rely on explicit time-step conditioning. GPFF predicts unnormalized forces; the force magnitude itself tells the model how much noise is left.
  • Time-Step Independence Unlocks Control: Because the model doesn't care about a fixed time index, researchers can manipulate the molecular geometry during the generation process. This allows for the seamless injection of spatial priors or rigid scaffold constraints without retraining the model.
  • Mathematical Equivalence: The authors prove that GPFF is mathematically equivalent to a time-step-agnostic variant of Variance Exploding (VE) diffusion models, where the score function is recovered in closed form from the predicted pseudo-forces.

Key Results

  • Ultra-Fast, Valid Sampling: Using Direct Denoising, GPFF achieves over 50% molecular validity at just 6 neural function evaluations (NFEs) and 100% validity at 256 NFEs, significantly outperforming standard diffusion baselines at low computational budgets.
  • Adaptive Benefits: Adaptive Heun sampling boosted molecular validity from 87% to 92% at 255 steps by dynamically correcting schedule deviations.
Comparison of adaptive vs non-adaptive sampling trajectories
  • Targeted Design: The authors demonstrated that GPFF can successfully steer generation toward specific shapes (exceeding 98% validity for rod, disc, and sphere targets). Furthermore, they showcased a real-time interactive molecular editor that can assemble complex molecules like aspirin step-by-step using scaffold constraints.
Iterative scaffold-guided design process for aspirin

Limitations and Future Work

  • Scale and Complexity: GPFF was exclusively evaluated on the QM9 dataset (small molecules with at most 9 heavy atoms). Its performance on larger macromolecular systems (like proteins) or periodic structures (like crystals) remains to be demonstrated.
  • Composition Dependency: The model requires the exact molecular formula (atom types) to be specified beforehand; it does not jointly generate atom types and positions.
  • Future Directions: The authors suggest extending the pseudo-PES beyond a simple quadratic form by incorporating physical energy labels, which could bias the generation landscape toward chemically relevant local minima and serve as a pre-training stage for traditional MLFFs.

Summary updated

Abstract

Generating stable molecular conformations typically forces a tradeoff between the physical realism of energy-based relaxation and the sampling efficiency of data-driven generative models. While machine learning force fields (MLFFs) can sample stable conformations by relaxing molecular geometries according to physical forces, they require costly ab-initio training data. Conversely, diffusion models (DMs) learn from equilibrium data alone but are dependent on noise schedules and time-step conditioning. In this work, we propose generative pseudo-force fields (GPFFs) to bridge these paradigms by training an MLFF on a quadratic pseudo-potential energy surface relative to reference equilibrium structures. Because no ab-initio calculations are required for the perturbed geometries, non-equilibrium training data can be generated on the fly by perturbing the equilibria with Gaussian noise. We show that GPFFs constitute a time-step-agnostic variant of variance exploding DMs: the score comes from the predicted pseudo-forces but because force magnitudes implicitly encode the noise level, no time-step conditioning is needed. Our GPFF can hence be used as a drop-in replacement in standard diffusion sampling (ancestral, Heun) but also facilitates more efficient, adaptive variants and an MLFF inspired direct denoising scheme. Our proposed sampling algorithms support arbitrary structural priors and geometric constraints. On QM9, GPFF has 100 % validity at 256 neural function evaluations (NFE) and over 50 % at just 6 NFE, outperforming diffusion baselines across all samplers. Combined with custom priors, we showcase the fast and accurate generation process of our method in a molecular editor for a drug design setting, where a molecule is generated in real time.
BibTeX
@misc{hessmann2026generative,
  author = {Stefaan Simon Pierre Hessmann and Khaled Kahouli and Stefan Gugler and Michael Plainer and Frank Noé and Klaus-Robert Müller and Niklas Wolf Andreas Gebauer},
  title = {{Generative Pseudo-Force Fields for Molecular Generation}},
  year = {2026},
  eprint = {2605.19050},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2605.19050},
}

Loading related content...

Figure