mlsanityData to 14 Oct 2026

GANs and Closures: Micro-Macro Consistency in Multiscale Modeling

arXiv 2208.10715 ↗First posted 23 Aug 2022cs.LG math.DS physics.chem-phcited by 4

Not on the map. Why?

Abstract (arXiv)

Sampling the phase space of molecular systems -- and, more generally, of complex systems effectively modeled by stochastic differential equations -- is a crucial modeling step in many fields, from protein folding to materials discovery. These problems are often multiscale in nature: they can be described in terms of low-dimensional effective free energy surfaces parametrized by a small number of "slow" reaction coordinates; the remaining "fast" degrees of freedom populate an equilibrium measure on the reaction coordinate values. Sampling procedures for such problems are used to estimate effective free energy differences as well as ensemble averages with respect to the conditional equilibrium distributions; these latter averages lead to closures for effective reduced dynamic models. Over the years, enhanced sampling techniques coupled with molecular simulation have been developed. An intriguing analogy arises with the field of Machine Learning (ML), where Generative Adversarial Networks can produce high dimensional samples from low dimensional probability distributions. This sample generation returns plausible high dimensional space realizations of a model state, from information about its low-dimensional representation. In this work, we present an approach that couples physics-based simulations and biasing methods for sampling conditional distributions with ML-based conditional generative adversarial networks for the same task. The "coarse descriptors" on which we condition the fine scale realizations can either be known a priori, or learned through nonlinear dimensionality reduction. We suggest that this may bring out the best features of both approaches: we demonstrate that a framework that couples cGANs with physics-based enhanced sampling techniques can improve multiscale SDE dynamical systems sampling, and even shows promise for systems of increasing complexity.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 9 of its 59 references that are in the map. First posted on arXiv 23 Aug 2022.

Builds on

9 of 59 references.

References · 9

  1. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
  2. 2021Diffusion Models Beat GANs on Image Synthesiscited by 8,255
  3. 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 6,013
  4. 2022Generative Adversarial Networkscited by 5,627
  5. 2014Conditional Generative Adversarial Netscited by 2,162
  6. 2020Improved Techniques for Training Score-Based Generative Modelscited by 1,043
  7. 2020Molecular Latent Space Simulatorscited by 14
  8. 2021Chasing Collective Variables using Autoencoders and biased trajectoriescited by 13
  9. 2021On the Correspondence between Gaussian Processes and Geometric Harmonicscited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 0; 2025: 1; 2026: 1.

4 papers.