English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Statistically Optimal Force Aggregation for Coarse-Graining Molecular Dynamics

MPS-Authors
/persons/resource/persons292778

Chen,  Yaoyi       
IMPRS for Biology and Computation (Anne-Dominique Gindrat), Dept. of Computational Molecular Biology (Head: Martin Vingron), Max Planck Institute for Molecular Genetics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

acs.jpclett_Krämer et al_2023.pdf
(Publisher version), 6MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Krämer, A., Durumeric, A. E. P., Charron, N. E., Chen, Y., Clementi, C., & Noé, F. (2023). Statistically Optimal Force Aggregation for Coarse-Graining Molecular Dynamics. The Journal of Physical Chemistry Letters, 14(17), 3970-3979. doi:10.1021/acs.jpclett.3c00444.


Cite as: https://hdl.handle.net/21.11116/0000-000D-C56D-B
Abstract
Machine-learned coarse-grained (CG) models have the potential for simulating large molecular complexes beyond what is possible with atomistic molecular dynamics. However, training accurate CG models remains a challenge. A widely used methodology for learning bottom-up CG force fields maps forces from all-atom molecular dynamics to the CG representation and matches them with a CG force field on average. We show that there is flexibility in how to map all-atom forces to the CG representation and that the most commonly used mapping methods are statistically inefficient and potentially even incorrect in the presence of constraints in the all-atom simulation. We define an optimization statement for force mappings and demonstrate that substantially improved CG force fields can be learned from the same simulation data when using optimized force maps. The method is demonstrated on the miniproteins chignolin and tryptophan cage and published as open-source code.