Tefle is introduced, a one-step flow model that amortizes physics-guided generation into training: a mean-flow objective replaces multi-step sampling, a low-cost surrogate replaces density functional theory (DFT) reward evaluations, and reinforcement-learning post-training with rewards that enforce those conditions replaces inference-time guidance.
Abstract
Transition-state searches remain a major bottleneck in reaction discovery, as identifying valid saddle-point structures requires numerous expensive quantum-chemical calculations. Generative models can reduce this burden by proposing candidates from reactant and product geometries, but supervised training on geometries alone does not enforce the physical conditions required of a transition state, while enforcing them during sampling is costly. We introduce Tr\`efle, a one-step flow model that amortizes physics-guided generation into training: a mean-flow objective replaces multi-step sampling, a low-cost surrogate replaces density functional theory (DFT) reward evaluations, and reinforcement-learning post-training with rewards that enforce those conditions replaces inference-time guidance. Tr\`efle generates accurate transition states at $30\times$ the throughput of multi-step baselines. It transfers few-shot to ten unseen transition metals and generalizes zero-shot to molecules far larger than any in training. With DFT refinement and reaction-path validation, Tr\`efle-seeded searches recover all 13 unseen $\gamma$-ketohydroperoxide channels, while post-training raises per-attempt recovery from 28% to 50% across 85 unseen bimolecular channels. Tr\`efle thus provides fast, reliable seeds for automated reaction discovery.
MARC-TS, a two-stage framework that learns a continuous, endpoint-conditioned path, queries it at any resolution and uses local path context to refine a transition-state candidate, is introduced.
Inverse materials design is a long-standing goal of computational materials discovery. Generative models for crystalline materials are typically trained to match the distribution of a structure database, while nothing in their training objective points them at specific design goals such as targeted properties. We use g...
Pawan Prakash, Philipp Höllmer, Addis S. Fuhr et al.· 0 citations
Sampling transitions between metastable states is a central problem in dynamical systems theory and molecular dynamics in particular. A key challenge is the existence of high free-energy barriers that separate the states, making transitions extremely rare. Recent machine learning-based methods cast transition path samp...
Bo-Ya Hou, Shan Wang, Siddharth Ambekar et al.· 0 citations
This work introduces MARCO, an evaluator-grounded reinforcement-learning framework that trains molecular editors on bounded proposal--feedback--revision trajectories and aggregates shaped turn rewards into an undiscounted trajectory return for group-relative policy optimization.
Shi-Cheng Fang, Yu-Xin Wang, Zhuo Yang et al.· 0 citations
GenAIMMD is introduced, an iterative algorithm that actively and self-consistently learns the ideal reaction coordinate (the committor) and trains a conditioned Boltzmann Generator to sample from arbitrary bias windows along it, providing a correlation-free and fully parallelizable path sampling scheme that does not re...
Maximilian Negedly, Sebastian Falkner, A. Coretti et al.· 0 citations
A common operator viewpoint is developed connecting generator-based partial differential equations, variational principles, Markov state models, dynamical Galerkin approximation, and neural networks with an emphasis on self-supervised methods that learn solutions of their defining dynamical equations rather than relyin...
J. Weare, Aaron R. Dinner· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.