Deep Signature: Characterization of Large-Scale Molecular Dynamics
Authors: Tiexin Qin
Mengxu ZHU
Chunyang Li
Terry Lyons
Hong Yan
Haoliang Li
Venue: ICLR 2025 Poster (2025)
Keywords: Molecular dynamics; representation learning; graph neural network; path signature
Primary area: applications to physical sciences (physics, chemistry, biology, etc.)

Abstract: Understanding protein dynamics are essential for deciphering protein functional mechanisms and developing molecular therapies. However, the complex high-dimensional dynamics and interatomic interactions of biological processes pose significant challenge for existing computational techniques. In this paper, we approach this problem for the first time by introducing Deep Signature, a novel computationally tractable framework that characterizes complex dynamics and interatomic interactions based on their evolving trajectories. Specifically, our approach incorporates soft spectral clustering that locally aggregates cooperative dynamics to reduce the size of the system, as well as signature transform that collects iterated integrals to provide a global characterization of the non-smooth interactive dynamics. Theoretical analysis demonstrates that Deep Signature exhibits several desirable properties, including invariance to translation, near invariance to rotation, equivariance to permutation of atomic coordinates, and invariance under time reparameterization. Furthermore, experimental results on three benchmarks of biological processes verify that our approach can achieve superior performance compared to baseline methods.

