Learning Clustered Representation for Complex Free Energy Landscapes

06/07/2019
by   Jun Zhang, et al.
0

In this paper we first analyzed the inductive bias underlying the data scattered across complex free energy landscapes (FEL), and exploited it to train deep neural networks which yield reduced and clustered representation for the FEL. Our parametric method, called Information Distilling of Metastability (IDM), is end-to-end differentiable thus scalable to ultra-large dataset. IDM is also a clustering algorithm and is able to cluster the samples in the meantime of reducing the dimensions. Besides, as an unsupervised learning method, IDM differs from many existing dimensionality reduction and clustering methods in that it neither requires a cherry-picked distance metric nor the ground-true number of clusters, and that it can be used to unroll and zoom-in the hierarchical FEL with respect to different timescales. Through multiple experiments, we show that IDM can achieve physically meaningful representations which partition the FEL into well-defined metastable states hence are amenable for downstream tasks such as mechanism analysis and kinetic modeling.

READ FULL TEXT
research
03/05/2018

Deep Continuous Clustering

Clustering high-dimensional datasets is hard because interpoint distance...
research
11/03/2016

A-Ward_pe̱ṯa̱: Effective hierarchical clustering using the Minkowski metric and a fast k -means initialisation

In this paper we make two novel contributions to hierarchical clustering...
research
08/27/2021

Variational embedding of protein folding simulations using gaussian mixture variational autoencoders

Conformational sampling of biomolecules using molecular dynamics simulat...
research
08/31/2019

Energy Clustering for Unsupervised Person Re-identification

Due to the high cost of data annotation in supervised learning for perso...
research
04/12/2022

A Hierarchical Block Distance Model for Ultra Low-Dimensional Graph Representations

Graph Representation Learning (GRL) has become central for characterizin...
research
11/29/2022

Hierarchically Clustered PCA and CCA via a Convex Clustering Penalty

We introduce an unsupervised learning approach that combines the truncat...
research
01/31/2013

Axiomatic Construction of Hierarchical Clustering in Asymmetric Networks

This paper considers networks where relationships between nodes are repr...

Please sign up or login with your details

Forgot password? Click here to reset