TL;DR
REAP, a reinforcement learning-based adaptive sampling algorithm, efficiently explores protein conformational landscapes by dynamically learning the importance of reaction coordinates, outperforming traditional methods in speed and adaptability.
Contribution
This paper introduces REAP, a novel reinforcement learning approach for adaptive sampling that estimates reaction coordinate importance on-the-fly, enhancing exploration efficiency in molecular simulations.
Findings
REAP outperforms long MD and least-count adaptive sampling in exploring conformational space.
REAP effectively applies to both model landscapes and real protein systems.
The method is particularly useful for systems with limited structural information.
Abstract
One of the key limitations of Molecular Dynamics simulations is the computational intractability of sampling protein conformational landscapes associated with either large system size or long timescales. To overcome this bottleneck, we present the REinforcement learning based Adaptive samPling (REAP) algorithm that aims to efficiently sample conformational space by learning the relative importance of each reaction coordinate as it samples the landscape. To achieve this, the algorithm uses concepts from the field of reinforcement learning, a subset of machine learning, which rewards sampling along important degrees of freedom and disregards others that do not facilitate exploration or exploitation. We demonstrate the effectiveness of REAP by comparing the sampling to long continuous MD simulations and least-counts adaptive sampling on two model landscapes (L-shaped and circular), and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
