Skip to content

Recovering molecules from coarse-grained beads: free-energy-conditioned generative backmapping across chemical space

Sep 2026 · 0 citations · 76 references
Physics Computer Science

TL;DR

This work forms compositional backmapping as conditional graph generation by introducing juniper, a discrete denoising diffusion model over molecular graphs conditioned on the octanol--water partition free energy, the principal driver of MARTINI bead type assignment and hence a proxy for bead identity.

Abstract

Transferable coarse-grained (CG) force fields compress chemical space: by aggregating atoms into a reduced set of interaction beads, models such as MARTINI reduce the number of distinguishable compounds by roughly three orders of magnitude, making high-throughput screening of thermodynamic properties tractable across soft matter, with drug--membrane permeability as a well-developed example. The compression is lossy and, so far, one-way: a screen returns a combination of beads, with no established route back to the compounds it stands for. Recovering those compounds--compositional backmapping--is a one-to-many inverse map, distinct from the better-studied conformational problem of rebuilding atomic coordinates from a known mapping. Here we formulate compositional backmapping as conditional graph generation by introducing juniper, a discrete denoising diffusion model over molecular graphs conditioned on the octanol--water partition free energy $\Delta G_{\mathrm{W} \mapsto \mathrm{O}}$, the principal driver of MARTINI bead type assignment and hence a proxy for bead identity. Trained on molecules of up to 9 heavy atoms mapped onto one or two beads, juniper generates molecules that are 93\% valid and 92\% unique for two-bead targets, and whose $\Delta G_{\mathrm{W} \mapsto \mathrm{O}}$ distributions track the target $\Delta G^{\mathrm{CG}}_{\mathrm{W} \mapsto \mathrm{O}}$ linearly ($r^{2} \geq 0.96$), departing only in the hydrophobic and hydrophilic tails. Although the model receives no chemical information beyond a single scalar, the functional groups shift systematically with the imposed free energy, from branched hydrocarbons at the apolar end to amides, imides, and isocyanates at the polar end. A bead combination flagged by a CG screen can therefore be turned into candidate molecules for atomistic study or synthesis.

View source

Similar papers

Open access Sep 2026

Local Variational Graph Coarsening for Machine Learning Coarse-Grained Molecular Dynamics Simulations.

This work introduces a multilevel graph-coarsening framework for coarse graining, inspired by recent advances in graph reduction with spectral and cut guarantees, and provides a data-driven bottom-up computational framework for the development of systematically improvable CG potentials with controlled accuracy and phys...

Soumya Mondal, Subhanu Halder, Debarchan Basu et al. · 0 citations
Preprint Sep 2026

Bridging Molecular Scales with Implicit Score Matching for Bottom-Up Coarse Graining

This work introduces an alternative framework based on implicit score matching that directly avoids the need for explicit coarse-grained forces and establishes implicit score matching as a practical route towards chemically accurate simulations that bridge molecular and mesoscopic scales.

Patrick G. Sahrmann, N. Lubbers, B. Nebgen et al. · 1 citation
Preprint Sep 2026

A Generalized Approach for Incorporating Geometry and Directionality into Coarse-Grained Machine-Learned Potentials

Results show that information loss in coarse-grained modeling is governed not only by mapping resolution but also by the symmetry and geometric information retained in the representation, providing a systematic route toward more expressive and transferable coarse-grained machine-learned potentials.

Arthur Y. Lin, Tejas Dahiya, Rose K. Cersonsky · 0 citations
Preprint Aug 2026

A Multi-Agent Framework for Automated Coarse-Grained Molecular Dynamics of Polymers

CGMas is presented, a multi-agent framework that automates topology construction, equilibration, mapping, potential derivation, and validation from a natural-language specification of the polymer and target resolution.

Joohee Choi, Junhyeong Lee, Seunghwa Ryu · 1 citation

Riemannian Flow Models with Reinforcement Learning for Molecular Crystal Structure Prediction

Crystal structure governs material properties, making crystal structure prediction (CSP) a fundamental problem in materials science. Generative models are a promising approach for solving this problem, but the prevalence of polymorphism, coupled with large unit cells and complex packing geometry, makes the molecular CS...

Thomas Egg, H. W. Sullivan, Maya M. Martirossyan et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Nov 17, 2026

Learning the language of machine learning

By studying the computational foundations of language learning, Associate Professor Jacob Andreas builds intelligent systems that can communicate effectively with humans.

Microsoft Research Blog Nov 16, 2026

TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient

AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.