AdaptivePy is presented, a compact and extensible Python framework that implements nine seed-selection policies behind a single configuration-driven interface, spanning simple population-based baselines, several established machine-learning and geometry-based methods, and two ensemble or meta sampling policies introduced in this work.
Abstract
Adaptive sampling accelerates the exploration of conformational space in molecular dynamics (MD) simulations by repeatedly analyzing the accumulated trajectories and seeding a new round of simulations from informative configurations. A growing collection of adaptive sampling policies has been proposed, each built around a particular notion of what makes a configuration informative, yet these methods are scattered across separate and often incompatible implementations, which complicates their systematic comparison and their combined use in meta adaptive sampling schemes. Here, we present AdaptivePy, a compact and extensible Python framework that implements nine seed-selection policies behind a single configuration-driven interface, spanning simple population-based baselines, several established machine-learning and geometry-based methods, and two ensemble or meta sampling policies introduced in this work. We show that the shared implementation reproduces the characteristic selection behavior of each policy on a series of analytic benchmark landscapes. We also introduce a new adaptive sampling scheme that employs TS-DAR, a deep learning framework originally designed to identify transition states, into an acquisition criterion that drives the discovery of an entire multi-basin landscape starting from a single basin. We further demonstrate that the common interface enables meta adaptive sampling policies, which aggregate the rankings of several policies into a single set of seeds. AdaptivePy thereby provides a unified testbed for the adoption, benchmarking, and continued development of adaptive sampling methods for biomolecular MD simulations.
The convergence mechanism is established as a practical design principle for molecular generative sampling, clarifying when stochastic diffusion provides robustness and when deterministic transport requires higher representational capacity.
Nagesh B. E., Jagannath Mondal· Journal of Chemical Theory a...· 0 citations
This work introduces NS-Flows: a single conditional normalizing flow, conditioned on the NS energy bound and trained on a sliding window of recent live sets, that replaces MCMC by direct parallel draws corrected by importance-weighted rejection resampling, allowing flow training without structured priors or a pre-exist...
A. Coretti, N. Unglert, Sebastian Falkner et al.· 0 citations
Two stochastic policies are developed that consistently improve transition success and path quality over deterministic-policy baselines while substantially reducing sensitivity to random initialization.
Jing-Qian Liu, Yu-Hsiang Wang, Yanru Qu et al.· 0 citations
A new paradigm that has recently emerged at the interface of machine learning and computational statistical physics: the use of generative models as tools for sampling through flexible probabilistic models that can assist the sampling of distributions known only up to a normalization constant is explored.
The results demonstrate that GROMACS-GaMD provides a practical, GPU-enabled, collective-variable-free enhanced-sampling framework for biomolecular free-energy calculations, protein folding, and ligand-binding studies.
METALICA, which implements Metadynamics on a pretrained diffusion model via Replica Exchange, is introduced, which implements Metadynamics on a pretrained diffusion model via Replica Exchange and accumulates a bias potential along a Collective Variable, repels new samples from previous ones through biased sampling, and...
Alireza Omidi, Jiajun He, Jörg Gsponer et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.