Random Functions as Data Compressors for Machine Learning of Molecular Processes

Machine learning (ML) is rapidly transforming the way molecular dynamics simulations are performed and analyzed from materials modeling to studies of protein folding and function. ML algorithms are often employed to learn low-dimensional representations of conformational landscapes and cluster trajectories into relevant metastable states. Most of these algorithms require the selection of a small number of features that describe the problem of interest. Although deep neural networks can tackle large numbers of input features, the training costs increase with input size, which makes the selection of a subset of features mandatory for most problems of practical interest. Here, we show that random nonlinear projections can be used to compress large feature spaces and make computations faster without a substantial loss of information. We describe an efficient way to produce random projections and then exemplify the general procedure for protein folding. For our test cases NTL9 and the double-norleucin variant of the villin headpiece, we find that random compression retains the core static and dynamic information of the original high-dimensional feature space, making trajectory analysis more robust.