Published as a conference paper at ICLR 2025
DEEP SIGNATURE: CHARACTERIZATION OF LARGE- SCALE MOLECULAR DYNAMICS
Tiexin Qin', Mengxu Zhu', Chunyang Li, Terry Lyons', Hong Yan', Haoliang Li City University of Hong Kong' & Chengdu Institute of Biological Products co. Lid² & University of Oxford
ftiexinqin, mengxuzhu wew.ey/cctccumeeeeeeeee.... edu hk, htt..hh........uaaaaaageooooooao t clyons@mathe ths. ox. ac. uk, {ityan, waw.ollann..ill.. htty hk
ABSTRACT
Understanding protein dynamics are essential for deciphering protein functional mechanisms and developing molecular therapies. However, the complex high- dimensional dynamics and interatomic interactions of biological processes pose significant challenge for existing computational techniques. this paper, we ap- proach this problem for the first time by introducing Deep Signature, a novel com- putationally tractable framework that characterizes complex dynamics and inter- atomic interactions based on their evolving trajectories. Specifically, our approach incorporates soft spectral clustering that locally aggregates cooperative dynamics reduce the size of the system, well signature transform that collects iter- the non-smooth interactive
ated integrals to provide a global characterization dynamics. Theoretical analysis demonstrates that Deep Signature exhibits sev- eral desirable properties, including invariance to translation, near invariance to rotation, equivariance to permutation of atomic coordinates, and invariance under time reparameterization. Furthermore, experimental results on three benchmarks of biological processes verify that our approach can achieve superior performance compared to baseline methods.
INTRODUCTION
Biological processes are fundamentally driven by the dynamical changes of macromolecules, par- ticularly proteins and enzymes, within their respective functional conformation spaces. Typical examples of such processes include protein-ligand binding, molecule transport and enzymatic reac- tions, and modern computational biologists investigate their underlying functional mechanisms by molecular dynamics (MD) simulations (Dror al., 2012; Lewandowski et al., 2015). Built upon density functional theory (Car & Parrinello, 1985), MD has demonstrated remarkable capability in providing accurate atomic trajectories three-dimensional (3D) conformational space and consist agreement with experimental observations (Frenkel & Smit, 2023).
The computational analysis MD data has been a subject of extensive research for decades, with the goal of characterizing systems from trajectory information. However, due to the main challenge posed by intricate interatomic interactions over large-scale systems across inconsistent timescales, many existing works resort to oversimplified setups that incorporate biophysical priors analyze certain aspects of dynamics such as protein fluctuations, relaxation time, stability, and state tran- sitions (Law et al., 2017: Qiu al., 2023). More recently, empowered by the parallel processing ability of GPUs, machine learning especially deep learning sheds new light on this field as it can discretize macromolecules as particles distributed in 3D voxel grid and automatically learn their relations in a data-driven fashion (Li et al., 2020a; Rogers et al., 2023). Parallel to this, surface modeling based approaches have emerged, firstly utilizing mathematical models to restore protein surfaces and then applying deep learning to analyze the chemical and geometrical features of sur- face regions around binding sites (Gainza al., 2020b; Zhu et al., 2021). Despite the great potential of these approaches in automatic drug discovery, their computational complexity would increase linearly with the number of time stamps when processing MD data, struggling with application to
"Corresooniigg author.

---

Published as a conference paper at ICLR 2025
long-time simulations. Besides, these methods commonly build upon coarse grained dynamics for accelerating computation. Nevertheless, selecting an optimal coarse graining mapping strategy that effectively simplifies the representation of the system while preserving essential features remains an open research problem (Jin et al., 2022; Majewski et al., 2023).
Another limitation of current MD analysis methods is the deficient utilization of structural bioin- formatics for the largely increased difficulty in handling high-order interatomic interactions during dynamic processes. However, such structural bioinformatics, manifested in various covalent and non-covalent bonds, plays a pivotal role in molecular design for its capability of propagating local perturbations facilitate conformational dynamics and alter biological function (Tsai et al., 2009; Otten et al., 2018). An illustrative example would be dihydrofolate reductase, which has been widely studied as important antitumor and antibacterial targets for treating tuberculosis and malaria. There exist four common mutations that confer drug resistance to antibiotics, proceeding in stepwise fashion. Among them, the P21L mutation acts a dynamical loop region associated with long range structural vibrations of the protein backbone, rather than directly the active sites other mutations (Toprak et al., 2012). Therefore, ignoring such interatomic interactive dynamics facili- tated by molecular structure for critical protein and counting the effects of active sites solely can result in biased assessments of designed drugs. Nonetheless, since the integration of structural bioin- formatics into MD analysis would further introduce least quadratic complexity with system size, existing works have not yet investigated this crucial aspect, highlighting a critical gap in our ability to comprehensively analyze and predict molecular behavior in drug design and resistance studies.
To this end, we aim to develop computationally efficient framework that incorporates the structural bioinformatics with coarse graining mapping for automatically analyzing protein trajectory dynam- ics. In particular, we first introduce a graph clustering module that learns to extract coarse grained dynamics by approximating soft spectral clustering. With the clustering assignment function imple- mented by a graph neural network and parameters learned automatically, we circumvent the need for manual selection of coarse graining mapping. Subsequently, we introduce a path signature trans- form module served as feature extractor to characterize the interatomic interactive dynamics after coarse graining. Path signature is a mathematically principled concept that utilizes iterated integrals to describe geometric rough paths in compact yet rich manner (Lyons, 2014), thus suitable for our tasks where molecular trajectories are highly sampled and non-smooth. After attaching with a devise end-to-end framework, named Deep
task-specific differentiable classifier or regressor, Signature, for efficiently characterizing the complex protein dynamics. Notably, due to the exis- tence of considerable random fluctuation in simulated trajectories, ideal features ought to maintain symmetry respecting certain geometric transformations. We provide theoretical analysis that our extracted features exhibit invariance to translation, near invariance to rotation, equivariance to per- mutation of atomic coordinates, and invariance under time reparametrization of paths. Finally, we target our task on predicting functional properties of proteins from MD data, a fundamental task for developing novel drug therapies. We consider three benchmarks including gene regulatory dynam- ics, epidermal growth factor receptor (EGFR) mutation dynamics, and protein-coupled receptors (GPCR) dynamics for performance evaluation. The contributions of our paper are as follows:
We develop Deep signature, the first computationally efficient framework that characterizes the complex interatomic interactive dynamics of large-scale molecules.
We theoretically demonstrate that our approach preserves symmetry under several geometrical transforms of atomic coordinates in 3D conformational space. Additionally, our method remains invariant under time reparameterization.
We provide empirical results to show that our Deep Signature model achieves superior per- formance compared to other baseline methods on gene regulatory dynamics, EGFR mutation dynamics and GPCR dynamics.
2 RELATED WORKS
Molecular Representation. Encoding essential structural characteristics and biochemical proper- ties into molecular representations a long-standing research field in molecular biology, with wide applications in various drug discovery processes including virtual screening, similarity-base com- pound searches, target molecule ranking, drug toxicity prediction, and etc. (Li et al., 2024). One of the most widely used categories of molecular representation is -wo-dimensional fingerprints that extract the substructure, topological routes and circles solely from molecular connection tables. Ow- ing their ease of generation and usage, these 2D fingerprints are still extensively utilized input
2

---

Published as a conference paper at ICLR 2025
for machine learning algorithms in modern drug discovery applications (Gao et al., 2020). In recent years, there has been a surge in the development of 3D structure- based molecular representations for their much more fine-grate fine-grained characterization of interatomic interplay in 3D conformational space. Surface modeling-basee approaches leverage mathematical models to restore protein surfaces and encode geometrical and chemical features of surface regions around binding sites into representa- tions, exhibiting great potential in automatic drug discovery (Gainza et al., 2020a; Zhu et al., 2021). In addition surface-based representations, significant efforts have been devoted to learning accu- rate deep learning force fields for accelerating MD simulation (Schütt et al., 2017a; Batatia et al., 2022: Batzner al., 2022). While these methods can be adapted for molecular property prediction, they are limited to generating representation for static frame, thus not suitable for our tasks where interframe interactions along timescales are crucial for understanding protein function.
The current investigation into characterizing molecular dynamics, especially interatomic interaction dynamics, remains limited, with only a few studies close to ours. Among them, Endo et al. (2019),
Yasuda et al. (2022) and Mustali et al. (2023) are unsupervised methods that build local dynamics en- sembles for pre-specified atoms and inspect each atom's ss contribution independently. Li et al. (2022) converts MD conformations into images and applies convolutional neural networks identify di- verse active states. Sun et al. (2023) models protein dynamics by representing protein surfaces using implicit neural networks without requiring explicit surface representations. Nevertheless, these ap- proaches cannot capture subtle interatomic interactions along atomic pathways for dissecting protein function, nor is the complexity of their representations independent of time stamps.
Coarse Graining (CG). CG is a widely adopted technique with the objective of preserving the crucial characteristies and dynamies inherent to a molecular system. This is achieved by grouping sets of atoms into CG beads, thereby enabling high-throughput MD simulations over larger time and length scales. Existing CG methods can be broadly categorized into two types: chemical and physical intuition-basee approaches and machine learning- based approaches. The methods of first type construct the CG mapping by incorporating various biochemical properties derived from expert knowledge, for example, mapping each elaborately constructed cluster of four heavy (nonhydrogen) atoms into a single CG bead (Marrink & Ticleman, 2013) or simply assigning one CG bead centered at the a-carbon for each amino acid (Ingólfsson et al., 2014). Machine learning-base -ased methods can rapidly learn accurate potential energy functions for reduced structures of MD by training on large databases. Recent advancements in this area include multiscale coarse graining that optimizes to maximize a variational force matching score (Wang& & Gómez- Bombarelo,b,,lli, 2019), relative en- tropy minimization (Thaler et al., 2022), and spectral graph approaches that account for structural typologies of proteins (Webb et al., 2018; Li et al., 2020b). However, their transferability to un- seen molecules remains suspicious, and the representation capability for complex macromolecular systems without increasing dimension and complexity is still underexplored (Khot et al., 2019).
METHODOLOGY
3.1 PROBLEM FORMULATION
Consider various molecular systems ((k) that are distinct in their molecular behaviors. An MD sim- ulation trajectory on ((k) provides the trajectories for all N₂ atoms constituting the molecules, and can be represented as a sequence of snapshots x ( = [x(** xx("
x x(A)). ). Here, x C RR x3
indicates the atomic positions in 3D conformational space at time step for E {l..... T and T. is the total number of frames. To describe the structure of molecules within S(k), we define a molec- ular graph ((k) = {E(A), V(A) [V()] = Nr, where (*)) is the node set corresponding to the atoms and (k) is the edge set corresponding to chemical bonds. The adjacency matrix of ((k) is repre- sented by A (k) E Nr xN,, with ! 1 if Us Bj E V(() and (u,, E g(K) For the molecular property prediction task, have access to MD trajectories from K molecular systems, each en- dowed with property labels denoted as ((x(8 L.2. y(k) ) The objective is to train algorithms to accurately predict the property label when provided with an previously unseen MD trajectory X1:T.-
3.2 DEEP SIGNATURE
Our proposed method, referred to as Deep Signature, consists of a deep spectral clustering module that uses GNNs extract coarse grained dynamics from raw MD trajectories, a path signature trans-
3

---

Published as a conference paper at ICLR 2025
Path signature features
Path Signature Transform Module
Classifier
CG conformational space
Deep Spectral Clustering Module
t=1
2
conformational space
Figure I: An overview of our proposed Deep Signature method.
form module that collects iterated integrals to characterize interatomic interactions along pathways, and classifier to enable property prediction. The overall architecture is illustrated in Fig. 1.
Deep spectral clustering with GNNs. Given the MD trajectory XI.T and molecular graph G for molecular system S, we start with extracting the reduced trajectory X by coarse gaining X using deep spectral clustering. Specifically, we first obtain node representations via GNN layers as
H = (D 1/2 -D-1//2/A H/2H' W W))),
(1)
where H' denotes the node feature matrix the (-th layer, H X XIT A=
A I the adjacency CNN are the learnable parameters
matrix A plus the identity matrix I, D is the degree matrix of A, W of GNNs, and a is nonlinear activation function. After then, we compute the cluster assignment matrix Q for the nodes using multi-layer perceptron (MLP) with softmax the output layer
Q Softmax( W MLP H + bb.
where W MLP and b are trainable parameters of the MLP. For the assignment matrix Q E N where M & N specifies the number of clusters, each row of it represents the node's probability of belonging to particular cluster. We employ the normalized-cut relaxation (Bianchi al., 2020) as our clustering objective minimization
Tr(Qu AQ)
11@00
QJQ
Is
L.
TT(QTDQ)
Q
VM
where the first term promotes strongly connected components to be clustered together, while the second term encourages the cluster assignments to be orthogonal and have similar sizes.
Upon leveraging Q from Eq. (2) for clustering, the corresponding reduced feature embedding matrix H' and adjacency matrix A' can be derived follows
H' = -TQH; A' = ĀQ
(4)
Since our model takes the sequence X 1 as input, H' inherently maintains the temporal order in the form of H' We utilize another MLP with the parameters WMIP and b to map H'rr back into reduced conformational space with the resulting dynamics and ground truth dynamics expressed as
X WLLPHH + +b;
I:T = Q X1.7.
(5)
To ensure the fidelity of the coarse grained dynamics towards the original high-dimensional system, we further introduce temporal consistency constraint, defined through a mean absolute error loss function with the form
C. =
X,
X pool
(6)
T
1=1
4

---

Published as a conference paper at ICLR 2025
Path signature transform. We now adopt the path signature method to characterize the interatomic temporal interactions among the coarse grained dynamics X1.r RTx3M, The basic idea of path signature is that, for a multidimensional continuous path, we can construct an ordered set consisting of all possible path integrals and combinations involving the path integrals among various individual dimensions as a comprehensive representation for this path (Lyons, 2014). Striving for a more precise definition, consider our coarse grained trajectory XI:T with XX, ..,,.,, ,x for t E (1..... T) let us define X [1, + R3M as a piecewise linear interpolation of X1:7 such that X, = X, for any
(1...., T.. and sub-time interval [ri, ri-1] corresponding to time partition of [1, 7) with = r1 < r2 < ..... < r, = T. The depth-1 signature transform of X over
the interval rt+1 is the vector defined as
( where for any (f....., 5a) E ..M...,.MM),.
Sig (X) 1, (1((5(X)mmm
1=1 E... {s(X
3M
3M Fiiri (imnnsee)
S(X) V
After that, we take the logarithm of the signature transform features presented in Eq. (7) eliminate redundant elements according to the shuffle product identity (Lyons et al., 2007) and acquire some minimal collection of the stream over time interval. Specifically, given the vector space described by depth-L) DD signature in formal power series form as
Sig 1141
Σ
Σ
S(X) 1,T
Me ej
Ejar
(9)
d=0
ji JaC 3M)
The depth-D sig-signature transform corresponds to taking the formal logarithm of Eq. (9), which can be expressed as
3M
LogSigh. D (x)
S(X) S Σ
Σ
5 (S()) 1im - -(()) ((x)))) Mens cml +...
+
13
(10)
where (e,,, em] is the Lie bracket (Reizenstein, 2017) defined by Jen em]] = C, Cm x en. Gen- erally, log-signature possesses a lower dimension compared to the original signature feature while carrying exactly the same information. Through this transform, the interatomic dynamic correla- tions in 3D space are embedded as geometric areas into features. The resulting signature sequence, denoted as (LogSigf: .rs (X), LogSig Bra.rs (X),... ), can be regarded as a discretization of dynamic data. In this work, we further utilize LSTM tackle the nonlinear interactions between them.
Classifier. Finally, we introduce a classifier f implemented as a two-layer MLP which outputs the predicted label ÿ = [(LogSigh (X)) for molecular property prediction. To establish the classifi- cation objective function, we leverage cross-entropy loss defined as follows
L. y (og (1 - y) log(1 - 9)
(11)
where y the ground truth label for the system and ğ is the predicted label generated by our model.
By combining the loss terms from Eqs. (3), (6) and (11), we arrive at the overall loss function for training our Deep Signature model as
L + d2L, + AzC..
(12)
Here, Å1. A and X are scaling parameters to balance the contributions of these three loss terms.
It is worth noting that, recent research has delved into the integration of path signatures with GNNs for spatial-temporal modeling, and marked significant strides in traffic forecasting scenarios (Choi & Park, 2023; Wang & Zang, 2024). These approaches utilize path signatures to process temporal information for each node individually differential equation at higher level to ensure the preservation of spatial topological consistency during dynamic forecasting. Nonetheless, they fall short in characterizing the temporal interactions among different nodes, making them unsuitable for molecular property prediction tasks where the interactions among dominant kinetic pathways play an essential role in protein function ( (Araki et al., 2021; Mustali et al., 2023).
low level, while employing GNNs empowered neural
5

---

Published as a conference paper at ICLR 2025
3.3 EQUIVARIANCE & INVARIANCE OF LOG-SIGNATURE
Physical properties often exhibit well-defined symmetry characteristics, and integrating such equiv- ariance into our learned feature space can enhance interpretability and mitigate learning difficulty. In the subsequent analysis, we rigorously examine the equivariance of our deep signature in relation to various geometric transformations including translation, rotation, and permutation on atomic coor- dinates, well as reparameterization over time. The complete proofs are provided in Appendix A.
Translation invariance. The coarse-grained dynamics acquired by a linear mapping in Eq. (5) demonstrate that X1:7 maintain equivariance with respect to translations input trajectory X1:7- Besides, since the path signature is composed of iterated integrals, inherits the property of trans- lation invariance. As result, log-signature features translation cunslation-nnvariant invariant for the input trajectory.
Rotation invariance. When a rotation is applicd to the 3D conformational space, an equivalent rota- tion exists in the coarse grained conformational space, indicating the equivariance of coarse grained dynamics X1:r to rotations of the input trajectory X1:r Furthermore, while research on rotation invariance of path signatures for higher depth and multi-dimensional paths is still limited (Diehl, 2013), we demonstrate that the majority of elements constituting our Deep Signature features are potation-invariant, particularly in large-scale systems like the molecular systems studied in this work.
Permutation equivariance. GCNs that aggregate contributions from neighboring atoms are invari- ant permutations of those atoms, which implies that our coarse- coarse-grained dynamics are equivariant to permutations of atom indices. Additionally, the multi-indices used to index the iterated integrals in a signature are sorted ascending order during implementation, ensuring that our signature features remain equivariant to permutations. This property is essential for facilitating the interpretability of our method, as it allows us to trace the dominant kinetic pathways that contribute to protein function.
Time-reparameetiizationn invariance. Path signature possesses a powerful property that it remains invariant under rearrareaaaatttiiaaiiioon of the underlying stream (Lyons, 2014). This property sub- stantially decreases the complexity of certain challenges by eliminating dependence on the sampling rate while preserving all other relevant information within the stream. Furthermore, it enhances the robustness of our method against deviations in molecular dynamics occurring over time scales.
3.4 IMPLEMENTATION
Architecture. Our introduced framework consists of three fundamental modules: a deep spectral clustering module, a path signature transform module and classi- fier. We adopt a hierarchical pooling ar- chitecture implement the deep spectral clustering module, which is schematically depicted in Fig. As shown, it contains a stack of L graph pooling layers with each layer consisting of GCN layer for obtain- ing node embeddings and an MLP layer for cluster assignment, such that it would gradually coarsen the dynamics from the atomic level. The last GCN layer and MLP take the node feature matrix and adjacency matrix processed by the I-tth graph pooling layer as input and output the final coarse grained dynamics XI.T-
pon
1-7
1:
X
GCN
ReLu
Suflnax
GC
Sothmax
X
MLF
Layer
A'
Layer I
Figure 2: The architecture of deep spectral clustering module.
The implementation of the path signature transform mod- ule illustrated Fig. 3. It takes X1:T as input, which is first partitioned into equally spaced intervals. The re- sulting segments are subsequently processed through the LogSig(-) function to extract log-signature features. This implemented based on signatory' a Python pack- age that facilitates differentiable computations of the sig- nature and log-signature transforms on both CPU and GPU. The resulting signature sequence is then fed into
X x
LogSigt
Layer Norm
X Xr./s.
LogSigt->
LogSig(.)
Figure 3: The architecture of path sig- nature transform module.
hhtpp:://gii http:///gtttubbcco thub. wwt.tttttt....oiiiio..eooaoooaee kidgr/ / signatory

---

Published as a conference paper at ICLR 2025
Comparisons of classifica- tion performance on gene regulatory dynamics. Results are averaged over 5 runs.
Table 1:
Method
Accuracy
Recall
Head
55.28 30.65
Tail
55.36+ 30.7 1171+10 +10.36
par diroee
Head & Tail
67.92115.17 35 8049.7
(a) Different timescales
(b) Different scales of system
GraphLSTM
96.4010.80
93. 14.12
Figure 4: The validation of scalability of our approach to- wards systems with various timescales (in a) and different number of atoms (in b).
GraphTrans
86.00+6.07
79.36+16.77
Deep Signature
19.1210.82 18.65
an LSTM layer to capture their interactions and followed by layer normalization (Ba et al., 2016) to standardize the feature values. For the classifier, we utilize a two-layer MLP together with a sig- moid activation function to enable property prediction. It is noteworthy that the overall architecture fully differentiable, thus we can leverage off-the-shelf optimization techniques to train our model in end-to-end fashion.
Cross validation and independent test. We employ a five-fold cross- cross- validation strategy for training model. In contrast to conventional random division, we take the temporal nature of the trajectory data into consideration for data partition. Specifically, each trajectory is divided into 5 groups with the same time interval according its temporal order. Subsequently, within each group into five folds. The validation set is constructed by selecting one fold from each group and is employed for model selection, while the remaining four folds within each group are gathered to form the training set. This process is repeated five times sequentially, resulting in the creation of the five-fold vooss-valiittion dataset. Moreover, for each running, we evaluate the prediction accuracy of our method on an independent unseen test set and report the averaged results.
further partition the data
4 EXPERIMENTS
In this section, we conduct experiments on representative molecular dynamic systems to evaluate the effectiveness of our proposed method. We begin with a synthetic dataset that reports gene regulatory dynamics (Gao et al., 2016). We then assess the performance on two large-scale MD simulation datasets, including epidermal growth factor receptor (EGFR) mutant dynamics (Zhu al.. 2021) and G protein-coupledt receptors (GPCR) dynamics (Rodriguez-Espiigare et al., 2020). More details on dataset construction can be found Appendix
4.1 EXPERIMENTS ON GENE REGULATORY DYNAMICS
For gene regulatory dynamies, generate 100 trajectories that describe the interactive dynamics between genes and transcription factors. These dynamics are categorized into degradation type or dimerization type, with equal number of trajectories for each type. The systems are simulated over a period of 2s and with time interval of 0.004s, resulting in 500 frames per trajectory. Be- sides, each system encompasses 100 nodes with randomly generated Power-law network structure to describe their relationships. We implement the deep spectral clustering module in our approach using two graph pooling layers that first coarsen the dynamics into 60 nodes and then into 30 nodes. The coefficients of loss terms are set as \ = 1, Ag 0.01, and A = 10. We optimize our model using Adam with an initial learning rate of 5e-4 and weight decay of le-4. For comparison, we consider several baseline approaches which aggregate nodes" dynamics by averaging without taking into account their interactions. These methods incorporate a deep spectral clustering model with an MLP to process the first frame only (Head), the last frame only (Tail), the first and last frame (Head & Tail), and all frames with an additional LSTM layer (GraphLSTM) or Transformer (GraphTrans) to aggregate nodes' temporal dynamics. The overall comparison results with baseline methods are presented in Table 1.
From the table, observe that our Deep Signature method achieves the best performance with clear margin over baseline approaches. Besides, compared to GraphLSTM which aggregates atomic dynamics by averaging them directly, our Deep Signature exhibits substantial performance boost
7

---

Published as a conference paper at ICLR 2025
Table Comparison of different methods for the classification results on the EGFR dynamics.
Ca--ihedral angle
Dihedral angle
Head & Tail
GraphLSTM
Graph Trans
Deep Signature
Method
Head
Tail
Accuracy
27.47 2.40
63.73aa.44
61.47a9.3
59.73am111
19.47
64,93
64 24..0
69.33x478
Recall
1.20
2.40
2.80
6.00
11.60
20.80
21.27
Ca-dihedral angle
Head
Deep Signature
Table 3: Ablation study on different loss items for Deep Signature. We report accuracy and recall for perfor- mance evaluation.
Cu
Ce
Le
Accuracy
Recall
x
67.60=0.02
19.60
V
67. =1.1
17.60a44s
Figure 5: Visualization of the extracted features via t- SNE. Positive samples are presented in red circles and negative samples are in blue triangles.
v
X
23. a..
/
V
21.27
by incorporating the log-signature transform into method design, demonstrating the importance of capturing interatomic interaction dynamics for property prediction. Moreover, we validate the scalability of our approach dynamical system across various time scales and different system sizes, As shown in Fig. 4(a), when extending the time duration of dynamics from 1s to 5s, our Deep Signature consistently obtains the best performance across these settings. Furthermore, when we change the system size via increasing the number of nodes that would enhance the complexity of dynamics, the results in Fig. 4(b) show that our method can still perform well under these conditions. These results showcase the good scalability of our method for dealing with dynamical systems of different timescales and sizes. In contrast, while GraphL.STM yields competitive results for systems with fewer than 250 nodes, notable performance degradation appears the number of nodes keeps increasing. We conjecture that this is because the averaged dynamics become less representative of the global dynamics the system scale grows.
4.2 EXPERIMENTS ON EPIDERMAL GROWTH FACTOR RECEPTOR MUTATION DYNAMICS
In this study, we investigate the binding process between EGFR mutations and EGFR-receptor ty- rosine kinases (RTK) during which their interactions can contribute to drug resistance mechanisms. The combinations between four RTK partners and five mutation types together with wild type as reference are considered. To acquire the dynamic data, we follow the pipeline presented in (Zhu et al., 2021) that each system first undergoes energy minimization prior to simulation, then it is heated for 100 ps, followed by density equilibration for 100 ps and constant pressure equilibration for 5 ns, and finally runs simulation the equilibrated structures for 50 ns. This results in 24 tra- jectories, each comprising 1,000 frames describing the temporal interactions among approximately 5,000 atoms. Each trajectory is labeled according its sensitivity towards the drug. Here, our deep spectral clustering model consists of three layers that progressively coarsen the dynamics into 400, 200, 50 nodes. We set the scaling parameters as λ₁ 1, A2 0.01, and A 10. The model is trained for 200 epochs with an initial learning rate 5e-5 and a weight decay of le-5, In addition to the deep learning-bases baselines introduced above, we further consider two baselines that extract dihedral angles as geometrical descriptors, followed by PCA to reduce the dimension of features and SVM for classification. The overall comparison results are summarized in Table 2.
As can be seen, our Deep Signature method consistently obtains the best classification results on EGFR dynamics, achieving an accuracy of 69.33% and recall of 21. 21.27% This validates the prac- tical applicability of our method for its capability to tackle complex dynamics inherent in large-scale molecular systems. In addition, contrast to baseline methods that achieve high accuracy but low recall which often due to their reliance on bypasses caused by the varying sample sizes for differ- ent classes, our method demonstrates a substantial improvement in recall, indicating its robustness under class imbalance issues. Furthermore, when compared to conventional geometrical descrip- tor methods, deep learning-bass based approaches, with the exception of ours, tend to underperform on this dataset. This discrepancy be attributed to the intricate non-linearity and atomic fluctuations
8

---

Published as a conference paper at ICLR 2025
M4p
Origital Synenics
Cursa grained dytamas
200
300
3300
(b) Figure 6: The effect of the deep spectral clustering module for C797S and G719S mutated EGFR dimers. (a) are origianl 3D conformations, (b) are coarse grained graphs, (c) are the RMSD curves of raw trajectories and coarse grained trajectories.
(a)
(c)
characteristic of EGFR dynamics, which pose significant challenges for deep learning techniques to extract meaningful patterns from a limited amount data.
Ablation study. We conduct an ablation study to assess the necessity of each loss term used in our model, with the results for EGFR dynamics presented in Table 3. We begin by training our Deep Signature model using only the classification loss Le, which yields accuracy of 67.60%. Upon in- corporating the temporal consistency loss L, the accuracy increases to 67. 67.97% However, when we replace L, with the spectral clustering loss Lu. performance slightly degrades 66.00%. This de- crease may be attributed to the tendency of L, to guide the spectral clustering module towards hard assignments, thereby impairing the representation ability of the coarse grained dynamics. Training with all three loss terms produces the best results, demonstrating the validity of our method design.
Analysis on deep spectral clustering module. To understand the impact of our spectral clustering module on the graph structures and trajectories for EGFR dynamics, we investigate two cases: drug-resistant C797S mutant and drug- drrus-snsstive G719S mutant respectively dimerized with EGFR partners, with their results visualized in Fig. 6. By comparing (a) and (b), we observe that coarse grained graphs produced by our module can maintain the overall structure of original conformations, and the nodes mainly distribute in the middle region, which is valid since interatomic interactions that facilitate protein function commonly occur in this area. Besides, as shown (C), the root mean square deviation (RMSD) curves for both the raw and coarse grained trajectories generally follow the same trend, indicating a high fidelity of the coarse grained dynamics to the original dynamics.
Analysis path signature transform module. We visualize the feature space via t-SNE to explore the discriminability learned features after path signature transform. The results of all data samples with colors indicating their classes are presented in Fig. 5. As seen, both the non-learnable features, which compute dihedral angles for all Co atoms, and the learned features derived solely from the first frame tend to gather tightly in feature space, making it difficult establish decision boundary to distinguish samples belonging to different classes. In contrast, features extracted via our Deep Signature method are more uniformly distributed, and we can find such a decision boundary easily, verifying the good discriminability of these features. We further use green circles to indicate training samples and orange dashed circles to denote test samples in Fig. These two eircles typically exhibit limited overlap due to distribution shift between the training and test samples, which arises from heterogeneity in the number of atoms and molecular topological structures. Nevertheless, Deep Signature exhibits an ability to learn generalizable features for unscen samples. This is because learning features that respect symmetry enhances generalization capability (Schütt et al., 2017b), and incorporating layer normalization helps mitigate the distribution discrepancy (Ba et al., 2016).
Analysis on interpretability. Our approach also exhibits notable interpretability for its ability to identify every possible type of interaction among atoms that essential for protein functioning. This capability stems from the deep spectral clustering module which only involves linear mapping for cluster assignment, and log-signature features that maintain permutation equivariance as dis-

---

Published as a conference paper at ICLR 2025
t-10
t-30
Figure 7: The visualization of critical pathways and interatomic interactions that contribute to drug sensitiveness on the EGFR dynamics.
Table Comparison of different methods for the classification results on the GPCR dynamics.
Cor-dihedral angle
Dihedral angle
Head & Tail
GraphL
GraphTrans
Deep Signuture
Method
Head
Tail
Accuracy 52.67
44.00s112
53.07a647
47. a7.20
47.20
53.47
44.80
58.00
Recall 31.73am 35.47
26.40staa
37.60 37.60
38.13
33.33amus
43.30
cussed in Section 3.3. In practice, apply the Gradient @ Input method (Shrikumar et al., 2017) quantify the contribution of each element log-signature feature to the final prediction output and then identify three key atoms whose interactive dynamics play a pivotal role in the progres- sion of EGFR. The identified atoms, along with their interatomic distances, are illustrated in Fig. 7. Notably, these identified atoms fall within the hinge region that comprises all ATP binding sites, demonstrating strong consistency with the experimental observation (Kaufman et al., 2021).
4.3 EXPERIMENTS ON G PROTEIN-COUPLE RECEPTORS DYNAMICS
The GPCR superfamily is major therapeutic target its functioning regulates nearly every physi- ological process in the human body. To create a dataset for its analysis, we select 26 structures with their MD simulations from the Molecular Dynamics Database for GPCRs (GPCRmd) (Rodríguez- Espigares et al., 2020), including 13 active state structures and 13 inactive state structures. The task to identify these distinct active states. Each simulation is conducted for 500 ns with a time interval of 200 ps, therefore each trajectory consists of 2,500 frames that describe the conforma- tional dynamics. Here, we only consider atoms backbones. Experimental results are provided in Table 4.
is evident that Deep Signature achieves the highest performance on the GPCR dynamics, with an accuracy of 58.00% and recall ratio of 43.30%. The results significantly better than the com- pared baselines. Traditional geometrical descriptor methods, such as the dihedral angles and Ca- dihedral angles, exhibit relatively lower classification accuracy and recall compared our method. This again verifies that geometrical descriptors are inadequate for capturing dynamic patterns when the dynamics are highly nonlinear due to the existence of atomic fluctuations GPCR dynamics. Moreover, relying solely on the first or last frame fails to account for the dynamic nature of interac- tions, thereby limiting the ability discern useful patterns for predicting structural states. Although the GraphLSTM method outperforms the geometric descriptor methods, achieving a moderate ac- curacy of 53.47% and recall ratio of 13%, it still falls short of the superior classification capa- bilities exhibited by the Deep Signature method, demonstrating the effectiveness of our approach in characterizing the complex dynamics of GPCR systems.
CONCLUSION
In this paper, we introduce a novel deep learning framework, Deep Signature, to deal with the long- standing challenge of understanding protein dynamics in large-scale biological systems. It com- prises soft spectral clustering to aggregate cooperative dynamics and log-signature transformation to characterize global interactive dynamics. Theoretically, our method exhibits desirable properties such as invariance to translation, near-invariance to rotation, and equivariance to atomic coordinate permutation. Experimental results three biological process benchmarks verify the effectiveness of Deep Signature in capturing the complex interactive dynamics of large-scale molecular systems. We hope work can offer a promising new direction for the analysis of protein dynamics.
10

---

Published as a conference paper at ICLR 2025
ACKNOWLEDGMENTS
This work was supported in part by the Hong Kong Innovation and Technology Commission (ITC) (InnoHK Project CIMDA), in part by the Institute of Digital Medicine of City University of Hong Kong (Project 9229503). in part by the Hong Kong Research Grants Council under Projects 21200522, 11200323 and 12002220, in part by Chow Sang Sang Donation and Matching Fund (Project 9229161), and in part by the Hong Kong Innovation and Technology Commission (Project GHPP044/21SZ).
REFERENCES
Mitsugu Araki, Shigeyuki Matsumoto, Gert-Jan Bekker, Yuta Isaka, Yukari Sagae, Narutoshi Kamiya, and Yasushi Okuno. Exploring ligand binding pathways on proteins using hypersound- accelerated molecular dynamics. Nature communications, 12(1):2793, 2021.
Jimmy Lei Ba, Jamie Ryan Kiros, and Geoffrey E. Hinton. Layer normalization, 2016. URL
https: pettps://arxxxe http://aavvvv.a///ee/eeeeeeeeela orgo abs///////1// 0007006400.
llyes Batatia, David P Kovacs, Gregor Simm, Christoph Ortner, and Gábor Csányi. Mace: Higher order equivariant message passing neural networks for fast and accurate force fields. Advances in Neural Information Processing Systems, 35: 14:31123-1, 2022.
Simon Batzner, Albert Musaelian, Lixin Sun, Mario Geiger, Jonathan P Mailoa, Mordechai Ko- rnbluth, Nicola Molinari, Tess Smidt, and Boris Kozinsky. E (3)eqqivariant graph neural networks for data-efficient and accurate interatomic potentials. Nature communications, 13(1): 2453, 2022.
Filippo Maria Bianchi, Daniele Grattarola, and Cesare Alippi. Spectral clustering with graph neural networks for graph pooling. In International conference on machine learning, pp. 874-883. PMLR, 2020.
Richard Car and Mark Parrinello. Unified approach for molecular dynamics and density-functional theory. Physical review letters, 55(22):2471, 1985.
Jeongwhan Choi and Noseong Park. Graph neural rough differential equations for traffic forecasting. ACM Transactions on Intelligent Systems and Technology, 14(4):1-21 2023.
Joscha Dichl. Rotation invariants of two dimensional curves based on iterated integrals. arXiv preprint drXiv:1305.6883 2013.
Ron O Dror, Robert M Dirks, JP Grossman, Huafeng Xu, and David E Shaw. Biomolecular sim- ulation: computational microscope for molecular biology. Annual review of biophysics, 41: 429 452, 2012.
Katsuhiro Endo, Daisuke Yuhara, Katsufumi Tomobe, and Kenji Yasuoka. Detection of molecular behavior that characterizes systems using a deep learning approach. Nanoscale, 11(20):00064 10071, 2019.
Daan Frenkel and Berend Smit. Understanding molecular simulation: from algorithms to applica- tions. Elsevier, 2023.
Pablo Gainza, Freyr Sverrisson, Frederico Monti, Emanuele Rodola, Davide Boscaini, Michael M Bronstein, and Bruno E Correia. Deciphering interaction fingerprints from protein molecular surfaces using geometric deep learning. Nature Methods, 17(2):844-199 2020a.
Pablo Gainza, Freyr Sverrisson, Frederico Monti, Emanuele Rodola. Davide Boscaini. Michael M Bronstein, and Bruno Correia. Deciphering interaction fingerprints from protein molecular surfaces using geometric deep learning. Nature Methods, 1842)184-112, 2020b.
Jianxi Gao, Baruch Barzel, and Alszzt-László Barabási. Universal resilience patterns in complex networks. Nature, 337-7299 2016.
11

---

Published as a conference paper at ICLR 2025
Kaifu Gao, Due Duy Nguyen, Vishnu Sresht, Alan M Mathiowetz, Meihua Tu, and Guo-Wor Wei. Are 2d fingerprints still valuable for drug discovery? Physical chemistry chemical physics, 22 (16):8373-839)) 2020.
Helgi I Ingólfsson, Cesar Lopez, Jaakko Uusitalo, Djurre H de Jong. Srinivasa M Gopal, Xavier Periole, and Siewert J Marrink. The power of coarse graining in biomolecular simulations. Wiley Interdisciplinary Reviews: Computational Molecular Science, 4()):225-22 248, 2014.
Jaehyeok Jin, Alexander Pak, Aleksander EP Durumeric, Timothy D Loose, and Gregory A Voth. Bottom-up coarse-graining: Principles and perspectives. Journal of Chemical Theory and Com- putation, 18(10):5759-579) 2022.
Nichole EM Kaufman, Simran Dhingra, Seetharama D Jois, and Maria da Graca H Vicente. Molec- ular targeting of epidermal growth factor receptor (egfr) and vascular endothelial growth factor receptor (vegfr). Molecules, 26(4):1076, 2021.
Aditi Khot, Stephen Shiring, and Brett M Savoie. Evidence of information limitations in coarse- grained models. The Journal of chemical physics, 151(24), 2019.
Patrick Kidger and Terry Lyons. Signatory: differentiable computations of the signature and logsig- nature transforms, on both {cpu} and {gpu). In International Conference on Learning Represen- tations, 2021. URL https: http///pppneeeeeeeeeeee/eeeee.ep netie/ewweeeeeeeeeeeeeeeeeeeeeee ftorfformmmoo wiwpmmmmddddlldiddaeememmmmm
Anthony Law, Paul Sapienza, Jun Zhang, Xiaobing Zuo, and Chad M Petit. Native state volume fluctuations in proteins as a mechanism for dynamic allostery. Journal of the American Chemical Society, 139(10)3399-3602, 2017.
Józef R Lewandowski, Meghan E Halse, Martin Blackledge, and Lyndon Emsley. Direct observation of hierarchical protein dynamics. Science, 348(6234):578 10188855811111 2015.
Bian Li, Yucheng Yang, John A Capra, and Mark B Gerstein. Predicting changes in protein thermodynamic stability upon point mutation with deep 3d convolutional neural networks. PLoS computational biology, 16(1 (6(11):e10082) 2020a.
Chuan Li, Jiangting Liu, Jianfang Chen, Yuan Yuan, Jin Yu, Qiaolin Gou, Yanzhi Guo, and Xuemei Pu. An interpretable convolutional neural network framework for analyzing molecular dynam- ics trajectories: A case study on functional states for g-protein-coupled receptors. Journal of Chemical Information and Modeling, 1296)1199-1 2022.
Zhiheng Li, Geemi P Wellawatte, Maghesree Chakraborty, Heta A Gandhi, Chenliang Xu, and Andrew D White. Graph neural network based coarse-grained mapping prediction. Chemical science, 1 11(35):5524999) 9531, 2020b.
Zoe Li, Ruili Huang, Menghang Xia, Tucker A Patterson, and Huixiao Hong. Fingerprinting interactions between proteins and ligands for facilitating machine learning in drug discovery. Biomolecules, 14(1):72, 2024.
Terry Lyons. Rough paths, signatures and the modelling of functions on streams. International Congress of Mathematicians-Seene IV, 2014.
Terry J Lyons, Michael Caruana, and Thierry Lévy. Differential equations driven by rough paths.
Springer, 2007.
Maciej Majewski, Adrià Pérez, Philipp Thölke, Stefan Doerr, Nicholas E Charron, Toni Giorgino, Brooke E Husic, Cecilia Clementi, Frank Noć, and Gianni De Fabritis. Machine learning coarse- grained potentials of protein thermodynamics. Nature Communications, 14(1):5739, 2023.
Siewert J Marrink and D Peter Tieleman. Perspective on the martini model. Chemical Society
Reviews,
2013.
Jessica Mustali, Ikki Yasuda, Yoshinori Hirano, Kenji Yasuoka, Alfonso Gautieri, and Noriyoshi Arai. Unsupervised deep learning for molecular dynamics simulations: a novel analysis of pigdein-ligand interactions in sars-cov-2 m pro. RSC advances, 344499-3244994 2023.
12

---

Published as a conference paper at ICLR 2025
Renee Otten, Lin Liu, Lillian R Kenner, Michael W Clarkson, David Mavor, Dan S Tawfik, Dorothee Kern, and James S Fraser. Rescue of conformational dynamics in enzyme catalysis by directed evolution. Nature communications, 911:1311, 2018.
Yunrui Qiu, Michael S O'Connor, Mingyi Xue, Bojun Liu, and Xuhui Huang. An efficient path classification algorithm based on variational autoencoder to identify metastable path channels for complex conformational changes. Journal of Chemical Theory and Computation, 19(14)4728-- 4742, 2023.
Jeremy Reizenstein. Calculation of iterated-integee signatures and log signatures. arXiv preprint arXiv:1712.02757, 2017.
Ismael Bodríguez-Essiggane Mariona Torrens-Fontanals, Johanna KS Tiemann, David Aranda- Garefa, Juan Manuel Ramirez-Anguita, Tomasz Maciej Stepniewski, Nathalie Worp, Alejandro Varela-Rial, Adrián Morales-Pastor, Brian Medel-Lacruz, et al. Gpermd uncovers the dynamics of the 3d-gprrome. Nature Methods, 1778):777-777, 2020.
Julia R Rogers, Gergö Nikolényi, and Mohammed AlQuraishi. Growing ecosystem of deep learning methods for modeling protein-protein interactions. Protein Engineering, Design and Selection, 36:gzad023, 2023.
Kristof Schütt, Pieter-Jan Kindermans, Huziel Enoc Sauceda Felix, Stefan Chmiela, Alexandre Tkatchenko, and Klaus-Robert Müller. Schnet: continuous-file convolutional neural net- work for modeling quantum interactions. Advances in neural information processing systems, 30, 2017a.
Kristof T Schütt, Farhad Arbabzadah, Stefan Chmiela, Klaus R Müller, and Alexandre Tkatchenko. Quantum-chemical insights from deep tensor neural networks. Nature communications, 8(1): 13890, 2017b.
Avanti Shrikumar, Peyton Greenside, and Anshul Kundaje. Learning important features through propagating activation differences. In International conference on machine learning, pp. 3145- 3153. PMIR, 2017.
Daiwen Sun, He Huang, Yao Li, Xinqi Gong, and Qiwei Ye. Dsr: Dynamical surface representation as implicit neural networks for protein. In Advances in Neural Information Processing Systems, volume 36, pp. 13873-13886, 2023.
Stephan Thaler, Maximilian Stupp, and Julija Zavadlav. Deep coarse goaanne potentials via relative entropy minimization. The Journal of Chemical Physics, 157(24), 2022.
Erdal Toprak, Adrian Veres, Jean- Baptiste Michel, Remy Chait, Daniel I. Hartl, and Roy Kishony. Evolutionary paths to antibiotic resistance under dynamically sustained drug selection. Nature genetics, 14(1):101-105, 2012.
Chung-Jung Tsai, Antonio Del Sol, and Ruth Nussinov. Protein allostery, signal transmission and dynamics: a classification scheme of allosteric mechanisms. Molecular Biosystems, 5(3):207- 216. 2009.
Wujie Wang and Rafael Gomezz-Bomaarllli Coarse-graining auto-encoders for molecular dynam- ics. npj Computational Materials, 5(1):125, 2019.
Zengqiang Wang and Di Zang. Multi-frequency graph neural rough differential equations for traffic forecasting. 2024.
Michael A Webb, Jean- Delannoy, and Juan De Pablo. Graph-based approach to systematic molecular coarse graining Journal of chemical theory and computation, 15(2): 19981208, 2018.
Ikki Yasuda, Katsuhiro Endo, Fiji Yamamoto, Yoshinori Hirano, and Kenji Yasuoka. Differences in ligand-induced protein dynamics extracted from an unsupervised deep learning approach correlate with protein-ligand binding affinities. Communications biology, 5(1):481, 2022.
Mengxu Zhu, Debby D Wang, and Hong Yan. Genotype-determined egfr-rtk heterodimerization and its effects on drug resistance in lung cancer treatment revealed by molecular dynamics simu- lations. BMC Molecular and Cell Biology, 22(1):34, 2021.
13

---

Published as a conference paper at ICLR 2025
Table of Contents
Appendix A: Proof for Properties
Appendix B: Experimental Settings
Appendix C: Further Results and Analysis
A PROOF FOR PROPERTIES
In the beginning of our proof, we would first decompose our feature extracting process into two operations 9GNN (-) and LogSig()) as presented in Section 3.2 such that the overall feature transform is their composition JGNN LogSig. This decomposition offers us the opportunity to analyze the properties of component separately. Besides, since the logarithm map is bijective, which implies there is one-to-one correspondence between the signature and the log- signature (Lyons al., 2007), thus we can turn to analyze signature transform for intuitive demonstration.
A.1 TRANSLATION INVARIANCE
Given trajectory data XI. E RxxNX33 let TA represent a translation matrix B E N on the trajectory data such that at certain time stamp t have TB TB(X,) X, + B. For the coarse grained dynamies acquired by Xpool Q" X, as presented by Eq. (5), as Q" is a linear matrix, we can get that Q (X,, Q" X, Q TQ ( thus X1-r maintain equivariance with respect to translation TB input trajectory X Besides, as presented in Eq. (8) that the path signature composed of iterated path integrals, inherits the properties of translation invariance that Sigo, (X c) = Sig,,(Xi In the whole, our path signature features Sig (X) are translation- invariant with respect to input trajectory data X.,
A.2 ROTATION INVARIANCE
Given the coarse grained dynamics acquired by = where X, E IR Nx3 and X, E R Mx3 The cluster assignment matrix Q E RRx holds that Q = 1x and Q Q orthogonal matrix Ra 3x3 performed on X, termed as R₂X, = (R,X) ..... R, N below that rotating the input results in an equivalent rotation of the output R
M.. For any we proof
Q²RRa,,, where Rs Mxx an orthogonal matrix performed on X,. Let we start with the right-hand side Ro,,, Here, Q" has the form Q (Q/ ...., Q,y), where the assignment function for m-th cluster is Q E RN,, m E {l, fI,..., M). and the corresponding aggregated coordinate is Qrx,, which is a linear combination in each dimension. Due to the fact that Q R X, can always be represented by R Q X., conformational space, there always exists an equivalent rotation transformation R. in coarse grained conformational space. We then accomplish our proof that R,X, Q" Rx,,,
X,, which implies that for a rotation transform Rg on the original
After that, we turn to analyze the effect of rotation on features acquired by signature transform. Unfortunately, not all elements of path signature feature exhibit rotation invariance. As demon- strated by Dichl (2013), rotation invariants only exist on levels of even order. For a 2-dimensional continuous path X (a, b] IR. as presented in Fig. 8, the depth-1 terms corresponding to the variations for each channel over the interval are represented by AX, and AX2, while the depth-2 term corresponding
the signed area between the chord connecting the endpoints and the real path denoted as A. The calculation of depth-2 term corresponds to the coefficient the polynomial [en, cm] in Eq. (10)
A - A_ = 2 (
Here, the sign of area exactly indicates the orientation of acceleration, while an increase in the absolute value surrounding accelerations would increase the proportion of the represented area accordingly. Obliviously, the area A is rotation invariant, while AX,, AX, do not hold this property. As suggested by Diehl (2013), a depth-2 term in Eq. (10) is rotation invariant only it involves the iterated integrals over different channels. Although further investigation into rotation invariants
14

---

Published as a conference paper at ICLR 2025
X2
Log signature
4X
Depth I
AX2
A+ A_
A_
A
Depth
Ax2
AX
Higher Depth
X
Figure 8: Geometric intuition for the first two levels of the log-signature on a 2-dimensional path. We can observe that the depth-1 terms represent the change in each of the coordinates over the interval, and the depth-2 term corresponds to the Lévy area the path, shown as the signed area enclosed by the curve and the chord connecting its start and endpoints.
for path signature with higher depth over beyond two dimensional paths is still lacking, current conclusion on rotation invariance acquired for depth-2 log- sig-stgneu can readily extend to higher dimensional paths.
In experimental setup, given the coarse grained dynamics Xa, RTx3M the dimension of depth-D D log-signature is
dim(LogSig (X))
Σ
d
(3M)*,
i|d
where y is the Möbius function defined as
0
n has one or more repeated prime factors
m(m)
1
if n. =
(-1)*
if ni is the product of k distinct prime numbers
When we specify d = 2, the ratio of rotation-invariant elements over the whole log-signature feature can then be calculated as
3M 7
3.M +
which indicates the majority of features are rotation-invariant for large-scale molecular system as we focus on in this paper.
A.3 PERMUTATION EQUIVARIANCE
For the deep clustering module implemented by GNNs JGNN (-) with the formula presented in Eq, (1) as follows
H' = (D -
GNN)
For one layer, the calculation of node embeddings per node involves sum over contributions from different atoms. As result, node embedding matrix H' naturally exhibit equivariance with respect to the permutation symmetries of graphs. In addition, the linear mapping shown in Eq. (5) only works for dimension alignment, making influence the permutation equivariance. So the coarse grained dynamics X is permutation equivariant with respect to input set of atoms.
We then delve into log-signature transform by examining Eq. (10). Notably, the monomials such Cn and [en, cm] constitute the basis vectors of the vector space, and their coefficients caleu- lated using iterate integrals over paths indexed by these monomials. Ideally speaking, signatrue features hold permutation invariance since can arbitrarily select and order the monomials. Such phenomenon becomes even clearer when we revisit the signature transform in Eq. (7). In the sig- nature transform, the superscripts indicating the paths traverse the set of all multi-indexes denoted as
W (Ü..... ... .a......aaadd 2 1, .......... .. (1....,33 [L....,MM),,
Hence, the order of the multi-indexes. has no impact on the captured dynamic information. prac- tical implementations, organize the multi-indexes in ascending order to collect these iterated
15

---

Published as a conference paper at ICLR 2025
integral terms (Kidger & Lyons, 2021). Consequently, permutation the indices of input atoms would yield a predictable permutation transform on the indices of log-signature terms. As a re- sult, drive the conclusion that our Deep signature method exhibits permutation equivariance with respect to input atom indices.
A.4 TIME-EEARRAEETIIAAII INVARIANCE
Since coarse graining will maintain temporal consistency, we only need to analyze the invariance under time-reparametrization for coarse grained dynamics. A reparametrization of coarse grained pathway X [a, b] RaM is path X [a, RaM where X; X where & is a subjective, continuous, non-decreasing function v |a, bj - [a, 6j. We have the following theorem
Theorem Let X, be reparametrization of X, then we have Sig(X) Sig(X).
Consider two real-valued paths X,Y: [a, bj - R and surjective, continuous, non-decreasing reparametrization function time [a, [a, Then have reparametrized paths X, Y [a, b] I2 by Xx Xv. and Y You
J. VidX = I," Yo, Yx =
L, Yu, Nor = Xx,
After replacing 4/2. have I Yidx, S² YudX which means path integrals invariant under time reparametrization of both paths.
Since every term of the signature S(X) (()aaam is defined as an iterated path integral of X, it follows from the above that
S(X)ar S(X)
abb Ji
4k: 2 O, ii...., , (I.....33 3M}
This complements the proof.
B EXPERIMENTAL SETTINGS
B.1 GENE REGULATORY DYNAMICS
The dynamics for gene regulatory networks are governed by Michaelis- equation as follows,
dæ, = (b
x (v,)
(15)
(13)
dt
x (0(0))+
where the first term models the degradation when f = 1 or dimerization when f= 2, and the second term represents genetic activation, with the Hill coefficient h determining the level of cooperation in the regulation of the gene.
Data generation. For the gene regulatory dynamics, we curate dataset consisting of 100 trajecto- ries that delineate the intricate interactive dynamics between genes and transcription factors. These trajectories divided into two distinct categories: degradation type (f 1) and dimerization type (f 2), each encompassing an equal number of trajectories. To commence simulation, we first initialize graph network featuring 100 nodes using Power-law network generator elucidate the structural interconnections between these nodes. Subsequently, we employ the Dormand-Prines method numerically solve the gene regulatory system described by Eq. (13), with a simulation duration of 2 seconds and time interval of 0.004 seconds. This computation simulation yiclds trajectories comprising 500 frames each, laying the foundation for our subsequent experiments.
Model architecture. We implement the deep spectral clustering module in our approach using two graph pooling layers, which first coarsen the dynamics into 60 nodes and subsequently into 30 nodes. The dimension of hidden states for the stacked GCN layers is kept 10. For tiny implementation, we simply extract the log-signature features for the coarse grained dynamics and then employ a two-layer ML.P for property prediction.
16

---

Published as a conference paper at ICLR 2025
Training details. We train model with the initial learning rate of 5e-4 and a weight decay lc-4. The coefficients loss terms are set as A = L, A2 0.01, and X3 10.
of size 48 for 100 epochs using Adam with
B.2 EPIDERMAL GROWTH FACTOR RECEPTOR MUTATION DYNAMICS
Data generation. In this investigation, we delve into the intricate binding dynamics between EGFR mutations and RTK, exploring how their interactions can trigger mechanisms of drug resistance. The study encompasses the amalgamation of four RTK partners and five distinct mutation types, alongside the wild type serving as a reference point. To capture the dynamic essence of these in- teractions, we adhere to the methodological framework outlined in (Zhu et al., 2021), wherein each system undergoes a meticulous pre-simulation process. This involves an initial energy minimiza- tion phase, followed by 100 picosecond heating stage, subsequent density equilibration spanning 100 picoseconds, and a further 5 nanoseconds of constant pressure equilibration. The equilibrated structures then undergo simulation period of 50 nanoseconds, resulting in the generation of 24 trajectories. Each trajectory comprises 1000 frames, detailing the temporal interplay among ap- proximately 5,000 atoms. Notably, these trajectories are categorized based their sensitivity or resistance to the administered drug. For the MD simulations, we leverage the explicit-solvent model integrated within the Amber software suite, utilizing the FJ99SB and gaff force fields drive the simulations.
Model architecture. For the deep spectral clustering module, we utilize three graph pooling layers that progressively coarsen the dynamics into 400, 200, 50 nodes. The dimension of hidden states for the stacked GCN layers kept as 20. For the path signature transform module, we partition the input coarse grained dynamics into four segments for the subsequent application of the bog-signature transform.
Training details. The model is trained with bini-batches of size 16 for total of 200 epochs. We employ the Adam optimizer with an initial learning rate of 5e-5 and weight decay 1e-5 to optimize the model parameters. Additionally, the scaling parameters are specified as \ 1, A2 0.01, and A3- = 10.
B.3 G CROPEED RECEPTORS DYNAMICS
Data generation. We download our data from the GPCRmd (http://gpermd.orgg) (Rodríguez- Espigares et al., 2020) database, which is an online platform that incorporates web-based visual- ization capabilities and shares data. This database includes least representative structure from each of the four structurally characterized GPCR classes, and holds more than 600 GPCR MD sim- ulations from GPCRmd community and individual contributions. To create our dataset, we select 26 trajectories of the 32AR-rh1 GPCR inactive (2RHI) and active (3POG) receptor state with full agonist. The receptor consists of 282 and 285 amino acids for inactive and active state respectively. Each simulation is conducted for 500 ns with a time interval of 200 ps, therefore every trajectory consists of 2,500 frames that describe the atomic 3D positions over time.
Model architecture. We implement the deep spectral clustering module in our approach using two graph pooling layers, which first coarsen the dynamics into 100 nodes and subsequently into 50 nodes. The dimension of hidden states for the stacked GCN layers is kept 20. In the path signature transform module, the input coarse grained dynamics are partitioned into four segments to facilitate the subsequent application of the log- signature transform.
Training details. The model is trained with bini-bacches size 16 for a total of 200 epochs. We employ the Adam optimizer with an initial learning rate of 5e-5 and weight decay le-5 to optimize
the model parameters. Furthermore, the scaling parameters are specified as X = 1, X2 = 0.01, and Aa 10.
17

---

Published as a conference paper at ICLR 2025
C FURTHER RESULTS AND ANALYSIS
C.I PARAMETER SENSITIVITY ANALYSIS
The sensitivity of coarsening level. To further validate the robustness of our method for different coarsening levels, we conducted additional experiments by varying the coarsening levels for the EGFR and GPCR datasets. The results are summarized in Table 5.
Table 5: Comparison of EGFR and GPCR Accuracy at Different Coarsening Levels
Coarsening Level
100
50
30
5
EGFR Accuracy (%)
66.93
69.33+4.78 78
66.40.5.06
63.20
57.33 55.07
GPCR Accuracy (%)
50.67
18.00
58.00
57.73=8.02
From these results, observe that coarsening levels of 30 and 50 beads yield the best accuracy for both datasets, demonstrating the robustness of our method across different levels of coarsening. While extreme levels, such 100 beads, result reduced performance, the method is flexible and performs consistently well within broad range of coarsening levels.
The value of X1, À2 and Ag. In the objective of Deep Signature presented in Eq. (12), there exist three
Å1 A2 and Às reweighting the loss terms. We now conduct the parameter sensitivity test by varying their value in (10.0, 1.0, 0.1,0.013. The results are summarized in Table 6, 7 and 8, respectively.
Table 6: Sensitivity analysis for X and its effect accuracy.
A1
10.0
1.0
0.1
0.01
Accuracy (%)
59.60
69.33-4.7
67.87 +1.95
67.33+2.77
Table 7: Sensitivity analysis for 22 and its effect on accuracy.
A
10.0
1.0
0.1
0.01
Accuracy (%))
65.27=248
67.67-1.6
67. 17.80
69.33
Table 8: Sensitivity analysis for A3 and effect on accuracy.
A Accuracy (%)
10.0
1.0
0.1
0.01
17.33
66.53_265
62.00
58.93.1.1
As shown, our model is generally robust to moderate variations in the hyperparameters. For instance, A 1.0, X 0.01, and A3 10.0 consistently deliver strong performance. However, extreme values for these parameters (e.g.. À = 0.01 or X = 10.0) can lead to noticeable drop in accuracy, highlighting the importance choosing balanced values.
18


Reviews:
[{"review_id": "aBsVAopGA0", "reviewer": "Reviewer_diJk", "summary": "The paper introduces Deep Signature, a framework for characterizing dynamics on graphs. Deep Signature involves three key components: (1) graph coarsening using a deep spectral clustering module, (2) computation of path signatures to capture global inter-node interactions using iterated integrals over time, and (3) a two-layer MLP for property prediction.\nThe authors tested Deep Signature on three datasets: (1) gene expression dynamics, classifying into degradation or dimerization types, (2) GPCR dynamics, distinguishing between active and inactive states, and (3) EGFR mutant dynamics, predicting drug sensitivity. They conducted an ablation study validating the contribution of each loss component in the model and performed limited comparisons with methods based on static structures, dihedral angles, and GraphLSTM.", "questions": "1. Existing equivariant neural networks with geometric inductive biases have been outperformed, both in terms of performance and efficiency, by Transformer-style architectures (ie, something as simple as torch.nn.TransformerEncoder). Was any ablation done that compares Deep Signature with such architectures that \"tokenize\" the trajectory intervals?   \n\n2. I'm curious what the learned coarse-grained beads/maps look like for GPCR proteins – is it creating CG beads only based on atoms within a locality? How does this compare to naively taking atoms within some radial ball and considering them a bead? More often than not, these naive CG choices work well in practice, without the need to overcomplicate it with a learnable method. I'd like to see whether this \"learned GCN-based coarse-graining\" is really necessary.\n\n3. How sensitive is the path signature transform to very dynamic conformational changes in a short duration of time? For instance, as I mentioned above, fast-folding proteins undergo significant changes in 3D shape in just short simulations. Can this method capture this dynamics well enough?", "limitations": "", "rating": 8, "confidence": 3, "soundness": 3, "presentation": 3, "contribution": 2, "strengths": "1. Incorporates appropriate symmetries for (temporal) 3D point cloud learning. In particular, the invariance to time reparameterization is key because the underlying MD simulations might be prone to random restarts and miscellaneous artefacts preventing them from being a smooth \"video\" (ie, the MD itself might be erratic with the same state sampled repeatedly).\n\n2. Deep Signature _learns_ the ideal CG beads relevant to the task, bypassing the need to manually remove degrees of freedom (eg: CA-level coarse-graining, as done in existing methods). The use of the signature transform allows for local and global temporal interactions to be captured well, as opposed to learning representations on separate frames. \n\n3. I'm confident this method can be used for good representation learning of trajectory information for tasks beyond the ones mentioned in the paper (eg: interpolation in the latent space of protein conformations, perhaps for ensemble generation).\n\n4. Demonstrates relatively good performance compared to weak and strong temporal graph learning baselines (like GraphLSTM).", "weaknesses": "The paper does not clarify the level of coarsening necessary to make path signature computations feasible. For instance, in gene regulatory dynamics, the graph was reduced from 100 nodes to 30, while the EGFR dataset was reduced from approximately 5000 atoms to 50 nodes, but the level of coarsening for the GPCR dataset is unspecified. This raises questions about whether 50 nodes is a computational limit for the method. Additionally, while protein structure can be intuitively coarsened into backbones, sidechains, and motifs, the interpretation for coarsened graphs in gene expression dynamics is unclear. It is uncertain if the coarsened nodes correspond to gene hubs or other biologically meaningful groupings.\n\nThe equation used to model GRN dynamics (Eqn 13 in Section B.1) appears incorrect. Specifically, for dimerization (when f=2), the concentration should should be squared under Michaelis-Menten kinetics, rather than simply doubling the decay rate. This could lead to inaccurate modeling of gene expression dynamics and affect the results in this section.\n\nThe comparisons used in the experiments are limited and static, primarily involving the first and last frames (head, tail, and head & tail) which do not capture temporal dynamics. The authors do not benchmark against dynamic approaches that consider time-varying information, such as MDTraj [1], Timewarp [2], and DSR [3]. Including these comparisons would provide a more rigorous evaluation of Deep Signature's effectiveness relative to established tools for molecular trajectory analysis.\n\nThe authors claim that the coarsened dynamics in Fig 6c follow the same trend as the original dynamics, yet this similarity is not quantified. Providing a quantitative measure, such as correlation coefficients between the original and coarsened dynamics at various coarsening levels, would better support this claim. Additionally, the paper would benefit from comparisons of the authors' coarsening strategy against other deterministic and learnable methods for protein graph coarsening to demonstrate its effectiveness and fidelity in preserving dynamics.\n\nThe description of the cross-validation process and test set creation is confusing. The authors mention “for each running, we evaluate the prediction accuracy of our method on an independent unseen test set and report the averaged results,” but it is not clear how this set is constructed. If results are averaged, please report the standard deviation in all the tables.\n[1] MDTraj: A Modern Open Library for the Analysis of Molecular Dynamics Trajectories. Biophysical Journal, 2015.\n[2] Timewarp: Transferable Acceleration of Molecular Dynamics by Learning Time-Coarsened Dynamics. NeurIPS 2023\n[3] DSR: Dynamical Surface Representation as Implicit Neural Networks for Protein. NeurIPS 2023.", "quality": null, "clarity": null, "significance": null, "originality": null, "strengths_and_weaknesses": "", "was_revised": false, "final_justification": "", "rebuttal": "", "claims_and_evidence": "", "methods_and_evaluation_criteria": "", "theoretical_claims": "", "experimental_designs_or_analyses": "", "relation_to_broader_scientific_literature": "", "essential_references_not_discussed": "", "other_strengths_and_weaknesses": "", "other_comments_or_suggestions": "", "questions_for_authors": "", "summary_of_paper": "", "summary_of_recommendation": "", "technical_quality": "", "clarity_of_presentation": "", "potential_impact": "", "robotics_focus": "", "quality_of_limitations": "", "questions_for_rebuttal": "", "reasons_to_accept": "", "reasons_to_reject": "", "questions_to_authors": "", "extra_scores": {}}, {"review_id": "EfOL9f7AbC", "reviewer": "Reviewer_9koh", "summary": "In the paper, the authors introduce the Deep Signature framework to capture complex dynamics using the evolution trajectories. The Deep Signature framework includes spectral clustering, signature transform and a classifier. Additionally, the authors show that the framework satisfies the desired symmetry constraints. Experiments on  gene regulatory dynamics, EGFR mutation dynamics and GPCR dynamics exhibit the empirical performance of the framework.", "questions": "1. I think the classification task using evolution trajectories is not a common setting. Could you explain why this problem setting is reasonable comparing to the one frame classification setting?  Do we really need the complete trajectory to do classification?\n\n2. I do not understand your setting in the EGFR dynamics experiment since I'm not an expert on this domain. Could you please explain why the trajectory can be labeled according to its sensitivity towards the drug? I think the sensitivity should be a number rather than a 0/1 label.", "limitations": "", "rating": 6, "confidence": 3, "soundness": 2, "presentation": 3, "contribution": 2, "strengths": "1. The presentation of the method is very clear and easy to understand.\n2. The motivation of applying signature transform is reasonable.", "weaknesses": "1. Lack of experiments on large dataset. As the paper claims, the Deep Signature framework can capture large-scale complex dynamics. So I think experiments on datasets with large amount of data and system size are necessary. But the paper only includes the experiments on datasets with large system size.\n\n2. I think the baseline in this paper is too weak. For example, the author should compare the strong baseline with graph transformer architecture[1] based on the first/last frame of the trajectory. Comparations between these strong baseline may strengthen the empirical performance of the framework.\n\n[1].Ying, Chengxuan, et al. \"Do transformers really perform badly for graph representation?.\" Advances in neural information processing systems 34 (2021): 28877-28888.", "quality": null, "clarity": null, "significance": null, "originality": null, "strengths_and_weaknesses": "", "was_revised": false, "final_justification": "", "rebuttal": "", "claims_and_evidence": "", "methods_and_evaluation_criteria": "", "theoretical_claims": "", "experimental_designs_or_analyses": "", "relation_to_broader_scientific_literature": "", "essential_references_not_discussed": "", "other_strengths_and_weaknesses": "", "other_comments_or_suggestions": "", "questions_for_authors": "", "summary_of_paper": "", "summary_of_recommendation": "", "technical_quality": "", "clarity_of_presentation": "", "potential_impact": "", "robotics_focus": "", "quality_of_limitations": "", "questions_for_rebuttal": "", "reasons_to_accept": "", "reasons_to_reject": "", "questions_to_authors": "", "extra_scores": {}}, {"review_id": "XYjutBJhXU", "reviewer": "Reviewer_xZWn", "summary": "The paper presents a framework, Deep Signature, designed to analyze the dynamics and interatomic interactions of large-scale molecular system. The method uses a deep spectral clustering model to capture coarse grained dynamics, a path signature transform module to characterize interatomic interactions through iterated integrals, and a classifier for property prediction. Theoretically, Deep Signature is shown to maintain desirable symmetry properties. The method demonstrates improved accuracy across three benchmarks and demonstrates interpretability.", "questions": "1. How were the hyperparameters chosen, such as the loss coefficient parameters $\\lambda_i$,  the number of nodes in deep spectral clustering model, and time interval $[r_i, r_{i+1}]$ in path signature transform?\n2. When visualizing critical pathways and interatomic interactions on the EGFR dynamics, why were three atoms identified specifically? Could more than three be selected?\n3. Have the authors considered comparing their approach with advanced time series classification algorithms？\n4. How does the computational efficiency of the proposed method compare to baseline methods?", "limitations": "", "rating": 6, "confidence": 2, "soundness": 2, "presentation": 3, "contribution": 3, "strengths": "1. Authors develop an end-to-end framework to characterize interatomic interactions and dynamics of large-scale molecules, it shows improvement on three benchmarks and provides interpretability. \n2. The size of the system is reduced by deep spectral clustering module without any expert knowledge. \n3. The framework's desirable properties are supported by theoretical analysis.", "weaknesses": "1. The authors compare their approach to baseline methods, but a more comprehensive comparison with some SOTA baselines would provide a more robust evaluation. \n2. The manuscript would benefit from a comparison of deep spectral clustering module with existing coarse graining methods. \n3. An analysis of the model’s sensitivity to hyperparameters would provide insights into its robustness and reproducibility.", "quality": null, "clarity": null, "significance": null, "originality": null, "strengths_and_weaknesses": "", "was_revised": false, "final_justification": "", "rebuttal": "", "claims_and_evidence": "", "methods_and_evaluation_criteria": "", "theoretical_claims": "", "experimental_designs_or_analyses": "", "relation_to_broader_scientific_literature": "", "essential_references_not_discussed": "", "other_strengths_and_weaknesses": "", "other_comments_or_suggestions": "", "questions_for_authors": "", "summary_of_paper": "", "summary_of_recommendation": "", "technical_quality": "", "clarity_of_presentation": "", "potential_impact": "", "robotics_focus": "", "quality_of_limitations": "", "questions_for_rebuttal": "", "reasons_to_accept": "", "reasons_to_reject": "", "questions_to_authors": "", "extra_scores": {}}]

Author rebuttal:

Decision: Accept (Poster)