It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
Force fields (FFs)---the (parametrized) mapping from the geometry of a physical state to potential energy and forces---are a crucial component of molecular dynamics (MD) simulations, whose associated Boltzmann-like target probability densities are sampled to estimate ensemble observables, to harvest quantitative insights of the system. Currently, state-of-the-art force fields are either fast (molecular mechanics, MM-based) or reliable (quantum mechanics, QM-based), but seldom both. Machine learning force fields strive to approach a balance between speed and accuracy by fitting simple neural functional forms to QM energies and forces, which, though approaching or surpassing chemical accuracy on some limited chemical spaces, are still orders of magnitude slower than MM force fields. In this thesis, leveraging graph-based machine learning and incorporating inductive biases crucial to chemical and biophysical modeling, we approach the lotusland from two angles---to make MM more accurate and to make machine learning force fields faster. Along the way, we design a plethora of useful gadgets, including the first unified force field for joint protein-ligand parametrization, an AM1-BCC surrogate charge model thousands-fold faster with error smaller than discrepancies among implementations, and a way to forecast the fate of dynamic systems before the simulation even starts.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer